A counterexample to a proposed dynamic programming algorithm for optimal bid construction in an auction-based fully distributed manufacturing system

The paper by Veeramani and Wang (Int J Adv Manuf Technol 28:541–550, 2006) published in this journal offers a general bid construction scheme for minimizing the job flow time in auction-based manufacturing control and claims the optimality of the procedure. The purpose of this note is to provide a small example, in which their proposed new method fails to produce an optimal solution. We also address efficient correct algorithms so as to protect the readers from mistakenly believing that their new procedure is a better way of computing solutions.