Skip to main content
SpringerLink
Log in

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

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Veeramani D, Wang K-J (2006) Bid construction scheme for job flow time reduction in auction-based fully-distributed manufacturing systems. Int J Adv Manuf Technol 28:541–550

    Article  Google Scholar 

  2. Ghosh JB (1994) Batch scheduling to minimize total completion time. Oper Res Lett 16:271–275

    Article  MATH  Google Scholar 

  3. Potts CN, Kovalyov MY (2000) Scheduling with batching: a review. Eur J Oper Res 120:228–249

    Article  MATH  MathSciNet  Google Scholar 

  4. Brucker P (2007) Scheduling algorithms, 5th edn. Springer, Heidelberg, pp 281–286

    MATH  Google Scholar 

  5. Monma CL, Potts CN (1989) On the complexity of scheduling with batch setup times. Oper Res 37(5):798–804

    Article  MATH  MathSciNet  Google Scholar 

  6. Ahn B-H, Hyun J-H (1990) Single facility multi-class job scheduling. Comput Oper Res 17(3):265–272

    Article  MATH  Google Scholar 

  7. Potts CN (1991) Scheduling two job classes on a single machine. Comput Oper Res 18(5):411–415

    Article  MATH  Google Scholar 

  8. Mizutani E (2013) A note on dynamic programming formulations for scheduling job classes with changeover times on a single machine. In: Proceedings of the IEEE international conference on industrial engineering and engineering management

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Management, National Taiwan University of Science and Technology, Taiwan, 106, Taipei, Republic of China

    Eiji Mizutani

Authors
  1. Eiji Mizutani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eiji Mizutani.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mizutani, E. A counterexample to a proposed dynamic programming algorithm for optimal bid construction in an auction-based fully distributed manufacturing system. Int J Adv Manuf Technol 71, 377–380 (2014). https://doi.org/10.1007/s00170-013-5466-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-013-5466-z

Keywords

Search

Navigation