Skip to main content

Advertisement

SpringerLink
Log in

Meta-heuristics to solve single-machine scheduling problem with sequence-dependent setup time and deteriorating jobs

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

Abstract

This paper tackles the single-machine scheduling problem in which there are sequence-dependent setup times and deteriorating jobs. In this regard, a mathematical model has been formulated to minimize makespan (C max). Afterwards, genetic and tabu search algorithms have been developed. Since the population diversity is a very important issue in preventing neighborhood search from trapping in a local optimum, some methods have been applied to genetic algorithm in order to maintain population diversity, and the final results show the effectiveness of these methods. The calibration of genetic algorithm parameters and operators is performed using design of experiments. Finally, several examples are produced to illustrate the proposed approach.

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. Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38:495–498

    Article  MATH  Google Scholar 

  2. Gupta JND, Gupta SK (1988) Single facility scheduling with nonlinear processing times. Comput Ind Eng 14:387–393

    Article  Google Scholar 

  3. Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187:985–1032

    Article  MATH  MathSciNet  Google Scholar 

  4. Jeng A, Lin B (2005) Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs. Comp Oper Res 32:521–536

    Article  MATH  Google Scholar 

  5. Stecco G, Cordeau J-F, Moretti E (2009) A tabu search heuristic for a sequence dependent and time-dependent scheduling problem on a single machine. J Sched 12:3–16

    Article  MATH  MathSciNet  Google Scholar 

  6. Shin HJ, Kim C-O, Kim SS (2002) A tabu search algorithm for single machine scheduling with release times, due dates, and sequence-dependent set-up times. Int J Adv Manuf Technol 19:859–866

    Article  Google Scholar 

  7. Ji M, Cheng TCE (2008) Parallel-machine scheduling with simple linear deterioration to minimize total completion time. Eur J Oper Res 188:342–347

    Article  MATH  MathSciNet  Google Scholar 

  8. Ji M, Cheng TCE (2010) Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan. Eur J Oper Res 202:90–98. doi:10.1016/j.ejor.2009.05.021

    Article  MATH  MathSciNet  Google Scholar 

  9. Wang J-B, Huang X, Wang X-Y, Yin N, Wang L-Y (2009) Learning effect and deteriorating jobs in the single machine scheduling problems. Appl Math Model 33:3848–3853

    Article  MATH  MathSciNet  Google Scholar 

  10. Low C, Hsu C-J, Su C-T (2008) Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration. Comput Math Appl 56:257–265

    Article  MATH  MathSciNet  Google Scholar 

  11. Wang J-B, Gao W-J, Wang L-Y, Wang D (2009) Single machine group scheduling with general linear deterioration to minimize the makespan. Int J Adv Manuf Technol 43:146–150

    Article  Google Scholar 

  12. Wang J-B, Wang L-Y, Wang D, Wang X-Y (2009) Single-machine scheduling with a time-dependent deterioration. Int J Adv Manuf Technol 43:805–809. doi:10.1007/s00170-008-1760-6

    Article  Google Scholar 

  13. Yin N, Wang J-B, Wang D, Wang L-Y, Wang X-Y (2009) Deteriorating jobs and learning effects on a single-machine scheduling with past-sequence-dependent setup times. Int J Adv Manuf Technol 46:707–714. doi:10.1007/s00170-009-2116-6

    Article  Google Scholar 

  14. Wang J-B, Jiang Y, Wang G (2009) Single-machine scheduling with past-sequence-dependent setup times and effects of deterioration and learning. Int J Adv Manuf Technol 41:1221–1226

    Article  Google Scholar 

  15. Koulamas C, Kyparisis GJ (2008) Single-machine scheduling problems with past-sequence-dependent setup times. Eur J Oper Res 187:68–72

    Google Scholar 

  16. Bagchi TP, Deb K (1996) Calibration of GA parameters: the design of experiments approach. Comput Sci Inform 26(3):46–56

    Google Scholar 

  17. Nagano MS, Ruiz R, Lorena LAN (2008) A constructive genetic algorithm for permutation flowshop scheduling. Comput Ind Eng 55:195–207

    Article  Google Scholar 

  18. Iyer SK, Saxena B (2004) Improved genetic algorithm for the permutation flowshop scheduling problem. Comp Oper Res 31:593–606

    Article  MATH  MathSciNet  Google Scholar 

  19. Vallada E, Ruiz R (2010) Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem. Omega 38:57–67. doi:10.1016/j.omega.2009.04.002

    Article  Google Scholar 

  20. Ruiz R, Maroto C, Alcaraz J (2005) Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. Eur J Oper Res 165:34–54

    Article  MATH  MathSciNet  Google Scholar 

  21. Ruiz R, Maroto C, Alcaraz J (2006) Two new robust genetic algorithms for the flowshop scheduling problem. Omega 34:461–476

    Article  Google Scholar 

  22. Sivanandam SN, Deepa SN (2008) Introduction to genetic algorithms. Springer, New York, pp 47–48

    MATH  Google Scholar 

  23. Zhou H, Cheung W, Leung LC (2009) Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm. Eur J Oper Res 194:637–649

    Article  MATH  Google Scholar 

  24. Nearchou AC (2004) The effect of various operators on the genetic search for large scheduling problems. Int J Prod Econ 88:191–203

    Article  Google Scholar 

  25. Glover F, Laguna M (1997) Tabu search. Kluwer, Boston

    MATH  Google Scholar 

  26. Sivanandam SN, Deepa SN (2008) Introduction to genetic algorithms. Springer, New York, pp 89–90

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran

    Unes Bahalke, Abdol Majid Yolmeh & Kamran Shahanaghi

Authors
  1. Unes Bahalke
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abdol Majid Yolmeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kamran Shahanaghi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Abdol Majid Yolmeh.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bahalke, U., Yolmeh, A.M. & Shahanaghi, K. Meta-heuristics to solve single-machine scheduling problem with sequence-dependent setup time and deteriorating jobs. Int J Adv Manuf Technol 50, 749–759 (2010). https://doi.org/10.1007/s00170-010-2526-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-010-2526-5

Keywords

Search

Navigation