{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T15:08:24Z","timestamp":1772032104735,"version":"3.50.1"},"reference-count":111,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,6,12]],"date-time":"2018-06-12T00:00:00Z","timestamp":1528761600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Prod. Eng. Res. Devel."],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s11740-018-0832-1","type":"journal-article","created":{"date-parts":[[2018,6,12]],"date-time":"2018-06-12T08:15:53Z","timestamp":1528791353000},"page":"597-609","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Review and classification of hybrid shop scheduling"],"prefix":"10.1007","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8144-1339","authenticated-orcid":false,"given":"Kun","family":"Fan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yafei","family":"Zhai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinning","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"key":"832_CR1","volume-title":"Scheduling: theory. Algorithms and systems development","author":"M Pinedo","year":"1992","unstructured":"Pinedo M, Hadavi K (1992) Scheduling: theory. Algorithms and systems development. Springer, Berlin"},{"key":"832_CR2","first-page":"203","volume":"28","author":"KR Baker","year":"1974","unstructured":"Baker KR (1974) Introduction to sequencing and scheduling. Handb Oper Res Manag Sci 28:203","journal-title":"Handb Oper Res Manag Sci"},{"key":"832_CR3","volume-title":"A review of machine scheduling: complexity. Algorithms and approximability","author":"B Chen","year":"1998","unstructured":"Chen B, Potts CN, Woeginger GJ (1998) A review of machine scheduling: complexity. Algorithms and approximability. Springer, New York"},{"key":"832_CR4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1108\/01443579610130682","volume":"16","author":"PMS Paul","year":"1996","unstructured":"Paul PMS, Vincent CSW (1996) The complexity of scheduling in practice. Int J Oper Prod Manag 16:37\u201353","journal-title":"Int J Oper Prod Manag"},{"key":"832_CR5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL et al (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287\u2013326","journal-title":"Ann Discret Math"},{"key":"832_CR6","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman, New York"},{"key":"832_CR7","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discret Math 1:343\u2013362","journal-title":"Ann Discret Math"},{"key":"832_CR8","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0377-2217(97)00420-7","volume":"113","author":"M Kolonko","year":"1999","unstructured":"Kolonko M (1999) Some new results on simulated annealing applied to the job shop scheduling problem. Eur J Oper Res 113:123\u2013136","journal-title":"Eur J Oper Res"},{"key":"832_CR9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0360-8352(99)00023-6","volume":"37","author":"R Linn","year":"1999","unstructured":"Linn R, Zhang W (1999) Hybrid flow shop scheduling: a survey. Comput Ind Eng 37:57\u201361","journal-title":"Comput Ind Eng"},{"key":"832_CR10","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1111\/j.1468-0394.2005.00297.x","volume":"22","author":"H Wang","year":"2005","unstructured":"Wang H (2005) Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions. Expert Syst 22:78\u201385","journal-title":"Expert Syst"},{"key":"832_CR11","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 JA (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205:1\u201318","journal-title":"Eur J Oper Res"},{"key":"832_CR12","first-page":"10","volume":"8","author":"TS Arthanari","year":"1971","unstructured":"Arthanari TS, Ramamurthy KG (1971) An extension of two machines sequencing problem. Opsearch 8:10\u201322","journal-title":"Opsearch"},{"key":"832_CR13","volume-title":"A solution to a special class of flow shop scheduling problems. Symposium on the theory of scheduling and its applications","author":"MS Salvador","year":"1973","unstructured":"Salvador MS (1973) A solution to a special class of flow shop scheduling problems. Symposium on the theory of scheduling and its applications. Springer, Berlin"},{"key":"832_CR14","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/j.ejor.2003.12.026","volume":"164","author":"T Kis","year":"2005","unstructured":"Kis T, Pesch E (2005) A review of exact solution methods for the non-preemptive multiprocessor flowshop problem. Eur J Oper Res 164:592\u2013608","journal-title":"Eur J Oper Res"},{"key":"832_CR15","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1057\/jors.1988.63","volume":"39","author":"JND Gupta","year":"1988","unstructured":"Gupta JND (1988) Two-stage, hybrid flowshop scheduling problem. J Oper Res Soc 39:359\u2013364","journal-title":"J Oper Res Soc"},{"key":"832_CR16","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/0377-2217(94)00235-5","volume":"89","author":"JA Hoogeveen","year":"1996","unstructured":"Hoogeveen JA, Lenstra JK, Veltman B (1996) Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard. Eur J Oper Res 89:172\u2013175","journal-title":"Eur J Oper Res"},{"key":"832_CR17","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1147\/rd.294.0401","volume":"29","author":"RJ Wittrock","year":"1985","unstructured":"Wittrock RJ (1985) Scheduling algorithms for flexible flow lines. IBM J Res Dev 29:401\u2013412","journal-title":"IBM J Res Dev"},{"key":"832_CR18","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/opre.36.3.445","volume":"36","author":"RJ Wittrock","year":"1988","unstructured":"Wittrock RJ (1988) An adaptable scheduling algorithm for flexible flow lines. Oper Res 36:445\u2013453","journal-title":"Oper Res"},{"key":"832_CR19","doi-asserted-by":"crossref","first-page":"1439","DOI":"10.1016\/j.cor.2009.11.001","volume":"37","author":"I Ribas","year":"2010","unstructured":"Ribas I, Leisten R, Frami\u00f1an JM (2010) Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Comput Oper Res 37:1439\u20131454","journal-title":"Comput Oper Res"},{"key":"832_CR20","first-page":"614","volume":"20","author":"MDF Morais","year":"2013","unstructured":"Morais MDF, Filho MG, Boiko TJP (2013) Hybrid flow shop scheduling problems involving setup considerations: a literature review and analysis. Int J Ind Eng Theory 20:614\u2013630","journal-title":"Int J Ind Eng Theory"},{"key":"832_CR21","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, Ghomi SMTF, Husseini SMM (2006) An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Appl Math Comput 180:111\u2013127","journal-title":"Appl Math Comput"},{"key":"832_CR22","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.1016\/j.future.2004.03.014","volume":"20","author":"O Engin","year":"2004","unstructured":"Engin O, D\u00f6yen A (2004) A new approach to solve hybrid flow shop scheduling problems by artificial immune system. Futur Gener Comput Syst 20:1083\u20131095","journal-title":"Futur Gener Comput Syst"},{"key":"832_CR23","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/j.cie.2004.09.002","volume":"47","author":"H Allaoui","year":"2004","unstructured":"Allaoui H, Artiba A (2004) Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints. Comput Ind Eng 47:431\u2013450","journal-title":"Comput Ind Eng"},{"key":"832_CR24","doi-asserted-by":"crossref","first-page":"1399","DOI":"10.1016\/j.cor.2004.09.034","volume":"33","author":"H Allaoui","year":"2006","unstructured":"Allaoui H, Artiba A (2006) Scheduling two-stage hybrid flow shop with availability constraints. Comput Oper Res 33:1399\u20131419","journal-title":"Comput Oper Res"},{"key":"832_CR25","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/j.ijpe.2004.05.027","volume":"105","author":"Janiak Adam","year":"2007","unstructured":"Adam Janiak et al (2007) Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion. Int J Prod Econ 105:407\u2013424","journal-title":"Int J Prod Econ"},{"key":"832_CR26","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s00170-007-1048-2","volume":"35","author":"K Alayk\u00fdran","year":"2007","unstructured":"Alayk\u00fdran K, Engin O, D\u00f6yen A (2007) Using ant colony optimization to solve hybrid flow shop scheduling problems. Int J Adv Manuf Technol 35:541\u2013550","journal-title":"Int J Adv Manuf Technol"},{"key":"832_CR27","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s00186-006-0066-4","volume":"64","author":"M Haouari","year":"2006","unstructured":"Haouari M, Hidri L, Gharbi A (2006) Optimal scheduling of a two-stage hybrid flow shop. Math Method Oper Res 64:107\u2013124","journal-title":"Math Method Oper Res"},{"issue":"3\u20134","key":"832_CR28","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/s00170-007-0977-0","volume":"37","author":"J Jungwattanakit","year":"2008","unstructured":"Jungwattanakit J et al (2008) Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. Int J Adv Manuf Technol 37(3\u20134):354\u2013370","journal-title":"Int J Adv Manuf Technol"},{"key":"832_CR29","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.ejor.2015.04.004","volume":"246","author":"A Allahverdi","year":"2015","unstructured":"Allahverdi A (2015) The third comprehensive survey on scheduling problems with setup times $$\\backslash$$ \\ costs. Eur J Oper Res 246:345\u2013378","journal-title":"Eur J Oper Res"},{"key":"832_CR30","doi-asserted-by":"crossref","first-page":"2043","DOI":"10.1007\/s00170-013-4819-y","volume":"68","author":"SY Wang","year":"2013","unstructured":"Wang SY et al (2013) An enhanced estimation of distribution algorithm for solving hybrid flow-shop scheduling problem with identical parallel machines. Int J Adv Manuf Technol 68:2043\u20132056","journal-title":"Int J Adv Manuf Technol"},{"key":"832_CR31","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1057\/jors.2013.70","volume":"65","author":"H Eskandari","year":"2014","unstructured":"Eskandari H, Hosseinzadeh A (2014) A variable neighbourhood search for hybrid flow-shop scheduling problem with rework and set-up times. J Oper Res Soc 65:1221\u20131231","journal-title":"J Oper Res Soc"},{"key":"832_CR32","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.asoc.2014.07.005","volume":"24","author":"JQ Li","year":"2014","unstructured":"Li JQ, Pan QK, Wang FT (2014) A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem. Appl Soft Comput 24:63\u201377","journal-title":"Appl Soft Comput"},{"key":"832_CR33","doi-asserted-by":"crossref","first-page":"6196","DOI":"10.1016\/j.eswa.2015.03.012","volume":"42","author":"S Jun","year":"2015","unstructured":"Jun S, Park J (2015) A hybrid genetic algorithm for the hybrid flow shop scheduling problem with nighttime work and simultaneous work constraints: A case study from the transformer industry. Expert Syst Appl 42:6196\u20136204","journal-title":"Expert Syst Appl"},{"key":"832_CR34","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/j.ins.2014.10.009","volume":"316","author":"JQ Li","year":"2015","unstructured":"Li JQ, Pan QK (2015) Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm. Inform Sci 316:487\u2013502","journal-title":"Inform Sci"},{"key":"832_CR35","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1007\/s00170-011-3525-x","volume":"59","author":"A Azzi","year":"2011","unstructured":"Azzi A et al (2011) Lot splitting scheduling procedure for makespan reduction and machine capacity increase in a hybrid flow shop with batch production. Int J Adv Manuf Technol 59:775\u2013786","journal-title":"Int J Adv Manuf Technol"},{"key":"832_CR36","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1016\/j.cor.2012.10.015","volume":"40","author":"S Wang","year":"2012","unstructured":"Wang S, Liu M (2012) A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem. Comput Oper Res 40:1064\u20131075","journal-title":"Comput Oper Res"},{"key":"832_CR37","doi-asserted-by":"crossref","first-page":"7360","DOI":"10.1080\/00207543.2014.930535","volume":"52","author":"H Qin","year":"2014","unstructured":"Qin H (2014) An estimation of distribution algorithm for hybrid flow shop scheduling under stochastic processing times. Int J Prod Res 52:7360\u20137376","journal-title":"Int J Prod Res"},{"key":"832_CR38","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1080\/0951192X.2014.880803","volume":"28","author":"SY Wang","year":"2014","unstructured":"Wang SY, Wang L, Liu M, Xu Y (2014) An order-based estimation of distribution algorithm for stochastic hybrid flow-shop scheduling problem. Int J Comput Integr Manuf 28:307\u2013320","journal-title":"Int J Comput Integr Manuf"},{"key":"832_CR39","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.cie.2005.01.018","volume":"48","author":"W Xia","year":"2005","unstructured":"Xia W, Wu Z (2005) An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Comput Ind Eng 48:409\u2013425","journal-title":"Comput Ind Eng"},{"key":"832_CR40","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF02238804","volume":"45","author":"P Brucker","year":"1991","unstructured":"Brucker P, Schlie R (1991) Job-shop scheduling with multi-purpose machines. Computing 45:369\u2013375","journal-title":"Computing"},{"key":"832_CR41","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1018930406487","volume":"70","author":"S Dauzere-Peres","year":"1997","unstructured":"Dauzere-Peres S, Paulli J (1997) An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Ann Oper Res 70:281\u2013306","journal-title":"Ann Oper Res"},{"key":"832_CR42","first-page":"244","volume":"1","author":"KP Chen","year":"2006","unstructured":"Chen KP et al (2006) The shifting bottleneck procedure for job-shops with parallel machines. Int J Ind Syst Eng 1:244\u2013262","journal-title":"Int J Ind Syst Eng"},{"key":"832_CR43","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41:157\u2013183","journal-title":"Ann Oper Res"},{"key":"832_CR44","doi-asserted-by":"crossref","first-page":"1309","DOI":"10.1016\/j.cie.2008.07.021","volume":"56","author":"G Zhang","year":"2009","unstructured":"Zhang G et al (2009) An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput Ind Eng 56:1309\u20131318","journal-title":"Comput Ind Eng"},{"key":"832_CR45","doi-asserted-by":"crossref","unstructured":"Du X, Li Z, Xiong W (2008) Flexible job shop scheduling problem solving based on genetic algorithm with model constraints. In: IEEE international conference on industrial engineering and engineering management. IEEE, pp 1239\u20131243","DOI":"10.1109\/IEEM.2008.4738068"},{"key":"832_CR46","first-page":"3","volume":"15","author":"K Genova","year":"2015","unstructured":"Genova K, Kirilov L, Guliashki V (2015) A survey of solving approaches for multiple objective flexible job shop scheduling problems. Cybern Inf Technol 15:3\u201322","journal-title":"Cybern Inf Technol"},{"key":"832_CR47","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1111\/itor.12199","volume":"23","author":"IA Chaudhry","year":"2016","unstructured":"Chaudhry IA, Khan AA (2016) A research survey: review of flexible job shop scheduling techniques. Int Trans Oper Res 23:551\u2013591","journal-title":"Int Trans Oper Res"},{"key":"832_CR48","doi-asserted-by":"crossref","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","volume":"35","author":"F Pezzella","year":"2008","unstructured":"Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the flexible job-shop scheduling problem. Comput Oper Res 35:3202\u20133212","journal-title":"Comput Oper Res"},{"key":"832_CR49","doi-asserted-by":"crossref","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","volume":"35","author":"J Gao","year":"2008","unstructured":"Gao J, Sun L, Gen M (2008) A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput Oper Res 35:2892\u20132907","journal-title":"Comput Oper Res"},{"key":"832_CR50","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1016\/j.ejor.2006.04.007","volume":"179","author":"NB Ho","year":"2007","unstructured":"Ho NB, Tay JC, Lai MK (2007) An effective architecture for learning and evolving flexible job-shop schedules. Eur J Oper Res 179:316\u2013333","journal-title":"Eur J Oper Res"},{"key":"832_CR51","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10845-007-0026-8","volume":"18","author":"P Fattahi","year":"2007","unstructured":"Fattahi P, Mehrabad MS, Jolai F (2007) Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J Intell Manuf 18:331\u2013342","journal-title":"J Intell Manuf"},{"key":"832_CR52","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1016\/j.eswa.2009.06.007","volume":"37","author":"M Yazdani","year":"2010","unstructured":"Yazdani M, Amiri M, Zandieh M (2010) Flexible job-shop scheduling with parallel variable neighborhood search algorithm. Expert Syst Appl 37:678\u2013687","journal-title":"Expert Syst Appl"},{"key":"832_CR53","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1016\/j.cie.2007.08.008","volume":"54","author":"JC Tay","year":"2008","unstructured":"Tay JC, Ho NB (2008) Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Comput Ind Eng 54:453\u2013473","journal-title":"Comput Ind Eng"},{"key":"832_CR54","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.future.2009.10.004","volume":"26","author":"A Bagheri","year":"2010","unstructured":"Bagheri A et al (2010) An artificial immune algorithm for the flexible job-shop scheduling problem. Futur Gener Comput Syst 26:533\u2013541","journal-title":"Futur Gener Comput Syst"},{"key":"832_CR55","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1016\/j.asoc.2009.10.006","volume":"10","author":"LN Xing","year":"2010","unstructured":"Xing LN et al (2010) A knowledge-based ant colony optimization for flexible job shop scheduling problems. Appl Soft Comput 10:888\u2013896","journal-title":"Appl Soft Comput"},{"key":"832_CR56","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1016\/j.cie.2010.07.014","volume":"59","author":"JQ Li","year":"2010","unstructured":"Li JQ, Pan QK, Liang YC (2010) An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems. Comput Ind Eng 59:647\u2013662","journal-title":"Comput Ind Eng"},{"key":"832_CR57","doi-asserted-by":"crossref","first-page":"3563","DOI":"10.1016\/j.eswa.2010.08.145","volume":"38","author":"G Zhang","year":"2011","unstructured":"Zhang G, Gao L, Shi Y (2011) An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Syst Appl 38:3563\u20133573","journal-title":"Expert Syst Appl"},{"key":"832_CR58","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","volume":"174","author":"X Li","year":"2016","unstructured":"Li X, Gao L (2016) An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int J Prod Econ 174:93\u2013110","journal-title":"Int J Prod Econ"},{"key":"832_CR59","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1016\/j.apm.2013.07.038","volume":"38","author":"JQ Li","year":"2014","unstructured":"Li JQ, Pan QK, Tasgetiren MF (2014) A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities. Appl Math Model 38:1111\u20131132","journal-title":"Appl Math Model"},{"key":"832_CR60","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1109\/TASE.2013.2274517","volume":"12","author":"Y Yuan","year":"2015","unstructured":"Yuan Y, Xu H (2015) Multiobjective flexible job shop scheduling using memetic algorithms. IEEE T Autom Sci Eng 12:336\u2013353","journal-title":"IEEE T Autom Sci Eng"},{"key":"832_CR61","doi-asserted-by":"crossref","first-page":"1871","DOI":"10.1007\/s00170-015-7347-0","volume":"81","author":"GZ Rey","year":"2015","unstructured":"Rey GZ et al (2015) Solving the flexible job-shop just-in-time scheduling problem with quadratic earliness and tardiness costs. Int J Adv Manuf Technol 81:1871\u20131891","journal-title":"Int J Adv Manuf Technol"},{"key":"832_CR62","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.ijpe.2012.03.034","volume":"141","author":"TC Chiang","year":"2013","unstructured":"Chiang TC, Lin HJ (2013) A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling. Int J Prod Econ 141:87\u201398","journal-title":"Int J Prod Econ"},{"key":"832_CR63","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.knosys.2016.06.014","volume":"109","author":"KZ Gao","year":"2016","unstructured":"Gao KZ et al (2016) Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion. Knowl Based Syst 109:1\u201316","journal-title":"Knowl Based Syst"},{"key":"832_CR64","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.ins.2014.07.039","volume":"289","author":"KZ Gao","year":"2014","unstructured":"Gao KZ et al (2014) Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling. Inf Sci 289:76\u201390","journal-title":"Inf Sci"},{"key":"832_CR65","first-page":"857","volume":"2012","author":"J Xiong","year":"2012","unstructured":"Xiong J et al (2012) A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems. Math Probl Eng 2012:857\u2013868","journal-title":"Math Probl Eng"},{"key":"832_CR66","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.cor.2014.01.010","volume":"47","author":"S Jia","year":"2014","unstructured":"Jia S, Hu ZH (2014) Path-relinking Tabu search for the multi-objective flexible job shop scheduling problem. Comput Oper Res 47:11\u201326","journal-title":"Comput Oper Res"},{"key":"832_CR67","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1504\/IJBIC.2015.073165","volume":"7","author":"S Karthikeyan","year":"2015","unstructured":"Karthikeyan S et al (2015) A hybrid discrete firefly algorithm for solving multi-objective flexible job shop scheduling problems. Int J Bio-Inspired Comput 7:386\u2013401","journal-title":"Int J Bio-Inspired Comput"},{"key":"832_CR68","first-page":"5896","volume":"19","author":"KZ Gao","year":"2015","unstructured":"Gao KZ et al (2015) An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time. Int J Prod Res 19:5896\u20135911","journal-title":"Int J Prod Res"},{"key":"832_CR69","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.cor.2015.10.012","volume":"67","author":"D Bai","year":"2015","unstructured":"Bai D, Zhang ZH, Zhang Q (2015) Flexible open shop scheduling problem to minimize makespan. Comput Oper Res 67:207\u2013215","journal-title":"Comput Oper Res"},{"key":"832_CR70","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0167-6377(82)90021-9","volume":"1","author":"EL Lawler","year":"1982","unstructured":"Lawler EL, Luby MG, Vazirani VV (1982) Scheduling open shops with parallel machines. Oper Res Lett 1:161\u2013164","journal-title":"Oper Res Lett"},{"key":"832_CR71","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10951-007-0050-8","volume":"11","author":"DD Werra","year":"2008","unstructured":"Werra DD, Kis T, Kubiak W (2008) Preemptive open shop scheduling with multiprocessors: polynomial cases and applications. J Sched 11:75\u201383","journal-title":"J Sched"},{"key":"832_CR72","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.orl.2009.10.007","volume":"38","author":"T Kis","year":"2010","unstructured":"Kis T, Werra DD, Kubiak W (2010) A projective algorithm for preemptive open shop scheduling with two multiprocessor groups. Oper Res Lett 38:129\u2013132","journal-title":"Oper Res Lett"},{"key":"832_CR73","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1016\/j.ejor.2009.03.048","volume":"201","author":"ME Matta","year":"2010","unstructured":"Matta ME, Elmaghraby SE (2010) Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop. Eur J Oper Res 201:720\u2013728","journal-title":"Eur J Oper Res"},{"key":"832_CR74","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0377-2217(93)90249-M","volume":"70","author":"B Chen","year":"1993","unstructured":"Chen B, Strusevich VA (1993) Worst-case analysis of heuristics for open shops with parallel machines. Eur J Oper Res 70:379\u2013390","journal-title":"Eur J Oper Res"},{"key":"832_CR75","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0167-6377(99)00005-X","volume":"24","author":"P Schuurman","year":"1999","unstructured":"Schuurman P, Woeginger GJ (1999) Approximation algorithms for the multiprocessor open shop scheduling problem. Oper Res Lett 24:157\u2013163","journal-title":"Oper Res Lett"},{"key":"832_CR76","first-page":"177","volume":"15","author":"I B\u00e1r\u00e1ny","year":"1982","unstructured":"B\u00e1r\u00e1ny I, Fiala T (1982) Nearly optimum solution of multi-machine scheduling problems. Szigma Mat-K\u00f6zgazdas\u00e1gi Foly\u00f3irat 15:177\u2013191","journal-title":"Szigma Mat-K\u00f6zgazdas\u00e1gi Foly\u00f3irat"},{"key":"832_CR77","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0166-218X(00)00375-9","volume":"114","author":"SV Sevastianov","year":"2001","unstructured":"Sevastianov SV, Woeginger GJ (2001) Linear time approximation scheme for the multiprocessor open shop problem. Discret Appl Math 114:273\u2013288","journal-title":"Discret Appl Math"},{"key":"832_CR78","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1016\/j.cam.2010.08.013","volume":"235","author":"B Naderi","year":"2011","unstructured":"Naderi B et al (2011) Scheduling open shops with parallel machines to minimize total completion time. J Comput Appl Math 235:1275\u20131287","journal-title":"J Comput Appl Math"},{"key":"832_CR79","doi-asserted-by":"crossref","first-page":"843","DOI":"10.4028\/www.scientific.net\/AMM.330.843","volume":"330","author":"FD Chou","year":"2013","unstructured":"Chou FD, Wang HM (2013) A simulated annealing to solve four-stage open shops with parallel machines. Appl Mech Mater 330:843\u2013847","journal-title":"Appl Mech Mater"},{"key":"832_CR80","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0377-2217(96)00123-3","volume":"94","author":"M Drozdowski","year":"1996","unstructured":"Drozdowski M (1996) Scheduling multiprocessor tasks. An overview. Eur J Oper Res 94:215\u2013230","journal-title":"Eur J Oper Res"},{"key":"832_CR81","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0377-2217(02)00644-6","volume":"152","author":"C O\u01e7uz","year":"2004","unstructured":"O\u01e7uz C et al (2004) Hybrid flow-shop scheduling problems with multiprocessor task systems. Eur J Oper Res 152:115\u2013131","journal-title":"Eur J Oper Res"},{"key":"832_CR82","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF02099688","volume":"57","author":"P Brucker","year":"1995","unstructured":"Brucker P, Kr\u00e4mer A (1995) Shop scheduling problems with multiprocessor tasks on dedicated processors. Ann Oper Res 57:13\u201327","journal-title":"Ann Oper Res"},{"key":"832_CR83","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/0377-2217(95)00350-9","volume":"90","author":"P Brucker","year":"1996","unstructured":"Brucker P, Kr\u00e4mer A (1996) Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems. Eur J Oper Res 90:214\u2013226","journal-title":"Eur J Oper Res"},{"key":"832_CR84","first-page":"1291","volume":"31","author":"JH Sun","year":"2015","unstructured":"Sun JH, Meng YK (2015) An approximation scheme for heterogeneous parallel task scheduling in a two-stage hybrid flow shop. J Inf Sci Eng 31:1291\u20131308","journal-title":"J Inf Sci Eng"},{"key":"832_CR85","first-page":"987","volume":"2667","author":"C O\u01e7uz","year":"2003","unstructured":"O\u01e7uz C et al (2003) Parallel genetic algorithm for a flow-shop problem with multiprocessor tasks. Int Conf Comput Sci Part III 2667:987\u2013997","journal-title":"Int Conf Comput Sci Part III"},{"key":"832_CR86","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(02)00766-X","volume":"149","author":"C O\u01e7uz","year":"2003","unstructured":"O\u01e7uz C et al (2003) Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. Eur J Oper Res 149:390\u2013403","journal-title":"Eur J Oper Res"},{"key":"832_CR87","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1057\/palgrave.jors.2601716","volume":"55","author":"FS \u015eerifo\u01e7lu","year":"2004","unstructured":"\u015eerifo\u01e7lu FS, Ulusoy G (2004) Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach. J Oper Res Soc 55:504\u2013512","journal-title":"J Oper Res Soc"},{"key":"832_CR88","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10951-005-1640-y","volume":"8","author":"C O\u01e7uz","year":"2005","unstructured":"O\u01e7uz C, Ercan MF (2005) A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks. J Sched 8:323\u2013351","journal-title":"J Sched"},{"key":"832_CR89","doi-asserted-by":"crossref","first-page":"3056","DOI":"10.1016\/j.asoc.2010.12.006","volume":"11","author":"O Engin","year":"2011","unstructured":"Engin O, Ceran G, Yilmaz MK (2011) An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems. Appl Soft Comput 11:3056\u20133065","journal-title":"Appl Soft Comput"},{"key":"832_CR90","doi-asserted-by":"crossref","first-page":"3161","DOI":"10.1080\/00207540500536939","volume":"44","author":"KC Ying","year":"2006","unstructured":"Ying KC, Lin SW (2006) Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach. Int J Prod Res 44:3161\u20133177","journal-title":"Int J Prod Res"},{"key":"832_CR91","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1057\/palgrave.jors.2602625","volume":"60","author":"KC Ying","year":"2009","unstructured":"Ying KC (2009) An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks. J Oper Res Soc 60:810\u2013817","journal-title":"J Oper Res Soc"},{"key":"832_CR92","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1080\/00207540701294627","volume":"46","author":"CJ Liao","year":"2008","unstructured":"Liao CJ (2008) A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks. Int J Prod Res 46:4655\u20134670","journal-title":"Int J Prod Res"},{"key":"832_CR93","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.ijpe.2012.05.015","volume":"141","author":"FD Chou","year":"2013","unstructured":"Chou FD (2013) Particle swarm optimization with cocktail decoding method for hybrid flow shop scheduling problems with multiprocessor tasks. Int J Prod Econ 141:137\u2013145","journal-title":"Int J Prod Econ"},{"key":"832_CR94","doi-asserted-by":"crossref","first-page":"1293","DOI":"10.1016\/j.asoc.2010.03.008","volume":"10","author":"C Kahraman","year":"2010","unstructured":"Kahraman C et al (2010) Multiprocessor task scheduling in multistage hybrid flow-shops: a parallel greedy algorithm approach. Appl Soft Comput 10:1293\u20131300","journal-title":"Appl Soft Comput"},{"key":"832_CR95","doi-asserted-by":"crossref","first-page":"3056","DOI":"10.1016\/j.asoc.2010.12.006","volume":"11","author":"M Akhshabi","year":"2011","unstructured":"Akhshabi M, Akhshabi M, Khalatbari J (2011) A memetic algorithm for hybrid flow shop scheduling with multiprocessor task problems. Appl Soft Comput 11:3056\u20133065","journal-title":"Appl Soft Comput"},{"key":"832_CR96","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1007\/s00170-010-2868-z","volume":"53","author":"HM Wang","year":"2011","unstructured":"Wang HM, Chou FD, Wu FC (2011) A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan. Int J Adv Manuf Technol 53:761\u2013776","journal-title":"Int J Adv Manuf Technol"},{"key":"832_CR97","doi-asserted-by":"crossref","first-page":"1529","DOI":"10.1007\/s00170-013-4940-y","volume":"68","author":"Y Xu","year":"2013","unstructured":"Xu Y et al (2013) An effective shuffled frog-leaping algorithm for hybrid flow-shop scheduling with multiprocessor tasks. Int J Adv Manuf Technol 68:1529\u20131537","journal-title":"Int J Adv Manuf Technol"},{"key":"832_CR98","doi-asserted-by":"crossref","first-page":"1186","DOI":"10.1016\/j.cor.2012.12.014","volume":"40","author":"SW Lin","year":"2013","unstructured":"Lin SW, Ying KC, Huang CY (2013) Multiprocessor task scheduling in multistage hybrid flowshops: a hybrid artificial bee colony algorithm with bi-directional planning. Comput Oper Res 40:1186\u20131195","journal-title":"Comput Oper Res"},{"key":"832_CR99","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s00170-013-4759-6","volume":"67","author":"Y Xu","year":"2013","unstructured":"Xu Y et al (2013) An effective immune algorithm based on novel dispatching rules for the flexible flow-shop scheduling problem with multiprocessor tasks. Int J Adv Manuf Technol 67:121\u2013135","journal-title":"Int J Adv Manuf Technol"},{"key":"832_CR100","doi-asserted-by":"crossref","unstructured":"Akkoyunlu MC, Engin O, Buyukozkan K (2015) A harmony search algorithm for hybrid flow shop scheduling with multiprocessor task problems. In: International conference on modeling, simulation, and applied optimization. IEEE, pp 1\u20133","DOI":"10.1109\/ICMSAO.2015.7152245"},{"key":"832_CR101","doi-asserted-by":"crossref","first-page":"3914","DOI":"10.4028\/www.scientific.net\/AMM.110-116.3914","volume":"110\u2013116","author":"HM Wang","year":"2011","unstructured":"Wang HM et al (2011) Hybrid flow shop scheduling problems with multiprocessor tasks. Appl Mech Mater 110\u2013116:3914\u20133921","journal-title":"Appl Mech Mater"},{"key":"832_CR102","doi-asserted-by":"crossref","first-page":"1106","DOI":"10.1016\/j.cie.2013.08.004","volume":"66","author":"A Lahimer","year":"2013","unstructured":"Lahimer A, Lopez P, Haouari M (2013) Improved bounds for hybrid flow shop scheduling with multiprocessor tasks. Comput Ind Eng 66:1106\u20131114","journal-title":"Comput Ind Eng"},{"key":"832_CR103","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01545525","volume":"20","author":"P Brucker","year":"1998","unstructured":"Brucker P, Neyer J (1998) Tabu-search for the multi-mode job-shop problem. Oper Res Spektrum 20:21\u201328","journal-title":"Oper Res Spektrum"},{"key":"832_CR104","doi-asserted-by":"crossref","first-page":"1308","DOI":"10.1016\/j.ejor.2005.10.077","volume":"185","author":"G Heinz","year":"2008","unstructured":"Heinz G et al (2008) Feasible job insertions in the multi-processor-task job shop. Eur J Oper Res 185:1308\u20131318","journal-title":"Eur J Oper Res"},{"key":"832_CR105","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0166-218X(85)80007-X","volume":"11","author":"T Masuda","year":"1985","unstructured":"Masuda T, Ishii H, Nishida T (1985) The mixed shop scheduling problem. Discret Appl Math 11:175\u2013186","journal-title":"Discret Appl Math"},{"key":"832_CR106","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1057\/jors.1991.96","volume":"42","author":"VA Strusevich","year":"1991","unstructured":"Strusevich VA (1991) Two-machine super-shop scheduling problem. J Oper Res Soc 42:479\u2013492","journal-title":"J Oper Res Soc"},{"key":"832_CR107","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0377-2217(99)00161-7","volume":"120","author":"NV Shakhlevich","year":"2000","unstructured":"Shakhlevich NV, Sotskov YN, Werner F (2000) Complexity of mixed shop scheduling problems: a survey. Eur J Oper Res 120:343\u2013351","journal-title":"Eur J Oper Res"},{"key":"832_CR108","first-page":"97","volume":"21","author":"SQ Liu","year":"2012","unstructured":"Liu SQ, Ong HL (2012) Metaheuristics for the mixed shop scheduling problem. Asia Pac J Oper Res 21:97\u2013115","journal-title":"Asia Pac J Oper Res"},{"key":"832_CR109","first-page":"33","volume":"3","author":"E Anand","year":"2013","unstructured":"Anand E, Panneerselvam R (2013) A novel metaheuristics to solve mixed shop scheduling problems. Int J Found Comput Sci Technol 3:33\u201352","journal-title":"Int J Found Comput Sci Technol"},{"issue":"45\u201361","key":"832_CR110","first-page":"71","volume":"21","author":"SV Sevast\u2019yanov","year":"1981","unstructured":"Sevast\u2019yanov SV (1981) Some generalizations of the Johnson problem. Upravlyaemye Sistemy 21(45\u201361):71","journal-title":"Upravlyaemye Sistemy"},{"key":"832_CR111","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF02458392","volume":"43","author":"RN Kostoff","year":"1998","unstructured":"Kostoff RN (1998) The use and misuse of citation analysis in research evaluation. Scientometrics 43:27\u201343","journal-title":"Scientometrics"}],"container-title":["Production Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11740-018-0832-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11740-018-0832-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11740-018-0832-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,3]],"date-time":"2020-11-03T10:58:24Z","timestamp":1604401104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11740-018-0832-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,12]]},"references-count":111,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["832"],"URL":"https:\/\/doi.org\/10.1007\/s11740-018-0832-1","relation":{},"ISSN":["0944-6524","1863-7353"],"issn-type":[{"value":"0944-6524","type":"print"},{"value":"1863-7353","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,12]]},"assertion":[{"value":"28 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}