{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T03:29:52Z","timestamp":1773199792098,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,9,10]],"date-time":"2015-09-10T00:00:00Z","timestamp":1441843200000},"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":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10288-015-0297-4","type":"journal-article","created":{"date-parts":[[2015,9,11]],"date-time":"2015-09-11T00:51:07Z","timestamp":1441932667000},"page":"381-402","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A two-stage flow shop scheduling problem with transportation considerations"],"prefix":"10.1007","volume":"13","author":[{"given":"Nacira","family":"Chikhi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moncef","family":"Abbas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rachid","family":"Benmansour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelghani","family":"Bekrar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sa\u00efd","family":"Hanafi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,10]]},"reference":[{"issue":"21","key":"297_CR1","doi-asserted-by":"crossref","first-page":"5080","DOI":"10.1016\/j.apm.2014.03.035","volume":"38","author":"F Ahmadizar","year":"2014","unstructured":"Ahmadizar F, Shahmaleki P (2014) Group shop scheduling with sequence-dependent setup and transportation times. Appl Math Model 38(21):5080\u20135091","journal-title":"Appl Math Model"},{"issue":"2","key":"297_CR2","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, Jolai F, Amirtaheri O (2012) Realistic two-stage flowshop batch scheduling problems with transportation capacity and times. Appl Math Model 36(2):723\u2013735","journal-title":"Appl Math Model"},{"issue":"6","key":"297_CR3","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1080\/00207540310001631584","volume":"42","author":"G Centeno","year":"2004","unstructured":"Centeno G, Armacost RL (2004) Minimizing makespan on parallel machines with release time and machine eligibility restrictions. Int J Prod Res 42(6):1243\u20131256","journal-title":"Int J Prod Res"},{"key":"297_CR4","unstructured":"Chikhi N, Abbas M, Bekrar A, Benmansour R, Hanafi S (2014) On the complexity of robotic flow shop with transportation constraints. In: ROADEF - 15\u00e8me congr\u00e8s annuel de la Soci\u00e9t\u00e9 fran\u00e7aise de recherche op\u00e9rationnelle et d\u2019aide \u00e0 la d\u00e9cision, Bordeaux, France"},{"issue":"10","key":"297_CR5","doi-asserted-by":"crossref","first-page":"2543","DOI":"10.1016\/j.cor.2013.01.024","volume":"40","author":"A Elmi","year":"2013","unstructured":"Elmi A, Topaloglu S (2013) A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots. Comput Oper Res 40(10):2543\u20132555","journal-title":"Comput Oper Res"},{"key":"297_CR6","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, Lawler EL, Lenstra JK, Kan A (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"issue":"4","key":"297_CR7","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1057\/jors.1988.63","volume":"39","author":"JN Gupta","year":"1988","unstructured":"Gupta JN (1988) Two-stage, hybrid flowshop scheduling problem. J Oper Res Soc 39(4):359\u2013364","journal-title":"J Oper Res Soc"},{"issue":"1","key":"297_CR8","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0166-218X(00)00316-4","volume":"112","author":"J Hurink","year":"2001","unstructured":"Hurink J, Knust S (2001) Makespan minimization for flow-shop problems with transportation times and a single robot. Discrete Appl Math 112(1):199\u2013216","journal-title":"Discrete Appl Math"},{"issue":"12","key":"297_CR9","doi-asserted-by":"crossref","first-page":"2055","DOI":"10.1016\/S0305-0548(03)00164-3","volume":"31","author":"H-C Hwang","year":"2004","unstructured":"Hwang H-C, Chang SY, Lee K (2004) Parallel machine scheduling under a grade of service provision. Comput Oper Res 31(12):2055\u20132061","journal-title":"Comput Oper Res"},{"issue":"3","key":"297_CR10","first-page":"354","volume":"34","author":"H Kise","year":"1991","unstructured":"Kise H (1991) On an automated two-machine flowshop scheduling problem with infinite buffer. J Oper Res Soc Japan 34(3):354\u2013361","journal-title":"J Oper Res Soc Japan"},{"issue":"3","key":"297_CR11","first-page":"24","volume":"4","author":"CY Lee","year":"2001","unstructured":"Lee CY, Chen ZL (2001) Machine scheduling with transportation considerations. J Sched 4(3):24","journal-title":"J Sched"},{"issue":"1","key":"297_CR12","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF02099699","volume":"57","author":"E Levner","year":"1995","unstructured":"Levner E, Kogan K, Levin I (1995) Scheduling a two-machine robotic cell: a solvable case. Ann Oper Res 57(1):217\u2013232","journal-title":"Ann Oper Res"},{"issue":"7","key":"297_CR13","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1016\/S0305-0548(98)00080-X","volume":"26","author":"BM Lin","year":"1999","unstructured":"Lin BM (1999) The strong np-hardness of two-stage flowshop scheduling with a common second-stage machine. Comput Oper Res 26(7):695\u2013698","journal-title":"Comput Oper Res"},{"issue":"2","key":"297_CR14","first-page":"136","volume":"24","author":"PL Maggu","year":"1981","unstructured":"Maggu PL, Das G, Kumar R (1981) On equivalent-job for job-block in 2 $$\\times $$ \u00d7 n sequencing problem with transportation-times. J Oper Res Soc Japan 24(2):136\u2013146","journal-title":"J Oper Res Soc Japan"},{"key":"297_CR15","doi-asserted-by":"crossref","unstructured":"O\u011duz C, Lin BM, Edwin Cheng T (1997) Two-stage flowshop scheduling with a common second-stage machine. Computers & Operations Research 24(12):1169\u20131174","DOI":"10.1016\/S0305-0548(97)00023-3"},{"issue":"7","key":"297_CR16","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1057\/jors.1991.121","volume":"42","author":"S Panwalkar","year":"1991","unstructured":"Panwalkar S (1991) Scheduling of a two-machine flowshop with travel time between machines. J Oper Res Soc 42(7):609\u2013613","journal-title":"J Oper Res Soc"},{"issue":"17","key":"297_CR17","doi-asserted-by":"crossref","first-page":"4353","DOI":"10.1080\/00207540210159536","volume":"40","author":"F Riane","year":"2002","unstructured":"Riane F, Artiba A, Elmaghraby SE (2002) Sequencing a hybrid two-stage flowshop with dedicated machines. Int J Prod Res 40(17):4353\u20134380","journal-title":"Int J Prod Res"},{"issue":"2","key":"297_CR18","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 (2009) Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration. Appl Math Model 33(2):1187\u20131199","journal-title":"Appl Math Model"},{"issue":"1","key":"297_CR19","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/j.cor.2012.07.015","volume":"40","author":"S Wang","year":"2013","unstructured":"Wang S, Liu M (2013) A heuristic method for two-stage hybrid flow shop with dedicated machines. Comput Oper Res 40(1):438\u2013450","journal-title":"Comput Oper Res"},{"issue":"12","key":"297_CR20","doi-asserted-by":"crossref","first-page":"2836","DOI":"10.1016\/j.cor.2013.05.020","volume":"40","author":"J Yang","year":"2013","unstructured":"Yang J (2013) A two-stage hybrid flow shop with dedicated machines at the first stage. Comput Oper Res 40(12):2836\u20132843","journal-title":"Comput Oper Res"},{"issue":"7","key":"297_CR21","doi-asserted-by":"crossref","first-page":"1701","DOI":"10.1016\/j.cor.2011.10.006","volume":"39","author":"FS Yao","year":"2012","unstructured":"Yao FS, Zhao M, Zhang H (2012) Two-stage hybrid flow shop scheduling with dynamic job arrivals. Comput Oper Res 39(7):1701\u20131712","journal-title":"Comput Oper Res"},{"issue":"1","key":"297_CR22","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s40305-014-0040-4","volume":"2","author":"W-Y Zhong","year":"2014","unstructured":"Zhong W-Y, Lv L-H (2014) Hybrid flowshop scheduling with interstage job transportation. J Oper Res Soc China 2(1):109\u2013121","journal-title":"J Oper Res Soc China"},{"issue":"19","key":"297_CR23","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1016\/j.ipl.2012.06.013","volume":"112","author":"H Zhu","year":"2012","unstructured":"Zhu H (2012) A two stage scheduling with transportation and batching. Inf Process Lett 112(19):728\u2013731","journal-title":"Inf Process Lett"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-015-0297-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-015-0297-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-015-0297-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:13:00Z","timestamp":1559131980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-015-0297-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,10]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["297"],"URL":"https:\/\/doi.org\/10.1007\/s10288-015-0297-4","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,10]]}}}