Skip to main content
SpringerLink
Log in

An effective hybrid simulated annealing and two mixed integer linear formulations for just-in-time open shop scheduling problem

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

Abstract

This paper addresses open shop scheduling problem from the viewpoint of just-in-time management in which the objective function is to minimize the sum of weighted earliness/tardiness penalties. The problem is formulated as two different mixed integer linear programming models. To solve the problem, a novel hybrid two-phase algorithm is presented. In the first phase, a simulated annealing is applied to search the appropriate sequences of jobs on machines. Based on the job sequences obtained in the first phase, one of the proposed mathematical formulations can be reduced to a linear programming model and in the second phase by solving the linear programming model, the start time of jobs on machines can be determined. In order to evaluate the quality of solutions, a specific branching strategy is applied in solving the other mathematical model to obtain a lower bound. Computational results show that the algorithm obtains high-quality solutions in reasonable time.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Pinedo M (2008) Scheduling. Springer, Berlin

    MATH  Google Scholar 

  2. Sha DY, Hsu CY (2008) A new particle swarm optimization for the open shop scheduling problem. Comput Oper Res 35:3243–3261

    Article  MATH  Google Scholar 

  3. Prins C (1994) An overview of scheduling problems arising in satellite communications. J Oper Res Soc 40:611–623

    Google Scholar 

  4. Liu CY, Bulfin RL (1987) Scheduling ordered open shops. Comput Oper Res 14:257–264

    Article  MathSciNet  MATH  Google Scholar 

  5. Kubiak W, Sriskandarajah C, Zaras K (1991) A note on the complexity of open shop scheduling problems. Infor 29:284–294

    MATH  Google Scholar 

  6. Valente JMS, Alves RAFS (2008) Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties. Computers and Operations Research 3696–3713

  7. Davis JS, Kanet JJ (1993) Single-machine scheduling with early and tardy completion costs. Nav Res Logist 40:85–101

    Article  MATH  Google Scholar 

  8. Ohno T (1988) Toyota production system: beyond large-scale production. Productivity Press, New York

    Google Scholar 

  9. Baker KR, Scudder GD (1990) Sequencing with earliness and tardiness penalties: a review. Oper Res 38:22–36

    Article  MathSciNet  MATH  Google Scholar 

  10. Bulbul K, Kaminsky P, Yano C (2007) Preemption in single machine earliness/tardiness scheduling. J Sched 10:271–292

    Article  MathSciNet  Google Scholar 

  11. Hendel Y, Sourd F (2006) Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem. Eur J Oper Res 173:108–119

    Article  MathSciNet  MATH  Google Scholar 

  12. Hoogeveen JA, Van De Velde SL (1996) A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time. INFORMS J Comput 8:402–412

    Article  MATH  Google Scholar 

  13. Sourd F, Kedad-Sidhoum S (2008) A faster branch-and-bound algorithm for the earliness–tardiness scheduling problem. J Sched 11:49–58

    Article  MathSciNet  MATH  Google Scholar 

  14. Sourd F, Kedad-Sidhoum S (2008) The one machine problem with earliness and tardiness penalties. J Sched 6:533–549

    Article  MathSciNet  Google Scholar 

  15. Sun H, Wang G (2003) Parallel machine earliness and tardiness scheduling with proportional weights. Comput Oper Res 30:801–808

    Article  MATH  Google Scholar 

  16. Jozefowska J (2007) Just-in-time scheduling. Springer, Berlin

    MATH  Google Scholar 

  17. Valente JMS, Moreira MRA (2009) Greedy randomised dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties. Int J Adv Manuf Technol 44:995–1009

    Article  Google Scholar 

  18. Tsai TI (2007) A genetic algorithm for solving the single machine earliness/tardiness problem with distinct due dates and ready times. Int J Adv Manuf Technol 31:994–1000

    Article  Google Scholar 

  19. Wodecki M (2009) A block approach to earliness–tardiness scheduling problems. Int J Adv Manuf Technol 40:797–807

    Article  Google Scholar 

  20. Chen ZL, Lee CY (2002) Parallel machine scheduling with a common due window. Eur J Oper Res 136:512–527

    Article  MathSciNet  MATH  Google Scholar 

  21. Chen ZL, Powell WB (1999) A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem. Eur J Oper Res 116:221–233

    Google Scholar 

  22. Cheng TCE, Chen ZL (1994) Parallel-machine scheduling with earliness and tardiness penalties. J Oper Res Soc 45:685–695

    MATH  Google Scholar 

  23. Federgruen A, Mosheiov G (1996) Heuristics for multi-machine scheduling problem with earliness and tardiness costs. Manag Sci 42:1544–1556

    Article  MATH  Google Scholar 

  24. Jeong SJ, Kim KS (2008) Parallel machine scheduling with earliness–tardiness penalties and space limits. Int J Adv Manuf Technol 37:793–802

    Article  Google Scholar 

  25. Su LH (2009) Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system. Comput Oper Res 36:461–471

    Article  MathSciNet  MATH  Google Scholar 

  26. ToksarI MD, Guner E (2008) Minimizing the earliness/tardiness costs on parallel machine with learning effects and deteriorating jobs: a mixed nonlinear integer programming approach. Int J Adv Manuf Technol 38:801–808

    Article  Google Scholar 

  27. Akyol DE, Bayhan GM (2008) Multi-machine earliness and tardiness scheduling problem: an interconnected neural network approach. Int J Adv Manuf Technol 37:576–588

    Article  Google Scholar 

  28. Zegordi SH, Itoh K, Enkawa T (1995) A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem. Int J Prod Res 33:1449–1466

    Article  MATH  Google Scholar 

  29. Ow PS, Morton TE (1989) The single machine early/tardy problem. Manag Sci 35:177–191

    Article  MathSciNet  MATH  Google Scholar 

  30. Amin-Nayeri MR, Moslehi G (2001) Optimal algorithm for flow shop sequencing to minimize early/tardy cost. Int J Eng Sci 12:191–209

    Google Scholar 

  31. Moslehi G, Mirzaee M, Vasei M, Modarres M, Azaron A (2009) Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness. Int J Prod Econ 122:763–773

    Article  Google Scholar 

  32. Beck JC, Refalo P (2003) A hybrid approach to scheduling with earliness and tardiness costs. Ann Oper Res 118:49–71

    Article  MathSciNet  MATH  Google Scholar 

  33. Danna E, Rothberg E, Le Pape C (2003) Integrating mixed integer programming and local search: a case study on job-shop scheduling problems. Proceedings of CPAIOR’03 http://www.crt.umontreal.ca/cpaior/

  34. Danna E, Perron L (2003) Structured vs. unstructured large neighborhood search: a case study on job-shop scheduling problems with earliness and tardiness costs. In: Rossi F (ed) Principles and practice of constraint programming—CP 2003. Springer, Berlin, pp 817–821

    Chapter  Google Scholar 

  35. Adamopoulos GI, Pappis CP (1998) Scheduling under a common due-date on parallel unrelated machines. Eur J Oper Res 105:494–501

    Article  MATH  Google Scholar 

  36. Baptiste P, Flamini M, Sourd F (2008) Lagrangian bounds for just-in-time job-shop scheduling. Comput Oper Res 35:906–915

    Article  MathSciNet  MATH  Google Scholar 

  37. Naderi, B, Fatemi Ghomi, SMT, Aminnayeri, M, Zandieh, M. A study on open shop scheduling to minimise total tardiness, to appear in International Journal of Production Research

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran

    Seyed Hossein Hashemi Doulabi, Sahar Arab & Hamid Davoudpour

  2. European Centre for Soft Computing, Mieres, Spain

    Milad Avazbeigi

Authors
  1. Seyed Hossein Hashemi Doulabi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Milad Avazbeigi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sahar Arab
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hamid Davoudpour
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seyed Hossein Hashemi Doulabi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hashemi Doulabi, S.H., Avazbeigi, M., Arab, S. et al. An effective hybrid simulated annealing and two mixed integer linear formulations for just-in-time open shop scheduling problem. Int J Adv Manuf Technol 59, 1143–1155 (2012). https://doi.org/10.1007/s00170-011-3546-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-011-3546-5

Keywords

Search

Navigation