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.
Similar content being viewed by others
References
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
Hsieh JC, Chang PC, Hsu LC (2003) Scheduling of drilling operations in printed circuit board factory. Comp Industr Engin 44:461–473
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
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
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
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
Glass CA, Potts CN, Shade P (1994) Unrelated parallel machine scheduling using local search. Math Comput Model 20:41–52
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
Ghirardi M, Potts CN (2005) Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach. Eur J Oper Res 165:457–467
Fanjul-Peyro L, Ruiz R (2010) Iterated greedy local search methods for unrelated parallel machine scheduling. Eur J Oper Res 207:55–69
Fanjul-Peyro L, Ruiz R (2011) Size-reduction heuristics for the unrelated parallel machines scheduling problem. Comput Oper Res 38:301–309
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
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
Guinet A (1995) Scheduling independent jobs on uniform parallel machines to minimize tardiness criteria. J Intell Manuf 6:95–103
Randhawa SU, Kuo CH (1997) Evaluating scheduling heuristics for non-identical parallel processors. Int J Prod Res 35:969–981
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
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
Liaw CF, Lin YK, Cheng CY, Chen M (2003) Scheduling unrelated parallel machines to minimize total weighted tardiness. Comput Oper Res 30:1777–1789
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
Ho JC, Chang YL (1995) Minimizing the number of tardy jobs for m-parallel machines. Eur J Oper Res 84:343–355
M'Hallah R, Bulfin RL (2005) Minimizing the weighted number of tardy jobs on parallel processors. Eur J Oper Res 160(2):471–484
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
Suresh V, Chaudhuri D (1996) Bicriteria scheduling problem for unrelated parallel-machines. Comput Ind Eng 30(1):77–82
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
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
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
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
Logendran R, Subur F (2004) Unrelated parallel machine scheduling with job splitting. IIE Trans 36:359–372
Logendran R, McDonell B, Smucker B (2007) Scheduling unrelated parallel machines with sequence-dependent setups. Comput Oper Res 34:3420–3438
Lourenco HR, Martin OC, Stutzle T (2002) Iterated local search. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer, Boston, pp 321–353
Hansen P, Mladenović N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130:449–467
Glover F (1989) Tabu search, part I. ORSA J Comput 1:190–206
Lawler EL, Moore JM (1969) A functional equation and its application to resource allocation and sequencing problems. Manag Sci 16:77–84
Mladenović N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24:1097–1100
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
Rios-Mercado RZ, Bard JF (1998) Heuristics for the flow line problem with setup costs. Eur J Oper Res 110:76–98
Author information
Authors and Affiliations
Corresponding author
Rights 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
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-011-3623-9