Abstract
This study considers the problem of scheduling jobs on unrelated parallel machines with machine-dependent and job sequence-dependent setup times. In this study, a restricted simulated annealing (RSA) algorithm which incorporates a restricted search strategy is presented to minimize the makespan. The proposed RSA algorithm can effective reduce the search effort required to find the best neighborhood solution by eliminating ineffective job moves. The effectiveness and efficiency of the proposed RSA algorithm is compared with the basic simulated annealing and existing meta-heuristics on a benchmark problem dataset used in earlier studies. Computational results indicate that the proposed RSA algorithm compares well with the state-of-the-art meta-heuristic for small-sized problems, and significantly outperforms basic simulated annealing algorithm and existing algorithms for large-sized problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Al-Salem A. (2004) Scheduling to minimize makespan on unrelated parallel machines with sequence dependent setup times. Engineering Journal of the University of Qatar 17: 177–187
Armentano V. A., Yamashita D. S. (2000) Tabu search for scheduling on identical parallel machines to minimize mean tardiness. Journal of Intelligent Manufacturing 11: 453–460
Arnaout, J.-P., Rabadi, G., & Musa, R. (2010). A two-stage ant colony optimization to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. Journal of Intelligent Manufacturing, 21, 693–701.
Chen J. F. (2006) Minimization of maximum tardiness on unrelated parallel machines with process restrictions and setups. International Journal of Advanced Manufacturing Technology 29: 557–563
Cheng T. C. E., Sin C. C. S. (1990) A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research 47: 271–292
Gairing M., Monien B., Woclaw A. (2007) A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theoretical Computer Science 380: 87–99
Ghirardi M., Potts C. N. (2005) Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach. European Journal of Operational Research 165: 457–467
Glass C. A., Potts C. N., Shade P. (1994) Unrelated parallel machine scheduling using local search. Mathematical and Computer Modeling 20: 41–52
Graham R. L., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G. (1979) Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5: 287–326
Helal M., Rabadi G., Al-Salem A. (2006) A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times. International Journal of Operations Research 3: 182–192
Kim D. W., Kim K. H., Jang W., Chen F. F. (2002) Unrelated parallel machine scheduling with setup times using simulated annealing. Robotics and Computer Integrated Manufacturing 18: 223–231
Kim D. W., Na D. G., Chen F. F. (2003) Unrelated parallel machine scheduling with setup times and total weighted tardiness objective. Robotics and Computer Integrated Manufacturing 19: 173–181
Kirkpatrick S., Gelatt C. D., Vecch M. P. (1983) Optimization by simulated annealing. Science 220: 671–680
Lancia G. (2000) Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan. European Journal of Operational Research 120: 277–288
Liaw C. F., Lin Y. K., Chen C. Y., Chen M. (2003) Scheduling unrelated parallel machines to minimize total weighted tardiness. Computers & Operations Research 30: 1777–1789
McNaughton R. (1959) Scheduling with deadlines and loss functions. Management Science 6: 1–12
Metropolis N., Rosenbluth A., Rosenbluth M., Teller A., Teller E. (1953) Equation of state calculations by fast computing machines. Journal of Chemical Physics 21: 1087–1090
Pfund M., Fowler J. W., Gupta J. N. D. (2004) A survey of algorithms for single and multi-objective unrelated parallel-machine deterministic scheduling problems. Journal of the Chinese Institute of Industrial Engineers 21: 230–241
Pinedo M. (1995) Scheduling theory, algorithm, and systems. Prentice Hall, New Jersey
Rabadi G., Moraga R. J., Al-Salem A. (2006) Heuristics for the unrelated parallel machine scheduling problem with setup times. Journal of Intelligent Manufacturing 17: 85–97
Rocha P. L., Ravetti M. G., Mateus G. R., Pardalos P. M. (2008) Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times. Computers & Operations Research 35: 1250–1264
Scheduling Research. (2005). http://www.SchedulingResearch.com, a web site that includes benchmark problem data sets and solutions for scheduling problems.
Srivastava B. (1997) An effective heuristic for minimizing makespan on unrelated parallel machines. Journal of the Operational Research Society 49: 886–894
Tang L., Luo J. (2006) A new ILS algorithm for parallel machine scheduling problems. Journal of Intelligent Manufacturing 17: 609–619
Weng M., Lu J., Ren H. (2001) Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective. International Journal of Production Economics 70: 215–226
Yi Y., Wang D. W. (2003) Soft computing for scheduling with batch setup times and earliness-tardiness penalties on parallel machines. Journal of Intelligent Manufacturing 14: 311–322
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ying, KC., Lee, ZJ. & Lin, SW. Makespan minimization for scheduling unrelated parallel machines with setup times. J Intell Manuf 23, 1795–1803 (2012). https://doi.org/10.1007/s10845-010-0483-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10845-010-0483-3