Abstract
In this paper, we explore job shop problems with two recently popular and realistic assumptions, sequence-dependent setup times and machine availability constraints to actualize the problem. The criterion is a minimization of total weighted tardiness. We establish a simple criterion to integrate machine availability constraints and scheduling decisions simultaneously. We propose a hybrid meta-heuristic to tackle the given problem. This meta-heuristic method, called EMSA, is a combination of two meta-heuristics: (1) Electromagnetic-like mechanism (EM); and (2) simulated annealing (SA). The hybridization is done to overcome some existing drawbacks of each of these two algorithms. To evaluate the proposed hybrid meta-heuristic method, we carry out a benchmark by which the proposed EMSA is compared with some existing algorithms as well as simulated annealing and electromagnetic-like mechanism alone in a fixed given computational time. All the related results and analysis obtained through the benchmark illustrate that our proposed EMSA is very effective and supersedes the foregoing algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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. doi:10.1016/j.ejor.2006.06.060
Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York
Bïrbïl I, Fang SC (2003) An electromagnetism-like mechanism for global optimization. J Glob Optim 25:263–282. doi:10.1023/A:1022452626305
Blazewicz J, Breit J, Formanowicz P, Kubiak W, Schmidt G (2001) Heuristic algorithms for the two-machine flow shop problem with limited machine availability. Omega J 29:599–608. doi:10.1016/S0305-0483(01)00048-2
Breit J (2006) A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint. Comput Oper Res 33:2143–2153. doi:10.1016/j.cor.2005.01.004
Brucker P, Thiele O (1996) A branch-and-bound method for general shop problem with sequence-dependent setup times. OR Spectr 18:145–161. doi:10.1007/BF01539706
Cerny V (1985) Thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. JOTA 45:41–51. doi:10.1007/BF00940812
Cheung W, Zhou H (2001) Using genetic algorithms and heuristics for job-shop scheduling with sequence-dependent setup times. Ann Oper Res 107:65–81. doi:10.1023/A:1014990729837
Choi I, Korkmaz O (1997) Job-shop scheduling with separable sequence-dependent setups. Ann Oper Res 70:155–170. doi:10.1023/A:1018918003761
Coleman BJ (1992) Technical note: a simple model for optimizing the single machine early/tardy problem with sequence-dependent setups, production and operations. Management 1:225–228
Debels D, Reyck BD, Leus R, Vanhoucke M (2006) A hybrid scatter search/electromagnetism meta-heuristic for project scheduling. Eur J Oper Res 169:638–653. doi:10.1016/j.ejor.2004.08.020
Dileep Sule R (1996) Industrial scheduling. PWS, USA
Heinonen J, Pettersson F (2007) Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem. Appl Math Comput 187:989–998. doi:10.1016/j.amc.2006.09.023
Holloway C, Nelson R (1974) Job-shop scheduling with due dates and variable processing times. Manage Sci 20(9):1264–1275
Huang KL, Liao CJ (2006) Ant colony optimization combined with tabu search for the job shop scheduling problem. Comput Oper Res 35:1030–1046. doi:10.1016/j.cor.2006.07.003
Johnson SM (1954) Optimal two- and three stage production schedules with set up times included. Nav Res Logistics Q 1:61–68. doi:10.1002/nav.3800010110
Kirkpatrick S, Gelatt CD Jr (1983) Optimization by simulated annealing. Science 220(4598):671–680. doi:10.1126/science.220.4598.671
Kurz ME, Askin RG (2003) Comparing scheduling rules for flexible flow lines. Int J Prod Econ 85:371–388. doi:10.1016/S0925-5273(03)00123-3
Kurz ME, Askin RG (2004) Scheduling flexible flow lines with sequence-dependent setup times. Eur J Oper Res 159:66–82. doi:10.1016/S0377-2217(03)00401-6
Lee CY (1997) Minimizing the makespan in the two-machine flow shop scheduling problem with an availability constraint. Oper Res Lett 20:129–139. doi:10.1016/S0167-6377(96)00041-7
Mitta IBS, Nagga PC (1973) Two machine sequencing problem with parallel machines. Oper Res 10:50–61
Monma CL, Potts CN (1989) On the complexity of scheduling with batch setup times. Oper Res 37:798–804
Montgomery DC (2000) Design and analysis of experiments, 5th edn. Wiley, London
Naderi B, Zandieh M, Fatemi Ghomi SMT (2008) Scheduling job shops with sequence dependent setup times. Int J Prod Res. doi:10.1080/00207540802165817
Pinedo M (1995) Scheduling theory, algorithms, and systems. Prentice-Hall, Englewood Cliffs
Vallada E, Ruiz R, Minella G (2008) Minimising total tardiness in the m-machine flowshop problem: a review and evaluation of heuristics and metaheuristics. Comput Oper Res 35(4):1350–1373. doi:10.1016/j.cor.2006.08.016
Ruiz R, García-Diaz CJ, Maroto C (2007) Considering scheduling and preventive maintenance in the flow shop sequencing problem. Comput Oper Res 34:3314–3330. doi:10.1016/j.cor.2005.12.007
Ruiz R, Maroto C, Alcaraz J (2005) Solving the flow shop scheduling problem with sequence dependent setup times using advanced meta-heuristics. Eur J Oper Res 165:34–54. doi:10.1016/j.ejor.2004.01.022
Ruiz R, Maroto C (2006) A genetic algorithm for hybrid flow shops with sequence dependent setup times and machine eligibility. Eur J Oper Res 169:781–800. doi:10.1016/j.ejor.2004.06.038
Ruiz R, Stützle T (2006) An iterated greedy heuristic for the sequence dependent setup times flow shop problem with makespan and weighted tardiness objectives. Eur J Oper Res 187:1143–1159. doi:10.1016/j.ejor.2006.07.029
Schmidt G (2000) Scheduling with limited machine availability. Eur J Oper Res 121:1–15. doi:10.1016/S0377-2217(98)00367-1
Schneider J, Morgensten I, Singer JM (1998) Bouncing towards the optimum: improving the results of Monte Carlo optimization algorithms. Phys Rev E Stat Phys Plasmas Fluids Relat Interdiscip Topics 58(4):5085–5095. doi:10.1103/PhysRevE.58.5085
Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278–285. doi:10.1016/0377-2217(93)90182-M
Viond V, Sridharan R (2006) Dynamic job-shop scheduling with sequence-dependent setup times: simulation modeling and analysis. Int J Adv Manuf Technol doi:10.1007/s00170-006-0836-4
Zandieh M, Fatemi Ghomi SMT, Moattar Husseini SM (2006) An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Appl Math Comput 180:111–127. doi:10.1016/j.amc.2005.11.136
Zhang CY, Li P, Rao Y, Guan Z (2008) A very fast TS/SA algorithm for the job shop scheduling problem. Comput Oper Res 35:282–294. doi:10.1016/j.cor.2006.02.024
Zhou Y, Beizhi Li, Yang J (2006) Study on job-shop scheduling with sequence-dependent setup times using biological immune algorithm. Int J Adv Manuf Technol 30:105–111. doi:10.1007/s00170-005-0022-0
Zhou C, Egbelu PG (1989) Scheduling in a manufacturing shop with sequence-dependent setups. Robot Comput Integr Manuf 5:73–81. doi:10.1016/0736-5845(89)90031-8
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Tavakkoli-Moghaddam, R., Khalili, M. & Naderi, B. A hybridization of simulated annealing and electromagnetic-like mechanism for job shop problems with machine availability and sequence-dependent setup times to minimize total weighted tardiness. Soft Comput 13, 995–1006 (2009). https://doi.org/10.1007/s00500-008-0367-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-008-0367-z