{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T04:04:02Z","timestamp":1787630642943,"version":"build-2736575974"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,6,13]],"date-time":"2017-06-13T00:00:00Z","timestamp":1497312000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10951-017-0530-4","type":"journal-article","created":{"date-parts":[[2017,6,13]],"date-time":"2017-06-13T15:53:28Z","timestamp":1497369208000},"page":"209-226","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":50,"title":["A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines"],"prefix":"10.1007","volume":"21","author":[{"given":"Yi","family":"Tan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lars","family":"M\u00f6nch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John W.","family":"Fowler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,6,13]]},"reference":[{"issue":"1","key":"530_CR1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.ijpe.2008.10.009","volume":"117","author":"MR Amin-Naseri","year":"2009","unstructured":"Amin-Naseri, M. R., & Beheshti-Nia, M. A. (2009). Hybrid flow shop scheduling with parallel batching. International Journal of Production Economics, 117(1), 185\u2013196.","journal-title":"International Journal of Production Economics"},{"issue":"6","key":"530_CR2","doi-asserted-by":"crossref","first-page":"1982","DOI":"10.1016\/j.cor.2008.06.011","volume":"36","author":"A Bellanger","year":"2009","unstructured":"Bellanger, A., & Oulamara, A. (2009). Scheduling hybrid flowshop with parallel batching machines and compatibilities. Computers & Operations Research, 36(6), 1982\u20131992.","journal-title":"Computers & Operations Research"},{"key":"530_CR3","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.cie.2014.10.008","volume":"78","author":"A Bilyk","year":"2014","unstructured":"Bilyk, A., M\u00f6nch, L., & Almeder, C. (2014). Scheduling jobs with ready time and precedence constraints on parallel batch machines using metaheuristics. Computers & Industrial Engineering, 78, 175\u2013185.","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"530_CR4","first-page":"165","volume":"42","author":"C-L Chen","year":"2008","unstructured":"Chen, C.-L., & Chen, C.-L. (2008). Bottleneck-based heuristic to minimize tardy jobs in a flexible flow line with unrelated parallel machines. International Journal of Production Research, 42(1), 165\u2013181.","journal-title":"International Journal of Production Research"},{"key":"530_CR5","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1016\/j.cie.2008.08.016","volume":"56","author":"C-L Chen","year":"2009","unstructured":"Chen, C.-L., & Chen, C.-L. (2009). bottleneck-based heuristic to minimize total tardiness for the flexible flow line with unrelated parallel machines. Computers & Industrial Engineering, 56, 1393\u20131401.","journal-title":"Computers & Industrial Engineering"},{"issue":"13","key":"530_CR6","doi-asserted-by":"crossref","first-page":"1465","DOI":"10.1016\/j.mcm.2005.01.005","volume":"40","author":"P Damodaran","year":"2004","unstructured":"Damodaran, P., & Srihari, K. (2004). Mixed integer formulation to minimize makespan in a flow shop with batch processing machines. Mathematical and Computer Modelling, 40(13), 1465\u20131472.","journal-title":"Mathematical and Computer Modelling"},{"key":"530_CR7","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1009627429878","volume":"3","author":"E Demirkol","year":"1997","unstructured":"Demirkol, E., Mehta, S., & Uzsoy, R. (1997). A computational study of shifting bottleneck procedures for shop scheduling problems. Journal of Heuristics, 3, 111\u2013137.","journal-title":"Journal of Heuristics"},{"key":"530_CR8","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1002\/(SICI)1099-1425(200005\/06)3:3<155::AID-JOS39>3.0.CO;2-E","volume":"3","author":"E Demirkol","year":"2000","unstructured":"Demirkol, E., & Uzsoy, R. (2000). Decomposition methods for reentrant flow shops with sequence-dependent setup times. Journal of Scheduling, 3, 155\u2013177.","journal-title":"Journal of Scheduling"},{"key":"530_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-5152-5","volume-title":"Flow shop scheduling: Theoretical results, algorithms, and applications","author":"H Emmons","year":"2013","unstructured":"Emmons, H., & Vairaktarakis, G. (2013). Flow shop scheduling: Theoretical results, algorithms, and applications. New York: Springer."},{"issue":"8","key":"530_CR10","doi-asserted-by":"crossref","first-page":"2267","DOI":"10.1080\/00207543.2011.565813","volume":"50","author":"Q Fu","year":"2012","unstructured":"Fu, Q., Sivakumar, A. I., & Li, K. (2012). Optimizing of flow-shop scheduling with batch processor and limited buffer. International Journal of Production Research, 50(8), 2267\u20132285.","journal-title":"International Journal of Production Research"},{"key":"530_CR11","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kann, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"530_CR12","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., & Mladenovic, N. (2001). Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130, 449\u2013467.","journal-title":"European Journal of Operational Research"},{"key":"530_CR13","doi-asserted-by":"crossref","first-page":"1873","DOI":"10.1016\/S0305-0548(01)00064-8","volume":"29","author":"AS Jain","year":"2002","unstructured":"Jain, A. S., & Meeran, S. (2002). A multi-level hybrid framework applied to the general flow shop scheduling problem. Computers & Operations Research, 29, 1873\u20131901.","journal-title":"Computers & Operations Research"},{"key":"530_CR14","doi-asserted-by":"crossref","unstructured":"Klemmt, A., & M\u00f6nch, L. (2012). Scheduling jobs with time constraints between consecutive process steps in semiconductor manufacturing. In Proceedings of the 2012 Winter Simulation Conference (pp. 2173\u20132182).","DOI":"10.1109\/WSC.2012.6465235"},{"issue":"2","key":"530_CR15","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0305-0548(97)00028-2","volume":"25","author":"C Koulamas","year":"1998","unstructured":"Koulamas, C. (1998). A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem. Computers & Operations Research, 25(2), 83\u201389.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"530_CR16","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1080\/00207540310001602892","volume":"42","author":"G-C Lee","year":"2004","unstructured":"Lee, G.-C., Kim, Y.-D., & Choi, S.-W. (2004). Bottleneck-focused scheduling for a hybrid flowshop. International Journal of Production Research, 42(1), 165\u2013181.","journal-title":"International Journal of Production Research"},{"issue":"2","key":"530_CR17","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1080\/00207540903536130","volume":"49","author":"D Lei","year":"2011","unstructured":"Lei, D., & Guo, X. (2011). Variable neighborhood search for minimizing tardiness objectives on flow shop with batch processing machines. International Journal of Production Research, 49(2), 519\u2013529.","journal-title":"International Journal of Production Research"},{"key":"530_CR18","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/j.amc.2010.05.089","volume":"217","author":"L-M Liao","year":"2010","unstructured":"Liao, L.-M., & Huang, C.-J. (2010). Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness. Applied Mathematics and Computation, 217, 557\u2013567.","journal-title":"Applied Mathematics and Computation"},{"key":"530_CR19","doi-asserted-by":"crossref","first-page":"1254","DOI":"10.1016\/j.mcm.2008.01.001","volume":"48","author":"L-M Liao","year":"2008","unstructured":"Liao, L.-M., & Liao, C.-J. (2008). Improved MILP models for two-machine flowshop with batch processing machines. Mathematical and Computer Modeling, 48, 1254\u20131264.","journal-title":"Mathematical and Computer Modeling"},{"issue":"5","key":"530_CR20","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1007\/s10845-014-0874-y","volume":"26","author":"D Li","year":"2015","unstructured":"Li, D., Meng, X., Liang, Q., & Zhao, J. (2015). A heuristic-search genetic algorithm for multi-stage hybrid flow shop scheduling with single processing machines and batch processing machines. Journal of Intelligent Manufacturing, 26(5), 873\u2013890.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"3","key":"530_CR21","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1016\/j.rcim.2008.05.003","volume":"25","author":"PK Manjeshwar","year":"2009","unstructured":"Manjeshwar, P. K., Damodaran, P., & Srihari, K. (2009). Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing. Robotics and Computer-Integrated Manufacturing, 25(3), 667\u2013679.","journal-title":"Robotics and Computer-Integrated Manufacturing"},{"key":"530_CR22","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1007\/s00170-005-2585-1","volume":"29","author":"M Mathirajan","year":"2006","unstructured":"Mathirajan, M., & Sivakumar, A. (2006). A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. International Journal of Advanced Manufacturing Technology, 29, 990\u20131001.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"2","key":"530_CR23","first-page":"165","volume":"30","author":"SV Mehta","year":"1998","unstructured":"Mehta, S. V., & Uzsoy, R. (1998). Minimizing total tardiness on a batch processing machine with incompatible job families. IIE Transactions, 30(2), 165\u2013178.","journal-title":"IIE Transactions"},{"issue":"11","key":"530_CR24","doi-asserted-by":"crossref","first-page":"2731","DOI":"10.1016\/j.cor.2004.04.001","volume":"32","author":"L M\u00f6nch","year":"2005","unstructured":"M\u00f6nch, L., Balasubramanian, H., Fowler, J., & Pfund, M. (2005). Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Computers & Operations Research, 32(11), 2731\u20132750.","journal-title":"Computers & Operations Research"},{"issue":"6","key":"530_CR25","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s10951-010-0222-9","volume":"14","author":"L M\u00f6nch","year":"2011","unstructured":"M\u00f6nch, L., Fowler, J. W., Dauz\u00e8re-P\u00e9r\u00e8s, S., Mason, S. J., & Rose, O. (2011). A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations. Journal of Scheduling, 14(6), 583\u2013595.","journal-title":"Journal of Scheduling"},{"key":"530_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-4472-5","volume-title":"Production planning and control for wafer fabrication facilities: Modeling, analysis, and systems","author":"L M\u00f6nch","year":"2013","unstructured":"M\u00f6nch, L., Fowler, J. W., & Mason, S. J. (2013). Production planning and control for wafer fabrication facilities: Modeling, analysis, and systems. New York: Springer."},{"issue":"3","key":"530_CR27","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/j.engappai.2005.10.001","volume":"19","author":"L M\u00f6nch","year":"2006","unstructured":"M\u00f6nch, L., Zimmermann, J., & Otto, P. (2006). Machine learning techniques for scheduling jobs with incompatible families and unequal ready times on parallel batch machines. Journal of Engineering Applications of Artificial Intelligence, 19(3), 235\u2013245.","journal-title":"Journal of Engineering Applications of Artificial Intelligence"},{"key":"530_CR28","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1016\/j.ejor.2004.10.028","volume":"169","author":"S Mukherjee","year":"2006","unstructured":"Mukherjee, S., & Chatterjee, A. K. (2006). Applying machine-based decomposition in 2-machine flow shops. European Journal of Operational Research, 169, 723\u2013741.","journal-title":"European Journal of Operational Research"},{"key":"530_CR29","volume-title":"Optimization and its applications","author":"A Oulamara","year":"2012","unstructured":"Oulamara, A. (2012). No-wait scheduling problems with batching machines. Just-in-time systems. In R. Rios & Y. A. R\u00edos-Sol\u00eds (Eds.), Optimization and its applications. Berlin: Springer."},{"issue":"7","key":"530_CR30","doi-asserted-by":"crossref","first-page":"1849","DOI":"10.1080\/00207549508904785","volume":"33","author":"J Robinson","year":"1995","unstructured":"Robinson, J., Fowler, J. W., & Bard, J. F. (1995). The use of upstream and downstream information in scheduling semiconductor batch operations. International Journal of Production Research, 33(7), 1849\u20131869.","journal-title":"International Journal of Production Research"},{"issue":"1","key":"530_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"R Ruiz","year":"2010","unstructured":"Ruiz, R., & V\u00e1zquez-Rodr\u00edguez, J. A. (2010). The hybrid flow shop scheduling problem. European Journal of Operational Research, 205(1), 1\u201318.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"530_CR32","first-page":"92","volume":"29","author":"K Shahnaghi","year":"2016","unstructured":"Shahnaghi, K., Shahmoradi-Moghadam, H., Noroozi, A., & Mokhtari, H. (2016). A robust modelling and optimisation framework for a batch processing flow shop production system in the presence of uncertainties. International Journal of Computer Integrated Manufacturing, 29(1), 92\u2013106.","journal-title":"International Journal of Computer Integrated Manufacturing"},{"issue":"1","key":"530_CR33","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s10479-013-1339-y","volume":"206","author":"L Shen","year":"2013","unstructured":"Shen, L., M\u00f6nch, L., & Buscher, U. (2013). An iterative approach for the serial batching problem with parallel machines and job families. Annals of Operations Research, 206(1), 425\u2013448.","journal-title":"Annals of Operations Research"},{"issue":"5","key":"530_CR34","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10951-013-0315-3","volume":"17","author":"L Shen","year":"2014","unstructured":"Shen, L., M\u00f6nch, L., & Buscher, U. (2014). Simultaneous and iterative approach for parallel machine scheduling with sequence dependent family setups. Journal of Scheduling, 17(5), 471\u2013487.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"530_CR35","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/S0360-8352(02)00216-4","volume":"44","author":"LH Su","year":"2003","unstructured":"Su, L. H. (2003). A hybrid two-stage flow shop with limited waiting time constraints. Computers & Industrial Engineering, 44(3), 409\u2013424.","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"530_CR36","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/S0305-0548(00)00071-X","volume":"29","author":"CS Sung","year":"2002","unstructured":"Sung, C. S., & Kim, Y. H. (2002). Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed. Computers & Operations Research, 29(3), 275\u2013294.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"530_CR37","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1016\/S0377-2217(02)00352-1","volume":"147","author":"CS Sung","year":"2003","unstructured":"Sung, C. S., & Kim, Y. H. (2003). Minimizing due date related performance measures on two batch processing machines. European Journal of Operational Research, 147(3), 644\u2013656.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"530_CR38","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0377-2217(99)00031-4","volume":"121","author":"CS Sung","year":"2000","unstructured":"Sung, C. S., Kim, Y. H., & Yoon, S. H. (2000). A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines. European Journal of Operational Research, 121(1), 179\u2013192.","journal-title":"European Journal of Operational Research"},{"key":"530_CR39","doi-asserted-by":"crossref","unstructured":"Tan, Y., M\u00f6nch, L., & Fowler, J. W. (2014). A decomposition heuristic for a two-machine flow shop with batch processing. In Proceedings of the 2014 Winter Simulation Conference (pp. 2490\u20132501).","DOI":"10.1109\/WSC.2014.7020092"},{"key":"530_CR40","unstructured":"Tan, Y., M\u00f6nch, L., & Fowler, J. W. (2015). Scheduling jobs in a two-stage flexible flow shop with batch processing machines. In Proceedings MISTA (pp.\u00a0801\u2013804)."},{"issue":"4","key":"530_CR41","first-page":"47","volume":"24","author":"R Uzsoy","year":"1992","unstructured":"Uzsoy, R., Lee, C. Y., & Martin-Vega, L. A. (1992). A review of production planning and scheduling models in the semiconductor industry part I: System characteristics, performance evaluation and production planning. IIE Transactions on Scheduling and Logistics, 24(4), 47\u201361.","journal-title":"IIE Transactions on Scheduling and Logistics"},{"issue":"8","key":"530_CR42","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1287\/mnsc.33.8.1035","volume":"33","author":"APJ Vepsalainen","year":"1987","unstructured":"Vepsalainen, A. P. J., & Morton, T. E. (1987). Priority rules for job shops with weighted tardiness cost. Management Science, 33(8), 1035\u20131047.","journal-title":"Management Science"},{"key":"530_CR43","first-page":"102","volume":"1","author":"AJP Vepsalainen","year":"1988","unstructured":"Vepsalainen, A. J. P., & Morton, T. E. (1988). Improving local priority rules with global lead-time estimates: A simulation study. Journal of Manufacturing and Operations Management, 1, 102\u2013118.","journal-title":"Journal of Manufacturing and Operations Management"},{"key":"530_CR44","doi-asserted-by":"crossref","first-page":"2271","DOI":"10.1007\/s10845-011-0571-z","volume":"23","author":"I-L Wang","year":"2012","unstructured":"Wang, I.-L., Yang, T., & Chang, Y.-B. (2012). Scheduling two-stage hybrid flow shops with parallel batch, release time, and machine eligibility constraints. Journal of Intelligent Manufacturing, 23, 2271\u20132280.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"530_CR45","doi-asserted-by":"crossref","unstructured":"Yang, Y., Kreipl, S., & Pinedo, M. (2000). Heuristics for minimizing total weighted tardiness in flexible job shops. Journal of Scheduling, 3, 89\u2013108.","DOI":"10.1002\/(SICI)1099-1425(200003\/04)3:2<89::AID-JOS36>3.0.CO;2-N"},{"issue":"8","key":"530_CR46","doi-asserted-by":"crossref","first-page":"2118","DOI":"10.1080\/00207543.2011.575090","volume":"50","author":"C Yugma","year":"2012","unstructured":"Yugma, C., Dauz\u00e8re-P\u00e9r\u00e8s, S., Artigues, C., Derreumaux, A., & Sibille, O. (2012). A batching and scheduling algorithm for the diffusion area in semiconductor manufacturing. International Journal of Production Research, 50(8), 2118\u20132132.","journal-title":"International Journal of Production Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-017-0530-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0530-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0530-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,6]],"date-time":"2018-03-06T15:30:10Z","timestamp":1520350210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-017-0530-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,13]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["530"],"URL":"https:\/\/doi.org\/10.1007\/s10951-017-0530-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,13]]}}}