Skip to main content
SpringerLink
Log in

Iterated hybrid metaheuristic algorithms for unrelated parallel machines problem with unequal ready times and sequence-dependent setup times

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

Abstract

The problem considered in this paper involves a set of independent jobs on unrelated parallel machines with sequence-dependent setup times and unequal ready times, and the objective is to minimize the weighted number of tardy jobs. Iterated hybrid metaheuristic algorithms are proposed to address this problem. The algorithms begin with effective initial solution generators to generate initial feasible solutions; then, hybrid metaheuristics are applied to improve the initial solutions, integrating the principles of the variable neighborhood descent approach and tabu search. If the search becomes trapped at a local optimum, a perturbation operator is developed to help the search escape. To evaluate the performance of the suggested algorithms, heuristic rules and iterated local search algorithms are examined and compared. Computational experimental results show that the proposed algorithms outperform the other heuristics.

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. Yu L, Shih HM, Pfund M, Carlyle WM, Fowler JW (2002) Scheduling of unrelated parallel machines: an application to PWB manufacturing. IIE Trans 34:921–931

    Google Scholar 

  2. Hsieh JC, Chang PC, Hsu LC (2003) Scheduling of drilling operations in printed circuit board factory. Comp Industr Engin 44:461–473

    Article  Google Scholar 

  3. Kim DW, Kim KH, Jang W, Chen FF (2002) Unrelated parallel machine scheduling with setup times using simulated annealing. Robot Comput Integrated Manuf 18:223–231

    Article  Google Scholar 

  4. Silva C, Magalhaes JM (2006) Heuristic lot size scheduling on unrelated parallel machines with applications in the textile industry. Comp Industr Engin 50:76–89

    Article  Google Scholar 

  5. Zhang Z, Zheng L, Weng MX (2007) Dynamic parallel machine scheduling with mean weighted tardiness objective by Q-Learning. Int J Adv Manufact Technol 34:968–980

    Article  Google Scholar 

  6. Bilyk A, Mönch L (2010) A variable neighborhood search approach for planning and scheduling of jobs on unrelated parallel machines. J Intell Manuf. doi:10.1007/s10845-010-0464-6

  7. Glass CA, Potts CN, Shade P (1994) Unrelated parallel machine scheduling using local search. Math Comput Model 20:41–52

    Article  MATH  Google Scholar 

  8. Piersma N, van Dijk W (1996) A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search. Math Comput Model 24:11–19

    Article  MATH  Google Scholar 

  9. Ghirardi M, Potts CN (2005) Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach. Eur J Oper Res 165:457–467

    Article  MATH  Google Scholar 

  10. Fanjul-Peyro L, Ruiz R (2010) Iterated greedy local search methods for unrelated parallel machine scheduling. Eur J Oper Res 207:55–69

    Article  MathSciNet  MATH  Google Scholar 

  11. Fanjul-Peyro L, Ruiz R (2011) Size-reduction heuristics for the unrelated parallel machines scheduling problem. Comput Oper Res 38:301–309

    Article  Google Scholar 

  12. Fleszar K, Charalambous C, Hindi KS (2011) A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times. J Intell Manuf. doi:10.1007/s10845-011-0522-8

  13. Weng MX, Lu J, Ren H (2001) Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective. Int J Prod Econ 70:215–226

    Article  Google Scholar 

  14. Guinet A (1995) Scheduling independent jobs on uniform parallel machines to minimize tardiness criteria. J Intell Manuf 6:95–103

    Article  Google Scholar 

  15. Randhawa SU, Kuo CH (1997) Evaluating scheduling heuristics for non-identical parallel processors. Int J Prod Res 35:969–981

    Article  MATH  Google Scholar 

  16. Chen JF (2009) Scheduling on unrelated parallel machines with sequence- and machine-dependent setup times and due-date constraints. Int J Adv Manuf Technol 44:1204–1212

    Article  Google Scholar 

  17. Lin SW, Lu CC, Ying KC (2011) Minimization of total tardiness on unrelated parallel machines with sequence- and machine-dependent setup times under due date constraints. Int J Adv Manuf Technol 53:353–361

    Article  Google Scholar 

  18. Liaw CF, Lin YK, Cheng CY, Chen M (2003) Scheduling unrelated parallel machines to minimize total weighted tardiness. Comput Oper Res 30:1777–1789

    Article  MathSciNet  MATH  Google Scholar 

  19. Jolai F, Amalnick MS, Alinaghian M, Shakhsi-Niaei M, Omrani H (2011) A hybrid memetic algorithm for maximizing the weighted number of just-in-time jobs on unrelated parallel machines. J Intell Manuf 22:247–261

    Article  Google Scholar 

  20. Ho JC, Chang YL (1995) Minimizing the number of tardy jobs for m-parallel machines. Eur J Oper Res 84:343–355

    Article  MATH  Google Scholar 

  21. M'Hallah R, Bulfin RL (2005) Minimizing the weighted number of tardy jobs on parallel processors. Eur J Oper Res 160(2):471–484

    Article  MathSciNet  MATH  Google Scholar 

  22. Chen CL, Chen CL (2009) Hybrid metaheuristics for unrelated parallel machine scheduling with sequence-dependent setup times. Int J Adv Manuf Technol 43:161–169

    Article  Google Scholar 

  23. Suresh V, Chaudhuri D (1996) Bicriteria scheduling problem for unrelated parallel-machines. Comput Ind Eng 30(1):77–82

    Article  Google Scholar 

  24. Tavakkoli-Moghaddam R, Taheri F, Bazzazi M, Izadi M, Sassani F (2009) Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints. Comput Oper Res 36:3224–3230

    Article  MATH  Google Scholar 

  25. Gao J, He G, Wang Y (2009) A new parallel genetic algorithm for solving multiobjective scheduling problems subjected to special process constraint. Int J Adv Manuf Technol 43:151–160

    Article  Google Scholar 

  26. Chyu CC, Chang WS (2010) A Pareto evolutionary algorithm approach to bi-objective unrelated parallel machine scheduling problems. Int J Adv Manuf Technol 49:697–708

    Article  Google Scholar 

  27. Bilge Ü, Kıraç F, Kurtulan M, Pekgün P (2004) A tabu search algorithm for parallel machine total tardiness problem. Comput Oper Res 31:397–414

    Article  MATH  Google Scholar 

  28. Logendran R, Subur F (2004) Unrelated parallel machine scheduling with job splitting. IIE Trans 36:359–372

    Article  Google Scholar 

  29. Logendran R, McDonell B, Smucker B (2007) Scheduling unrelated parallel machines with sequence-dependent setups. Comput Oper Res 34:3420–3438

    Article  MathSciNet  MATH  Google Scholar 

  30. Lourenco HR, Martin OC, Stutzle T (2002) Iterated local search. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer, Boston, pp 321–353

    Google Scholar 

  31. Hansen P, Mladenović N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130:449–467

    Article  MATH  Google Scholar 

  32. Glover F (1989) Tabu search, part I. ORSA J Comput 1:190–206

    Article  MathSciNet  MATH  Google Scholar 

  33. Lawler EL, Moore JM (1969) A functional equation and its application to resource allocation and sequencing problems. Manag Sci 16:77–84

    Article  MATH  Google Scholar 

  34. Mladenović N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24:1097–1100

    Article  MathSciNet  MATH  Google Scholar 

  35. Chen CL (2008) An iterated local search for unrelated parallel machines problem with unequal ready times. The IEEE International Conference on Automation and Logistics 2044–2047

  36. Rios-Mercado RZ, Bard JF (1998) Heuristics for the flow line problem with setup costs. Eur J Oper Res 110:76–98

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Accounting Information, Takming University of Science and Technology, No. 56, Sec. 1, Huanshan Road, Neihu District, Taipei City, Taiwan, Republic of China

    Chun-Lung Chen

Authors
  1. Chun-Lung Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chun-Lung Chen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, CL. Iterated hybrid metaheuristic algorithms for unrelated parallel machines problem with unequal ready times and sequence-dependent setup times. Int J Adv Manuf Technol 60, 693–705 (2012). https://doi.org/10.1007/s00170-011-3623-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-011-3623-9

Keywords

Search

Navigation