{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T22:07:40Z","timestamp":1768774060025,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,11,3]],"date-time":"2006-11-03T00:00:00Z","timestamp":1162512000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,11,3]],"date-time":"2006-11-03T00:00:00Z","timestamp":1162512000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2007,7]]},"DOI":"10.1007\/s00291-006-0062-3","type":"journal-article","created":{"date-parts":[[2006,11,2]],"date-time":"2006-11-02T23:23:23Z","timestamp":1162509803000},"page":"391-419","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":70,"title":["A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups"],"prefix":"10.1007","volume":"29","author":[{"given":"Chen-Fu","family":"Chien","sequence":"first","affiliation":[]},{"given":"Chien-Hung","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,11,3]]},"reference":[{"issue":"6","key":"62_CR1","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/S0305-0548(99)00136-7","volume":"28","author":"T Aldowaisan","year":"2001","unstructured":"Aldowaisan T (2001) A new heuristic and dominance relations for no-wait flowshops with setups. Comput Oper Res 28(6):563\u2013584","journal-title":"Comput Oper Res"},{"issue":"9","key":"62_CR2","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/S0305-0548(98)00002-1","volume":"25","author":"T Aldowaisan","year":"1998","unstructured":"Aldowaisan T, Allahverdi A (1998) Total flowtime in no-wait flowshops with separated setup times. Comput Oper Res 25(9):757\u2013765","journal-title":"Comput Oper Res"},{"issue":"3","key":"62_CR3","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1111\/j.1475-3995.2000.tb00197.x","volume":"7","author":"A Allahverdi","year":"2000","unstructured":"Allahverdi A, Aldowaisan T (2000) No-wait and separate setup three-machine flowshop with total completion time criterion. Int Trans Oper Res 7(3):245\u2013264","journal-title":"Int Trans Oper Res"},{"key":"62_CR4","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1057\/palgrave.jors.2601110","volume":"52","author":"A Allahverdi","year":"2001","unstructured":"Allahverdi A, Aldowaisan T (2001) Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times. J Oper Res Soc 52:449\u2013462","journal-title":"J Oper Res Soc"},{"issue":"2","key":"62_CR5","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean JC (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6(2):154\u2013160","journal-title":"ORSA J Comput"},{"key":"62_CR6","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/3-540-61723-X_995","volume":"IV","author":"C Bierwirth","year":"1996","unstructured":"Bierwirth C, Mattfeld DC, Kopfer H (1996) On permutation representations for scheduling problems. Parallel Problem Solving from Nature-PPSN IV:310\u2013318","journal-title":"Parallel Problem Solving from Nature-PPSN"},{"key":"62_CR7","first-page":"2349","volume":"4","author":"CA Brizuela","year":"2001","unstructured":"Brizuela CA, Zhao Y, Sannomiya N (2001) No-wait and blocking job-shops: challenging problems for GA\u2019s. Proceedings of 2001 IEEE International Conference on Systems, Man, and Cybernetics 4:2349\u20132354","journal-title":"Proceedings of 2001 IEEE International Conference on Systems, Man, and Cybernetics"},{"issue":"1","key":"62_CR8","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/70.917083","volume":"17","author":"F Chauvet","year":"2001","unstructured":"Chauvet F, Proth JM, Wardi Y (2001) Scheduling no-wait production with time windows and flexible processing times. IEEE Trans Robot Autom 17(1):60\u201369","journal-title":"IEEE Trans Robot Autom"},{"key":"62_CR9","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","volume":"47","author":"TCE Cheng","year":"1990","unstructured":"Cheng TCE, Sin CCS (1990) A state-of-the-art review of parallel-machine scheduling research. Eur J Oper Res 47:271\u2013292","journal-title":"Eur J Oper Res"},{"issue":"4","key":"62_CR10","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1016\/0360-8352(96)00047-2","volume":"30","author":"R Cheng","year":"1996","unstructured":"Cheng R, Gen M, Tsujimura Y (1996) A tutorial survey of job-shop scheduling problems using genetic algorithms\u2014I. Representation. Computers and Industrial Engineering 30(4):983\u2013997","journal-title":"Computers and Industrial Engineering"},{"key":"62_CR11","unstructured":"Chien C, Chen C (2006) Using GA and CTPN for modeling the optimization-based schedule generator of a generic production scheduling system. Int J Prod Res 1\u201327"},{"key":"62_CR12","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10845-005-0016-7","volume":"17","author":"C Chien","year":"2006","unstructured":"Chien C, Hsu C (2006) A novel method for determining machine subgroups and backups with an empirical study for semiconductor manufacturing. J Intell Manuf 17:429\u2013440","journal-title":"J Intell Manuf"},{"key":"62_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00207540500151507","volume":"44","author":"C Chien","year":"2006","unstructured":"Chien C, Chen H, Wu J, Hu C (2006) Construct a Group OEE for promoting tool group productivity in semiconductor manufacturing. Int J Prod Res 44:1\u201316","journal-title":"Int J Prod Res"},{"key":"62_CR14","volume-title":"Genetic algorithms and engineering design","author":"M Gen","year":"1997","unstructured":"Gen M, Cheng R (1997) Genetic algorithms and engineering design. Wiley, New York"},{"issue":"4","key":"62_CR15","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.8.4.487","volume":"8","author":"B Giffler","year":"1960","unstructured":"Giffler B, Thompson G (1960) Algorithms for solving production scheduling problems. Oper Res 8(4):487\u2013503","journal-title":"Oper Res"},{"issue":"11","key":"62_CR16","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1016\/S0305-0548(97)00018-X","volume":"24","author":"JND Gupta","year":"1997","unstructured":"Gupta JND, Strusevich VA, Zwaneveld CM (1997) Two-stage no-wait scheduling models with setup and removal times separated. Comput Oper Res 24(11):1025\u20131031","journal-title":"Comput Oper Res"},{"issue":"3","key":"62_CR17","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"NG Hall","year":"1996","unstructured":"Hall NG, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper Res 44(3):510\u2013525","journal-title":"Oper Res"},{"issue":"2","key":"62_CR18","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1109\/66.492810","volume":"9","author":"RC Leachman","year":"1996","unstructured":"Leachman RC, Hodges DA (1996) Benchmarking semiconductor manufacturing. IEEE Trans Semicond Manuf 9(2):158\u2013169","journal-title":"IEEE Trans Semicond Manuf"},{"issue":"7","key":"62_CR19","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1016\/S0305-0548(99)00138-0","volume":"28","author":"MT Lin Bertrand","year":"2001","unstructured":"Lin Bertrand MT, TC Edwin Cheng (2001) Batch scheduling in the no-wait two-machine flowshop to minimize the makespan. Comput Oper Res 28(7):613\u2013624","journal-title":"Comput Oper Res"},{"issue":"3","key":"62_CR20","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1109\/66.705376","volume":"11","author":"SY Lin","year":"1998","unstructured":"Lin SY, Huang HP (1998) Modeling and emulation of a furnace in IC fab based on colored-timed Petri net. IEEE Transact Semicond Manuf 11(3):410\u2013420","journal-title":"IEEE Transact Semicond Manuf"},{"issue":"11","key":"62_CR21","doi-asserted-by":"publisher","first-page":"2585","DOI":"10.1080\/002075499190671","volume":"37","author":"R Macchiaroli","year":"1999","unstructured":"Macchiaroli R, Mole S, Riemma S (1999) Modeling and optimization of industrial manufacturing processes subject to no-wait constraints. Int J Prod Res 37(11):2585\u20132607","journal-title":"Int J Prod Res"},{"key":"62_CR22","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0377-2217(01)00338-1","volume":"143","author":"A Mascis","year":"2002","unstructured":"Mascis A, Pacciarelli D (2002) Job-shop scheduling with blocking and no-wait constraints. Eur J Oper Res 143:498\u2013517","journal-title":"Eur J Oper Res"},{"issue":"9","key":"62_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0895-7177(96)00150-1","volume":"24","author":"N Piersma","year":"1996","unstructured":"Piersma N, Dijk WV (1996) A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search. Math Comput Model 24(9):1\u201319","journal-title":"Math Comput Model"},{"issue":"2","key":"62_CR24","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"CN Potts","year":"2000","unstructured":"Potts CN, Kovalyov MY (2000) Scheduling with batching: a review. Eur J Oper Res 120(2):228\u2013249","journal-title":"Eur J Oper Res"},{"issue":"3","key":"62_CR25","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/S0377-2217(03)00264-9","volume":"153","author":"M Pranzo","year":"2004","unstructured":"Pranzo M (2004) Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times. Eur J Oper Res 153(3):581\u2013592","journal-title":"Eur J Oper Res"},{"key":"62_CR26","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0377-2217(99)00285-4","volume":"126","author":"WHM Raaymakers","year":"2000","unstructured":"Raaymakers WHM, Hoogeveen JA (2000) Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. Eur J Oper Res 126:131\u2013151","journal-title":"Eur J Oper Res"},{"key":"62_CR27","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"C Reeves","year":"1995","unstructured":"Reeves C (1995) A genetic algorithm for flow shop sequencing. Comput Oper Res 22:5\u201313","journal-title":"Comput Oper Res"},{"key":"62_CR28","doi-asserted-by":"publisher","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","journal-title":"Eur J Oper Res"},{"key":"62_CR29","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/S0167-6377(03)00005-1","volume":"31","author":"CJ Schuster","year":"2003","unstructured":"Schuster CJ, Framinan JM (2003) Approximative procedures for no-wait job shop scheduling. Oper Res Lett 31:308\u2013318","journal-title":"Oper Res Lett"},{"issue":"4","key":"62_CR30","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0167-6377(00)00019-5","volume":"26","author":"JB Sidney","year":"2000","unstructured":"Sidney JB, Potts CN, Sriskandarajah C (2000) A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups. Oper Res Lett 26(4):165\u2013173","journal-title":"Oper Res Lett"},{"issue":"4","key":"62_CR31","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1080\/07408179208964233","volume":"24","author":"R Uzsoy","year":"1992","unstructured":"Uzsoy R, Lee CY, Martin-Vega LA (1992) A review of production planning and scheduling models in the semiconductor industry: Part I. IIE Trans 24(4):47\u201360","journal-title":"IIE Trans"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-006-0062-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-006-0062-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-006-0062-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-006-0062-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T21:35:03Z","timestamp":1652823303000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-006-0062-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,3]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,7]]}},"alternative-id":["62"],"URL":"https:\/\/doi.org\/10.1007\/s00291-006-0062-3","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,3]]},"assertion":[{"value":"3 November 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}