{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T09:55:18Z","timestamp":1760608518399},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2008,9,2]],"date-time":"2008-09-02T00:00:00Z","timestamp":1220313600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s00500-008-0367-z","type":"journal-article","created":{"date-parts":[[2008,9,1]],"date-time":"2008-09-01T14:49:59Z","timestamp":1220280599000},"page":"995-1006","source":"Crossref","is-referenced-by-count":39,"title":["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"],"prefix":"10.1007","volume":"13","author":[{"given":"R.","family":"Tavakkoli-Moghaddam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Khalili","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Naderi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,9,2]]},"reference":[{"key":"367_CR1","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"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\u20131032. doi: 10.1016\/j.ejor.2006.06.060","journal-title":"Eur J Oper Res"},{"key":"367_CR2","volume-title":"Introduction to sequencing and scheduling","author":"KR Baker","year":"1974","unstructured":"Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York"},{"key":"367_CR3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1023\/A:1022452626305","volume":"25","author":"I B\u00efrb\u00efl","year":"2003","unstructured":"B\u00efrb\u00efl I, Fang SC (2003) An electromagnetism-like mechanism for global optimization. J Glob Optim 25:263\u2013282. doi: 10.1023\/A:1022452626305","journal-title":"J Glob Optim"},{"key":"367_CR4","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/S0305-0483(01)00048-2","volume":"29","author":"J Blazewicz","year":"2001","unstructured":"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\u2013608. doi: 10.1016\/S0305-0483(01)00048-2","journal-title":"Omega J"},{"key":"367_CR5","doi-asserted-by":"crossref","first-page":"2143","DOI":"10.1016\/j.cor.2005.01.004","volume":"33","author":"J Breit","year":"2006","unstructured":"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\u20132153. doi: 10.1016\/j.cor.2005.01.004","journal-title":"Comput Oper Res"},{"key":"367_CR6","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01539706","volume":"18","author":"P Brucker","year":"1996","unstructured":"Brucker P, Thiele O (1996) A branch-and-bound method for general shop problem with sequence-dependent setup times. OR Spectr 18:145\u2013161. doi: 10.1007\/BF01539706","journal-title":"OR Spectr"},{"key":"367_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V Cerny","year":"1985","unstructured":"Cerny V (1985) Thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. JOTA 45:41\u201351. doi: 10.1007\/BF00940812","journal-title":"JOTA"},{"key":"367_CR8","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1023\/A:1014990729837","volume":"107","author":"W Cheung","year":"2001","unstructured":"Cheung W, Zhou H (2001) Using genetic algorithms and heuristics for job-shop scheduling with sequence-dependent setup times. Ann Oper Res 107:65\u201381. doi: 10.1023\/A:1014990729837","journal-title":"Ann Oper Res"},{"key":"367_CR9","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1023\/A:1018918003761","volume":"70","author":"I Choi","year":"1997","unstructured":"Choi I, Korkmaz O (1997) Job-shop scheduling with separable sequence-dependent setups. Ann Oper Res 70:155\u2013170. doi: 10.1023\/A:1018918003761","journal-title":"Ann Oper Res"},{"key":"367_CR10","first-page":"225","volume":"1","author":"BJ Coleman","year":"1992","unstructured":"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\u2013228","journal-title":"Management"},{"key":"367_CR11","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1016\/j.ejor.2004.08.020","volume":"169","author":"D Debels","year":"2006","unstructured":"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\u2013653. doi: 10.1016\/j.ejor.2004.08.020","journal-title":"Eur J Oper Res"},{"key":"367_CR12","unstructured":"Dileep Sule R (1996) Industrial scheduling. PWS, USA"},{"key":"367_CR13","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1016\/j.amc.2006.09.023","volume":"187","author":"J Heinonen","year":"2007","unstructured":"Heinonen J, Pettersson F (2007) Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem. Appl Math Comput 187:989\u2013998. doi: 10.1016\/j.amc.2006.09.023","journal-title":"Appl Math Comput"},{"issue":"9","key":"367_CR14","doi-asserted-by":"crossref","first-page":"1264","DOI":"10.1287\/mnsc.20.9.1264","volume":"20","author":"C Holloway","year":"1974","unstructured":"Holloway C, Nelson R (1974) Job-shop scheduling with due dates and variable processing times. Manage Sci 20(9):1264\u20131275","journal-title":"Manage Sci"},{"key":"367_CR15","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1016\/j.cor.2006.07.003","volume":"35","author":"KL Huang","year":"2006","unstructured":"Huang KL, Liao CJ (2006) Ant colony optimization combined with tabu search for the job shop scheduling problem. Comput Oper Res 35:1030\u20131046. doi: 10.1016\/j.cor.2006.07.003","journal-title":"Comput Oper Res"},{"key":"367_CR16","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM (1954) Optimal two- and three stage production schedules with set up times included. Nav Res Logistics Q 1:61\u201368. doi: 10.1002\/nav.3800010110","journal-title":"Nav Res Logistics Q"},{"issue":"4598","key":"367_CR17","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD Jr (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680. doi: 10.1126\/science.220.4598.671","journal-title":"Science"},{"key":"367_CR18","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0925-5273(03)00123-3","volume":"85","author":"ME Kurz","year":"2003","unstructured":"Kurz ME, Askin RG (2003) Comparing scheduling rules for flexible flow lines. Int J Prod Econ 85:371\u2013388. doi: 10.1016\/S0925-5273(03)00123-3","journal-title":"Int J Prod Econ"},{"key":"367_CR19","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/S0377-2217(03)00401-6","volume":"159","author":"ME Kurz","year":"2004","unstructured":"Kurz ME, Askin RG (2004) Scheduling flexible flow lines with sequence-dependent setup times. Eur J Oper Res 159:66\u201382. doi: 10.1016\/S0377-2217(03)00401-6","journal-title":"Eur J Oper Res"},{"key":"367_CR24","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0167-6377(96)00041-7","volume":"20","author":"CY Lee","year":"1997","unstructured":"Lee CY (1997) Minimizing the makespan in the two-machine flow shop scheduling problem with an availability constraint. Oper Res Lett 20:129\u2013139. doi: 10.1016\/S0167-6377(96)00041-7","journal-title":"Oper Res Lett"},{"key":"367_CR20","first-page":"50","volume":"10","author":"IBS Mitta","year":"1973","unstructured":"Mitta IBS, Nagga PC (1973) Two machine sequencing problem with parallel machines. Oper Res 10:50\u201361","journal-title":"Oper Res"},{"key":"367_CR21","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1287\/opre.37.5.798","volume":"37","author":"CL Monma","year":"1989","unstructured":"Monma CL, Potts CN (1989) On the complexity of scheduling with batch setup times. Oper Res 37:798\u2013804","journal-title":"Oper Res"},{"key":"367_CR22","unstructured":"Montgomery DC (2000) Design and analysis of experiments, 5th edn. Wiley, London"},{"key":"367_CR23","doi-asserted-by":"crossref","unstructured":"Naderi B, Zandieh M, Fatemi Ghomi SMT (2008) Scheduling job shops with sequence dependent setup times. Int J Prod Res. doi: 10.1080\/00207540802165817","DOI":"10.1080\/00207540802165817"},{"key":"367_CR25","unstructured":"Pinedo M (1995) Scheduling theory, algorithms, and systems. Prentice-Hall, Englewood Cliffs"},{"issue":"4","key":"367_CR26","doi-asserted-by":"crossref","first-page":"1350","DOI":"10.1016\/j.cor.2006.08.016","volume":"35","author":"E Vallada","year":"2008","unstructured":"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\u20131373. doi: 10.1016\/j.cor.2006.08.016","journal-title":"Comput Oper Res"},{"key":"367_CR27","doi-asserted-by":"crossref","first-page":"3314","DOI":"10.1016\/j.cor.2005.12.007","volume":"34","author":"R Ruiz","year":"2007","unstructured":"Ruiz R, Garc\u00eda-Diaz CJ, Maroto C (2007) Considering scheduling and preventive maintenance in the flow shop sequencing problem. Comput Oper Res 34:3314\u20133330. doi: 10.1016\/j.cor.2005.12.007","journal-title":"Comput Oper Res"},{"key":"367_CR28","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.ejor.2004.01.022","volume":"165","author":"R Ruiz","year":"2005","unstructured":"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\u201354. doi: 10.1016\/j.ejor.2004.01.022","journal-title":"Eur J Oper Res"},{"key":"367_CR29","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1016\/j.ejor.2004.06.038","volume":"169","author":"R Ruiz","year":"2006","unstructured":"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\u2013800. doi: 10.1016\/j.ejor.2004.06.038","journal-title":"Eur J Oper Res"},{"key":"367_CR30","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1016\/j.ejor.2006.07.029","volume":"187","author":"R Ruiz","year":"2006","unstructured":"Ruiz R, St\u00fctzle 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\u20131159. doi: 10.1016\/j.ejor.2006.07.029","journal-title":"Eur J Oper Res"},{"key":"367_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(98)00367-1","volume":"121","author":"G Schmidt","year":"2000","unstructured":"Schmidt G (2000) Scheduling with limited machine availability. Eur J Oper Res 121:1\u201315. doi: 10.1016\/S0377-2217(98)00367-1","journal-title":"Eur J Oper Res"},{"issue":"4","key":"367_CR32","first-page":"5085","volume":"58","author":"J Schneider","year":"1998","unstructured":"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\u20135095. doi: 10.1103\/PhysRevE.58.5085","journal-title":"Phys Rev E Stat Phys Plasmas Fluids Relat Interdiscip Topics"},{"issue":"2","key":"367_CR33","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278\u2013285. doi: 10.1016\/0377-2217(93)90182-M","journal-title":"Eur J Oper Res"},{"key":"367_CR34","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1007\/s00170-006-0836-4"},{"key":"367_CR35","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.amc.2005.11.136","volume":"180","author":"M Zandieh","year":"2006","unstructured":"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\u2013127. doi: 10.1016\/j.amc.2005.11.136","journal-title":"Appl Math Comput"},{"key":"367_CR36","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/j.cor.2006.02.024","volume":"35","author":"CY Zhang","year":"2008","unstructured":"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\u2013294. doi: 10.1016\/j.cor.2006.02.024","journal-title":"Comput Oper Res"},{"key":"367_CR37","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s00170-005-0022-0","volume":"30","author":"Y Zhou","year":"2006","unstructured":"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\u2013111. doi: 10.1007\/s00170-005-0022-0","journal-title":"Int J Adv Manuf Technol"},{"key":"367_CR38","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0736-5845(89)90031-8","volume":"5","author":"C Zhou","year":"1989","unstructured":"Zhou C, Egbelu PG (1989) Scheduling in a manufacturing shop with sequence-dependent setups. Robot Comput Integr Manuf 5:73\u201381. doi: 10.1016\/0736-5845(89)90031-8","journal-title":"Robot Comput Integr Manuf"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-008-0367-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-008-0367-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-008-0367-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T15:38:35Z","timestamp":1709221115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-008-0367-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,2]]},"references-count":38,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["367"],"URL":"https:\/\/doi.org\/10.1007\/s00500-008-0367-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9,2]]}}}