{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T22:12:29Z","timestamp":1759529549259,"version":"3.37.3"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T00:00:00Z","timestamp":1577923200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T00:00:00Z","timestamp":1577923200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["2016R1A2B4012177"],"award-info":[{"award-number":["2016R1A2B4012177"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s10845-019-01524-6","type":"journal-article","created":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T12:34:21Z","timestamp":1577968461000},"page":"1483-1496","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Production scheduling problem in a factory of automobile component primer painting"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9414-2549","authenticated-orcid":false,"given":"Ivan Kristianto","family":"Singgih","sequence":"first","affiliation":[]},{"given":"Onyu","family":"Yu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4526-2509","authenticated-orcid":false,"given":"Byung-In","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Jeongin","family":"Koo","sequence":"additional","affiliation":[]},{"given":"Seungdoe","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,2]]},"reference":[{"issue":"2","key":"1524_CR1","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1504\/IJOR.2014.058954","volume":"19","author":"G Ahani","year":"2014","unstructured":"Ahani, G., & Asyabani, M. (2014). A tabu search algorithm for no-wait job shop scheduling problem. International Journal of Operational Research,19(2), 246\u2013258.","journal-title":"International Journal of Operational Research"},{"key":"1524_CR2","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1007\/s00170-016-9093-3","volume":"89","author":"H Ahonen","year":"2017","unstructured":"Ahonen, H., & de Alvarenga, A. G. (2017). Scheduling flexible flow shop with recirculation and machine sequence-dependent processing times: Formulation and solution procedures. The International Journal of Advanced Manufacturing Technology,89, 765\u2013777.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"1524_CR3","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1016\/j.ejor.2016.05.036","volume":"255","author":"A Allahverdi","year":"2016","unstructured":"Allahverdi, A. (2016). A survey of scheduling problems with no-wait in process. European Journal of Operations Research,255, 665\u2013686.","journal-title":"European Journal of Operations Research"},{"key":"1524_CR4","doi-asserted-by":"crossref","first-page":"2237","DOI":"10.1007\/s00170-013-4836-x","volume":"68","author":"A Allahverdi","year":"2013","unstructured":"Allahverdi, A., & Aydilek, H. (2013). Algorithms for no-wait flowshops with total completion time subject to makespan. The International Journal of Advanced Manufacturing Technology,68, 2237\u20132251.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"1524_CR5","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1016\/j.ejor.2014.04.031","volume":"238","author":"A Allahverdi","year":"2014","unstructured":"Allahverdi, A., & Aydilek, H. (2014). Total completion time with makespan constraint in no-wait flowshops with setup times. European Journal of Operations Research,238, 724\u2013734.","journal-title":"European Journal of Operations Research"},{"issue":"4","key":"1524_CR6","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1016\/j.cie.2012.12.023","volume":"64","author":"S Arabameri","year":"2013","unstructured":"Arabameri, S., & Salmasi, N. (2013). Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem. Computers & Industrial Engineering,64(4), 902\u2013916.","journal-title":"Computers & Industrial Engineering"},{"key":"1524_CR7","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/j.jmsy.2017.12.005","volume":"46","author":"A Baykaso\u011flu","year":"2018","unstructured":"Baykaso\u011flu, A., & Ozsoydan, F. B. (2018). Dynamic scheduling of parallel heat treatment furnaces: a case study at a manufacturing system. Journal of Manufacturing Systems,46, 152\u2013162.","journal-title":"Journal of Manufacturing Systems"},{"issue":"1","key":"1524_CR8","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s10845-014-0890-y","volume":"27","author":"J Behnamian","year":"2016","unstructured":"Behnamian, J., & Fatemi Ghomi, S. M. T. (2016). A survey of multi-factory scheduling. Journal of Intelligent Manufacturing,27(1), 231\u2013249.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"1524_CR9","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1016\/j.apm.2011.07.011","volume":"36","author":"J Behnamian","year":"2012","unstructured":"Behnamian, J., Fatemi Ghomi, S. M. T., Jolai, F., & Amirtaheri, O. (2012). Realistic two-stage flowshop batch scheduling problems with transportation capacity and times. Applied Mathematical Modelling,36, 723\u2013735.","journal-title":"Applied Mathematical Modelling"},{"key":"1524_CR10","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.cor.2018.10.010","volume":"103","author":"G Bektur","year":"2019","unstructured":"Bektur, G., & Sara\u00e7, T. (2019). A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server. Computers & Operations Research,103, 46\u201363.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"1524_CR11","doi-asserted-by":"crossref","first-page":"1502","DOI":"10.1016\/j.cie.2008.09.023","volume":"56","author":"W Bo\u017cejko","year":"2009","unstructured":"Bo\u017cejko, W., & Makuchowski, M. (2009). A fast hybrid tabu search algorithm for the no-wait job shop problem. Computers & Industrial Engineering,56(4), 1502\u20131509.","journal-title":"Computers & Industrial Engineering"},{"key":"1524_CR12","first-page":"46","volume-title":"Approximation algorithms for NP-hard problems","author":"EG Coffman","year":"1997","unstructured":"Coffman, E. G., Garey, M. R., & Johnson, D. S. (1997). Approximation algorithms for bin-packing: a survey. In D. S. Hochbaum (Ed.), Approximation algorithms for NP-hard problems (pp. 46\u201393). Boston: PWS Publishing Company."},{"key":"1524_CR13","doi-asserted-by":"crossref","first-page":"103122","DOI":"10.1016\/j.compind.2019.08.003","volume":"112","author":"P Dallasega","year":"2019","unstructured":"Dallasega, P., Rojas, R. A., Bruno, G., & Rauch, E. (2019). An agile scheduling and control approach in ETO construction supply chains. Computers in Industry,112, 103122.","journal-title":"Computers in Industry"},{"key":"1524_CR14","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1007\/s00170-012-4037-z","volume":"64","author":"P Damodaran","year":"2013","unstructured":"Damodaran, P., Rao, A. G., & Mestry, S. (2013). Particle swarm optimization for scheduling batch processing machines in a permutation flowshop. The International Journal of Advanced Manufacturing Technology,64, 989\u20131000.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"1524_CR15","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1016\/j.asoc.2015.02.006","volume":"30","author":"J-Y Ding","year":"2015","unstructured":"Ding, J.-Y., Song, S., Gupta, J. N. D., Zhang, R., Chiong, R., & Wu, C. (2015). An improved iterated greedy algorithm with a tabu-based reconstruction strategy for the no-wait flowshop scheduling problem. Applied Soft Computing,30, 604\u2013613.","journal-title":"Applied Soft Computing"},{"key":"1524_CR16","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.ejor.2010.11.004","volume":"210","author":"K Fleszar","year":"2011","unstructured":"Fleszar, K., & Charalambous, C. (2011). Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem. European Journal of Operational Research,210, 176\u2013184.","journal-title":"European Journal of Operational Research"},{"key":"1524_CR17","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/j.jocs.2017.06.004","volume":"25","author":"HY Fuchigami","year":"2018","unstructured":"Fuchigami, H. Y., & Rangel, S. (2018). A survey of case studies in production scheduling: Analysis and perspectives. Journal of Computational Science,25, 425\u2013436.","journal-title":"Journal of Computational Science"},{"key":"1524_CR18","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: WH Freeman."},{"key":"1524_CR19","first-page":"2895","volume":"43","author":"SR Hejazi","year":"2005","unstructured":"Hejazi, S. R., & Saghafian, S. (2005). Flowshop-scheduling problems with makespan criterion: a review. International Journal of Operational Research,43, 2895\u20132929.","journal-title":"International Journal of Operational Research"},{"key":"1524_CR20","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.jclepro.2018.10.116","volume":"208","author":"R Henao","year":"2019","unstructured":"Henao, R., Sarache, W., & G\u00f3mez, I. (2019). Lean manufacturing and sustainable performance: trends and future challenges. Journal of Cleaner Production,208, 99\u2013116.","journal-title":"Journal of Cleaner Production"},{"key":"1524_CR21","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.ijpe.2018.01.017","volume":"209","author":"SG Johansen","year":"2019","unstructured":"Johansen, S. G. (2019). Emergency orders in the periodic-review inventory system with fixed ordering costs and stochastic lead times for normal orders. International Journal of Production Economics,209, 205\u2013214.","journal-title":"International Journal of Production Economics"},{"key":"1524_CR22","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s10732-007-9061-z","volume":"15","author":"Y-D Kim","year":"2009","unstructured":"Kim, Y.-D., Joo, B.-J., & Shin, J.-H. (2009). Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint. Journal of Heuristics,15, 19\u201342.","journal-title":"Journal of Heuristics"},{"key":"1524_CR23","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1016\/j.cie.2017.12.015","volume":"115","author":"C Koulamas","year":"2018","unstructured":"Koulamas, C., & Panwalkar, S. S. (2018). New index priority rules for no-wait flow shops. Computers & Industrial Engineering,115, 647\u2013652.","journal-title":"Computers & Industrial Engineering"},{"issue":"5","key":"1524_CR24","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":"10","key":"1524_CR25","doi-asserted-by":"crossref","first-page":"3276","DOI":"10.1016\/j.cor.2007.02.017","volume":"35","author":"CF Liaw","year":"2008","unstructured":"Liaw, C. F. (2008). An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops. Computers & Operations Research,35(10), 3276\u20133283.","journal-title":"Computers & Operations Research"},{"key":"1524_CR26","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1016\/S0305-0548(99)00138-0","volume":"28","author":"BMT Lin","year":"2001","unstructured":"Lin, B. M. T., & Cheng, T. C. E. (2001). Batch scheduling in the no-wait two-machine flowshop to minimize the makespan. Computers & Operations Research,28, 613\u2013624.","journal-title":"Computers & Operations Research"},{"key":"1524_CR27","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.asoc.2018.08.036","volume":"73","author":"C Liu","year":"2018","unstructured":"Liu, C., Chen, H., Xu, R., & Wang, Y. (2018). Minimizing the resource consumption of heterogeneous batch-processing machines using a copula-based estimation of distribution algorithm. Applied Soft Computing,73, 283\u2013305.","journal-title":"Applied Soft Computing"},{"issue":"12","key":"1524_CR28","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.ifacol.2016.07.621","volume":"49","author":"O Masmoudi","year":"2016","unstructured":"Masmoudi, O., Yalaoui, A., Ouazene, Y., & Chehade, H. (2016). Multi-item capacitated lot-sizing problem in a flow-shop system with energy consideration. IFAC-PapersOnLine,49(12), 301\u2013306.","journal-title":"IFAC-PapersOnLine"},{"key":"1524_CR29","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1016\/j.ijpe.2017.09.015","volume":"193","author":"HNZ Matin","year":"2017","unstructured":"Matin, H. N. Z., Salmasi, N., & Shahvari, O. (2017). Makespan minimization in flowshop batch processing problem with different batch compositions on machines. International Journal of Production Economics,193, 832\u2013844.","journal-title":"International Journal of Production Economics"},{"key":"1524_CR30","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1016\/j.compchemeng.2006.02.008","volume":"30","author":"CA Mendez","year":"2006","unstructured":"Mendez, C. A., Cerda, J., Grossmann, I. E., Harjunkoski, I., & Fahl, M. (2006). State-of-the-art review of optimization methods for short-term scheduling of batch processes. Computers & Chemical Engineering,30, 913\u2013946.","journal-title":"Computers & Chemical Engineering"},{"key":"1524_CR31","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.ijpe.2019.05.017","volume":"219","author":"S Mohammadi","year":"2020","unstructured":"Mohammadi, S., Mirzapour Al-e-Hashem, S. M. J., & Rekik, Y. (2020). An integrated production scheduling and delivery route planning with multi-purpose machines: A case study from a furniture manufacturing company. International Journal of Production Economics,219, 347\u2013359.","journal-title":"International Journal of Production Economics"},{"key":"1524_CR32","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1016\/j.cor.2005.05.028","volume":"34","author":"A Oulamara","year":"2007","unstructured":"Oulamara, A. (2007). Makespan minimization in a no-wait flow shop problem with two batching machines. Computers & Operations Research,34, 1033\u20131050.","journal-title":"Computers & Operations Research"},{"key":"1524_CR33","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-1-4614-1123-9_7","volume-title":"Just-in-time systems","author":"A Oulamara","year":"2012","unstructured":"Oulamara, A. (2012). No-wait scheduling problems with batching machines. In R. Z. R\u00edos-Mercado & Y. A. R\u00edos-Sol\u00eds (Eds.), Just-in-time systems (pp. 147\u2013168). New York: Springer."},{"key":"1524_CR34","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1080\/07408170590918056","volume":"37","author":"A Oulamara","year":"2005","unstructured":"Oulamara, A., Kovalyov, M. Y., & Finke, G. (2005). Scheduling a no-wait flow shop containing unbounded batching machines. IIE Transactions,37, 685\u2013696.","journal-title":"IIE Transactions"},{"key":"1524_CR35","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"CN Potts","year":"2000","unstructured":"Potts, C. N., & Kovalyov, M. Y. (2000). Scheduling with batching: a review. European Journal of Operations Research,120, 228\u2013249.","journal-title":"European Journal of Operations Research"},{"issue":"1","key":"1524_CR36","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1057\/jors.2009.2","volume":"60","author":"CN Potts","year":"2009","unstructured":"Potts, C. N., & Strusevich, V. A. (2009). Fifty years of scheduling: a survey of milestones. Journal of the Operational Research Society,60(1), 41\u201368.","journal-title":"Journal of the Operational Research Society"},{"key":"1524_CR37","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., & Pisinger, D. (2006). An adaptive large neighbourhood search heuristic for the pickup and delivery problem with time windows. Transportation Science,40, 455\u2013472.","journal-title":"Transportation Science"},{"key":"1524_CR38","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/j.ejor.2004.04.017","volume":"165","author":"R Ruiz","year":"2005","unstructured":"Ruiz, R., & Maroto, C. (2005). A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operations Research,165, 479\u2013494.","journal-title":"European Journal of Operations Research"},{"key":"1524_CR39","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/s00170-011-3206-9","volume":"56","author":"N Salmasi","year":"2011","unstructured":"Salmasi, N., Logendran, R., & Skandari, M. R. (2011). Makespan minimization of a flowshop sequence-dependent group scheduling problem. The International Journal of Advanced Manufacturing Technology,56, 699\u2013710.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"1524_CR40","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.cor.2016.12.013","volume":"81","author":"H Samarghandi","year":"2017","unstructured":"Samarghandi, H., & Behroozi, M. (2017). On the exact solution of the no-wait flow shop problem with due date constraints. Computers & Operations Research,81, 141\u2013159.","journal-title":"Computers & Operations Research"},{"key":"1524_CR41","doi-asserted-by":"crossref","first-page":"1327","DOI":"10.1007\/s00170-013-4924-y","volume":"68","author":"SU Sapkal","year":"2013","unstructured":"Sapkal, S. U., & Laha, D. (2013). A heuristic for no-wait flow shop scheduling. The International Journal of Advanced Manufacturing Technology,68, 1327\u20131338.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"1524_CR42","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/S0895-7177(02)00176-0","volume":"36","author":"T Sawik","year":"2002","unstructured":"Sawik, T. (2002). An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers. Mathematical and Computer Modelling,36, 461\u2013471.","journal-title":"Mathematical and Computer Modelling"},{"issue":"3","key":"1524_CR43","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s00186-005-0056-y","volume":"63","author":"CJ Schuster","year":"2006","unstructured":"Schuster, C. J. (2006). No-wait job scheduling: tabu search and complexity of subproblems. Mathematical Methods of Operations Research,63(3), 473\u2013491.","journal-title":"Mathematical Methods of Operations Research"},{"key":"1524_CR44","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/0307-904X(86)90053-3","volume":"10","author":"WJ Selen","year":"1986","unstructured":"Selen, W. J., & Hott, D. D. (1986). A new formulation and solution of the flowshop scheduling problem with no in-process waiting. Applied Mathematical Modelling,10, 246\u2013248.","journal-title":"Applied Mathematical Modelling"},{"key":"1524_CR45","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1016\/j.ejor.2017.03.023","volume":"261","author":"B Stefansdottir","year":"2017","unstructured":"Stefansdottir, B., Grunow, M., & Akkerman, R. (2017). Classifying and modeling setups and cleanings in lot sizing and scheduling. European Journal of Operations Research,261, 849\u2013865.","journal-title":"European Journal of Operations Research"},{"key":"1524_CR46","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1007\/s00170-010-3094-4","volume":"55","author":"Y Sun","year":"2011","unstructured":"Sun, Y., Zhang, C., Gao, L., & Wang, X. (2011). Multi-objective optimization algorithms for flow shop scheduling problem: A review and prospects. The International Journal of Advanced Manufacturing Technology,55, 723\u2013739.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"1524_CR47","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1016\/j.mcm.2008.09.012","volume":"49","author":"L Tang","year":"2009","unstructured":"Tang, L., & Liu, P. (2009a). Minimizing makespan in a two-machine flowshop scheduling with batching and release time. Mathematical and Computer Modelling,49, 1071\u20131077.","journal-title":"Mathematical and Computer Modelling"},{"key":"1524_CR48","doi-asserted-by":"crossref","first-page":"1187","DOI":"10.1016\/j.apm.2008.01.013","volume":"33","author":"L Tang","year":"2009","unstructured":"Tang, L., & Liu, P. (2009b). Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration. Applied Mathematical Modelling,33, 1187\u20131199.","journal-title":"Applied Mathematical Modelling"},{"key":"1524_CR49","first-page":"5033","volume":"49","author":"MF Tasgetiren","year":"2011","unstructured":"Tasgetiren, M. F., Pan, Q.-K., Suganthan, P. N., & Chua, T. J. (2011). A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion. International Journal of Operational Research,49, 5033\u20135050.","journal-title":"International Journal of Operational Research"},{"issue":"1","key":"1524_CR50","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.ejor.2010.02.014","volume":"206","author":"C Wang","year":"2010","unstructured":"Wang, C., Li, X., & Wang, Q. (2010). Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion. European Journal of Operations Research,206(1), 64\u201372.","journal-title":"European Journal of Operations Research"},{"issue":"6","key":"1524_CR51","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(6), 2271\u20132280.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"2","key":"1524_CR52","first-page":"79","volume":"3","author":"S Yin","year":"2015","unstructured":"Yin, S., Nishi, T., & Zhang, G. (2015). A game theoretic model for coordination of single manufacturer and multiple suppliers with quality variations under uncertain demands. International Journal of Systems Science: Operations & Logistics,3(2), 79\u201391.","journal-title":"International Journal of Systems Science: Operations & Logistics"},{"issue":"16","key":"1524_CR53","first-page":"4919","volume":"54","author":"S Zhou","year":"2016","unstructured":"Zhou, S., Li, X., Chen, H., & Guo, C. (2016). Minimizing makespan in a no-wait flowshop with two batch processing machines using estimation of distribution algorithm. International Journal of Operational Research,54(16), 4919\u20134937.","journal-title":"International Journal of Operational Research"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-019-01524-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-019-01524-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-019-01524-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:25:29Z","timestamp":1609460729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-019-01524-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,2]]},"references-count":53,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["1524"],"URL":"https:\/\/doi.org\/10.1007\/s10845-019-01524-6","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"type":"print","value":"0956-5515"},{"type":"electronic","value":"1572-8145"}],"subject":[],"published":{"date-parts":[[2020,1,2]]},"assertion":[{"value":"20 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}