{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T05:40:55Z","timestamp":1778046055427,"version":"3.51.4"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T00:00:00Z","timestamp":1567641600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T00:00:00Z","timestamp":1567641600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s10732-019-09425-w","type":"journal-article","created":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T14:42:58Z","timestamp":1567780978000},"page":"133-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Scheduling hybrid flow shops with time windows"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5239-6762","authenticated-orcid":false,"given":"Fan","family":"Yang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9215-3914","authenticated-orcid":false,"given":"Roel","family":"Leus","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,5]]},"reference":[{"issue":"5","key":"9425_CR1","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.: Scheduling two-stage hybrid flow shop with availability constraints. Comput. Oper. Res. 33(5), 1399\u20131419 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9425_CR2","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/S0377-2217(00)00142-9","volume":"132","author":"M Azizoglu","year":"2001","unstructured":"Azizoglu, M., Cakmak, E., Kondakci, S.: A flexible flowshop problem with total flow time minimization. Eur. J. Oper. Res. 132(3), 528\u2013538 (2001)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9425_CR3","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1023\/A:1009750409895","volume":"1","author":"E Balas","year":"1998","unstructured":"Balas, E., Lancia, G., Serafini, P., Vazacopoulos, A.: Job shop scheduling with deadlines. J. Comb. Optim. 1(4), 329\u2013353 (1998)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"9425_CR4","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10951-008-0067-7","volume":"11","author":"E Balas","year":"2008","unstructured":"Balas, E., Simonetti, N., Vazacopoulos, A.: Job shop scheduling with setup times, deadlines and precedence constraints. J. Sched. 11(4), 253\u2013262 (2008)","journal-title":"J. Sched."},{"issue":"3","key":"9425_CR5","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1016\/j.cor.2010.08.010","volume":"38","author":"JY Bang","year":"2011","unstructured":"Bang, J.Y., Kim, Y.D.: Scheduling algorithms for a semiconductor probing facility. Comput. Oper. Res. 38(3), 666\u2013673 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"9425_CR6","doi-asserted-by":"crossref","first-page":"1707","DOI":"10.1080\/00207543.2012.694489","volume":"51","author":"P Baumann","year":"2013","unstructured":"Baumann, P., Trautmann, N.: A continuous-time MILP model for short-term scheduling of make-and-pack production processes. Int. J. Prod. Res. 51(6), 1707\u20131727 (2013)","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"9425_CR7","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1016\/j.ejor.2012.06.035","volume":"223","author":"R Belaid","year":"2012","unstructured":"Belaid, R., T\u2019kindt, V., Esswein, C.: Scheduling batches in flowshop with limited buffers in the shampoo industry. Eur. J. Oper. Res. 223(2), 560\u2013572 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9425_CR8","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1016\/j.ejor.2015.05.057","volume":"246","author":"L Berghman","year":"2015","unstructured":"Berghman, L., Leus, R.: Practical solutions for a dock assignment problem with trailer transportation. Eur. J. Oper. Res. 246(3), 787\u2013799 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9425_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10479-011-0971-7","volume":"213","author":"L Berghman","year":"2014","unstructured":"Berghman, L., Leus, R., Spieksma, F.C.R.: Optimal solutions for a dock assignment problem with trailer transportation. Ann. Oper. Res. 213(1), 1\u201323 (2014)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"9425_CR10","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0377-2217(91)90148-O","volume":"51","author":"SA Brah","year":"1991","unstructured":"Brah, S.A., Hunsucker, J.L.: Branch and bound algorithm for the flow shop with multiple processors. Eur. J. Oper. Res. 51(1), 88\u201399 (1991)","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"9425_CR11","doi-asserted-by":"crossref","first-page":"2612","DOI":"10.1080\/00207543.2013.861949","volume":"52","author":"C Chamnanlor","year":"2014","unstructured":"Chamnanlor, C., Sethanan, K., Chien, C.F., Gen, M.: Re-entrant flow shop scheduling problem with time windows using hybrid genetic algorithm based on auto-tuning strategy. Int. J. Prod. Res. 52(9), 2612\u20132629 (2014)","journal-title":"Int. J. Prod. Res."},{"issue":"8","key":"9425_CR12","doi-asserted-by":"crossref","first-page":"1915","DOI":"10.1007\/s10845-015-1078-9","volume":"28","author":"C Chamnanlor","year":"2017","unstructured":"Chamnanlor, C., Sethanan, K., Gen, M., Chien, C.-F.: Embedding ant system in genetic algorithm for re-entrant hybrid flow shop scheduling problems with time window constraints. J. Intell. Manuf. 28(8), 1915\u20131931 (2017)","journal-title":"J. Intell. Manuf."},{"issue":"4","key":"9425_CR13","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1287\/mnsc.1040.0325","volume":"51","author":"ZL Chen","year":"2005","unstructured":"Chen, Z.L., Vairaktarakis, G.L.: Integrated scheduling of production and distribution operations. Manage. Sci. 51(4), 614\u2013628 (2005)","journal-title":"Manage. Sci."},{"issue":"3","key":"9425_CR14","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/0377-2217(87)90240-2","volume":"29","author":"N Christofides","year":"1987","unstructured":"Christofides, N., Alvarez-Valdes, R., Tamarit, J.M.: Project scheduling with resource constraints: a branch and bound approach. Eur. J. Oper. Res. 29(3), 262\u2013273 (1987)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9425_CR15","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s10951-015-0428-y","volume":"19","author":"M Davari","year":"2016","unstructured":"Davari, M., Demeulemeester, E., Leus, R., Talla Nobibon, F.: Exact algorithms for single-machine scheduling with time windows and precedence constraints. J. Sched. 19(3), 309\u2013334 (2016)","journal-title":"J. Sched."},{"issue":"3","key":"9425_CR16","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1287\/opre.1060.0358","volume":"55","author":"D Debels","year":"2007","unstructured":"Debels, D., Vanhoucke, M.: A decomposition-based genetic algorithm for the resource-constrained project-scheduling problem. Oper. Res. 55(3), 457\u2013469 (2007)","journal-title":"Oper. Res."},{"issue":"1","key":"9425_CR17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10479-011-0928-x","volume":"213","author":"F Della Croce","year":"2014","unstructured":"Della Croce, F., Grosso, A., Salassa, F.: A matheuristic approach for the two-machine total completion time flow shop problem. Ann. Oper. Res. 213(1), 67\u201378 (2014)","journal-title":"Ann. Oper. Res."},{"issue":"1\u20133","key":"9425_CR18","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local branching. Math. Program. 98(1\u20133), 23\u201347 (2003)","journal-title":"Math. Program."},{"issue":"5","key":"9425_CR19","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1016\/j.cor.2006.08.004","volume":"35","author":"M Fischetti","year":"2008","unstructured":"Fischetti, M., Lodi, A.: Repairing MIP infeasibility through local branching. Comput. Oper. Res. 35(5), 1436\u20131445 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9425_CR20","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"M Fischetti","year":"2005","unstructured":"Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Math. Program. 104(1), 91\u2013104 (2005)","journal-title":"Math. Program."},{"issue":"4","key":"9425_CR21","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1016\/j.cie.2004.12.004","volume":"48","author":"JM Garcia","year":"2005","unstructured":"Garcia, J.M., Lozano, S.: Production and delivery scheduling problem with time windows. Comput. Indu. Eng. 48(4), 733\u2013742 (2005)","journal-title":"Comput. Indu. Eng."},{"issue":"2","key":"9425_CR22","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"9425_CR23","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/j.cor.2011.02.017","volume":"39","author":"C Gicquel","year":"2012","unstructured":"Gicquel, C., Hege, L., Minoux, M., Van Canneyt, W.: A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints. Comput. Oper. Res. 39(3), 629\u2013636 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9425_CR24","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/S0377-2217(99)00224-6","volume":"125","author":"J Grabowski","year":"2000","unstructured":"Grabowski, J., Pempera, J.: Sequencing of jobs in some production system. Eur. J. Oper. Res. 125(3), 535\u2013550 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"9425_CR25","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., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"issue":"3","key":"9425_CR26","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/j.cor.2003.08.007","volume":"32","author":"S Guirchoun","year":"2005","unstructured":"Guirchoun, S., Martineau, P., Billaut, J.C.: Total completion time minimization in a computer system with a server and two parallel processors. Comput. Oper. Res. 32(3), 599\u2013611 (2005)","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"9425_CR27","doi-asserted-by":"crossref","first-page":"2329","DOI":"10.1007\/s11590-014-0741-y","volume":"8","author":"H Hadda","year":"2014","unstructured":"Hadda, H., Dridi, N., Hajri-Gabouj, S.: Exact resolution of the two-stage hybrid flow shop with dedicated machines. Optim. Lett. 8(8), 2329\u20132339 (2014)","journal-title":"Optim. Lett."},{"issue":"3","key":"9425_CR28","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0166-218X(99)00206-1","volume":"102","author":"NG Hall","year":"2000","unstructured":"Hall, N.G., Potts, C.N., Sriskandarajah, C.: Parallel machine scheduling with a common server. Discrete Appl. Math. 102(3), 223\u2013243 (2000)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"9425_CR29","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/TSM.2017.2740340","volume":"30","author":"A Ham","year":"2017","unstructured":"Ham, A., Fowler, J.W., Cakici, E.: Constraint programming approach for scheduling jobs with release times, non-identical sizes, and incompatible families on parallel batching machines. IEEE Trans. Semicond. Manuf. 30(4), 500\u2013507 (2017)","journal-title":"IEEE Trans. Semicond. Manuf."},{"issue":"1","key":"9425_CR30","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.: Optimal scheduling of a two-stage hybrid flow shop. Math. Methods Oper. Res. 64(1), 107\u2013124 (2006)","journal-title":"Math. Methods Oper. Res."},{"issue":"1\u20132","key":"9425_CR31","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s00170-007-1203-9","volume":"39","author":"R-H Huang","year":"2008","unstructured":"Huang, R.-H., Yang, C.-L.: Ant colony system for job shop scheduling with time windows. Int. J. Adv. Manuf. Technol. 39(1\u20132), 151\u2013157 (2008)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"4","key":"9425_CR32","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","volume":"13","author":"V Jain","year":"2001","unstructured":"Jain, V., Grossmann, I.E.: Algorithms for hybrid MILP\/CP models for a class of optimization problems. INFORMS J. Comput. 13(4), 258\u2013276 (2001)","journal-title":"INFORMS J. Comput."},{"issue":"12","key":"9425_CR33","doi-asserted-by":"crossref","first-page":"3654","DOI":"10.1080\/00207543.2012.757666","volume":"51","author":"P Jula","year":"2013","unstructured":"Jula, P., Kones, I.: Continuous-time algorithms for scheduling a single machine with sequence-dependent setup times and time window constraints in coordinated chains. Int. J. Prod. Res. 51(12), 3654\u20133670 (2013)","journal-title":"Int. J. Prod. Res."},{"key":"9425_CR34","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.ijpe.2014.09.028","volume":"159","author":"N Kaveshgar","year":"2015","unstructured":"Kaveshgar, N., Huynh, N.: Integrated quay crane and yard truck scheduling for unloading inbound containers. Int. J. Prod. Econ. 159, 168\u2013177 (2015)","journal-title":"Int. J. Prod. Econ."},{"key":"9425_CR35","doi-asserted-by":"crossref","unstructured":"Klemmt A, M\u00f6nch L (2012) Scheduling jobs with time constraints between consecutive process steps in semiconductor manufacturing. In: Simulation conference (WSC), proceedings of the 2012 Winter, pp 1\u201310. IEEE","DOI":"10.1109\/WSC.2012.6465235"},{"issue":"2","key":"9425_CR36","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/0377-2217(95)00357-6","volume":"90","author":"R Kolisch","year":"1996","unstructured":"Kolisch, R.: Serial and parallel resource-constrained project scheduling methods revisited: theory and computation. Eur. J. Oper. Res. 90(2), 320\u2013333 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9425_CR37","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1080\/00207543.2015.1035815","volume":"54","author":"G Komaki","year":"2016","unstructured":"Komaki, G., Teymourian, E., Kayvanfar, V.: Minimising makespan in the two-stage assembly hybrid flow shop scheduling problem using artificial immune systems. Int. J. Prod. Res. 54(4), 963\u2013983 (2016)","journal-title":"Int. J. Prod. Res."},{"issue":"22","key":"9425_CR38","doi-asserted-by":"crossref","first-page":"4731","DOI":"10.1080\/0020754041233127044","volume":"42","author":"GC Lee","year":"2004","unstructured":"Lee, G.C., Kim, Y.D.: A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness. Int. J. Prod. Res. 42(22), 4731\u20134743 (2004)","journal-title":"Int. J. Prod. Res."},{"key":"9425_CR39","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.cor.2015.05.010","volume":"65","author":"D Lei","year":"2016","unstructured":"Lei, D., Guo, X.: Hybrid flow shop scheduling with not-all-machines options via local search with controlled deterioration. Comput. Oper. Res. 65, 76\u201382 (2016)","journal-title":"Comput. Oper. Res."},{"key":"9425_CR40","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra, J.K., Rinnooy Kan, A., Brucker, P.: Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343\u2013362 (1977)","journal-title":"Ann. Discrete Math."},{"issue":"20","key":"9425_CR41","doi-asserted-by":"crossref","first-page":"6084","DOI":"10.1080\/00207543.2017.1324222","volume":"55","author":"M Liu","year":"2017","unstructured":"Liu, M., Yang, X., Zhang, J., Chu, C.: Scheduling a tempered glass manufacturing system: a three-stage hybrid flow shop model. Int. J. Prod. Res. 55(20), 6084\u20136107 (2017)","journal-title":"Int. J. Prod. Res."},{"issue":"6","key":"9425_CR42","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/S0305-0483(01)00040-8","volume":"29","author":"E N\u00e9ron","year":"2001","unstructured":"N\u00e9ron, E., Baptiste, P., Gupta, J.N.: Solving hybrid flow shop problem using energetic reasoning and global operations. Omega 29(6), 501\u2013511 (2001)","journal-title":"Omega"},{"issue":"3","key":"9425_CR43","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1016\/j.ejor.2015.10.007","volume":"250","author":"QK Pan","year":"2016","unstructured":"Pan, Q.K.: An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling. Eur. J. Oper. Res. 250(3), 702\u2013714 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"9425_CR44","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.cor.2016.11.022","volume":"80","author":"QK Pan","year":"2017","unstructured":"Pan, Q.K., Ruiz, R., Alfaro-Fernandez, P.: Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows. Comput. Oper. Res. 80, 50\u201360 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"9425_CR45","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/TASE.2005.853474","volume":"2","author":"Y Pan","year":"2005","unstructured":"Pan, Y., Shi, L.: Dual constrained single machine sequencing to minimize total weighted completion time. IEEE Trans. Autom. Sci. Eng. 2(4), 344\u2013357 (2005)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"9425_CR46","doi-asserted-by":"crossref","unstructured":"Panwalkar, S., Dudek, R., Smith, M.: Sequencing research and the industrial scheduling problem. In: Symposium on the theory of scheduling and its applications, Vol 86, pp 29\u201338. Springer, Berlin (1973)","DOI":"10.1007\/978-3-642-80784-8_2"},{"key":"9425_CR47","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: theory, algorithms, and systems","author":"ML Pinedo","year":"2016","unstructured":"Pinedo, M.L.: Scheduling: theory, algorithms, and systems. Springer, Berlin (2016)"},{"issue":"3","key":"9425_CR48","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1016\/j.ejor.2006.01.042","volume":"178","author":"D Quadt","year":"2007","unstructured":"Quadt, D., Kuhn, H.: A taxonomy of flexible flow line scheduling procedures. Eur. J. Oper. Res. 178(3), 686\u2013698 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"9425_CR49","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., Framinan, J.M.: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Comput. Oper. Res. 37(8), 1439\u20131454 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9425_CR50","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., Vazquez-Rodriguez, J.A.: The hybrid flow shop scheduling problem. Eur. J. Oper. Res. 205(1), 1\u201318 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"14","key":"9425_CR51","doi-asserted-by":"crossref","first-page":"3219","DOI":"10.1080\/00207540110053561","volume":"39","author":"T Sawik","year":"2001","unstructured":"Sawik, T.: Mixed integer programming for scheduling surface mount technology lines. Int. J. Prod. Res. 39(14), 3219\u20133235 (2001)","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"9425_CR52","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s00291-015-0414-y","volume":"38","author":"M Schulze","year":"2016","unstructured":"Schulze, M., Rieck, J., Seifi, C., Zimmermann, J.: Machine scheduling in underground mining: an application in the potash industry. OR Spectr. 38(2), 365\u2013403 (2016)","journal-title":"OR Spectr."},{"key":"9425_CR53","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/j.ijpe.2017.10.015","volume":"195","author":"O Shahvari","year":"2018","unstructured":"Shahvari, O., Logendran, R.: A comparison of two stage-based hybrid algorithms for a batch scheduling problem in hybrid flow shop with learning effect. Int. J. Prod. Econ. 195, 227\u2013248 (2018)","journal-title":"Int. J. Prod. Econ."},{"issue":"2","key":"9425_CR54","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s10951-017-0530-4","volume":"21","author":"Y Tan","year":"2018","unstructured":"Tan, Y., M\u00f6nch, L., Fowler, J.W.: A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines. J. Sched. 21(2), 209\u2013226 (2018)","journal-title":"J. Sched."},{"issue":"6","key":"9425_CR55","first-page":"1303","volume":"18","author":"L Tang","year":"2010","unstructured":"Tang, L., Wang, X.: An improved particle swarm optimization algorithm for the hybrid flowshop scheduling to minimize total weighted completion time in process industry. IEEE Trans. Control Syst. Technol. 18(6), 1303\u20131314 (2010)","journal-title":"IEEE Trans. Control Syst. Technol."},{"issue":"10","key":"9425_CR56","doi-asserted-by":"crossref","first-page":"3001","DOI":"10.1016\/j.cor.2005.11.010","volume":"34","author":"L Tang","year":"2007","unstructured":"Tang, L., Wang, G., Liu, J.: A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry. Comput. Oper. Res. 34(10), 3001\u20133015 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9425_CR57","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/S0377-2217(02)00265-5","volume":"142","author":"V T\u2019kindt","year":"2002","unstructured":"T\u2019kindt, V., Monmarch\u00e9, N., Tercinet, F., La\u00fcgt, D.: An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem. Eur. J. Oper. Res. 142(2), 250\u2013257 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9425_CR58","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1080\/00207543.2014.949363","volume":"53","author":"S Wang","year":"2015","unstructured":"Wang, S., Liu, M., Chu, C.: A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling. Int. J. Prod. Res. 53(4), 1143\u20131167 (2015)","journal-title":"Int. J. Prod. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-019-09425-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-019-09425-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-019-09425-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,3]],"date-time":"2021-04-03T09:07:15Z","timestamp":1617440835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-019-09425-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,5]]},"references-count":58,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["9425"],"URL":"https:\/\/doi.org\/10.1007\/s10732-019-09425-w","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,5]]},"assertion":[{"value":"15 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}