{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T11:28:48Z","timestamp":1784287728711,"version":"3.55.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,3,13]],"date-time":"2014-03-13T00:00:00Z","timestamp":1394668800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s10878-014-9727-z","type":"journal-article","created":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T05:31:04Z","timestamp":1394602264000},"page":"201-213","source":"Crossref","is-referenced-by-count":22,"title":["Single-server parallel-machine scheduling with loading and unloading times"],"prefix":"10.1007","volume":"30","author":[{"given":"Yiwei","family":"Jiang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qinghui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jueliang","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianming","family":"Dong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Min","family":"Ji","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,3,13]]},"reference":[{"key":"9727_CR1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0305-0548(00)00074-5","volume":"29","author":"A Abdekhodaee","year":"2002","unstructured":"Abdekhodaee A, Wirth A (2002) Scheduling parallel machines with a single server: some solvable cases and heuristics. Comput Operat Res 29:295\u2013315","journal-title":"Comput Operat Res"},{"key":"9727_CR2","doi-asserted-by":"crossref","first-page":"1867","DOI":"10.1016\/S0305-0548(03)00144-8","volume":"31","author":"A Abdekhodaee","year":"2004","unstructured":"Abdekhodaee A, Wirth A, Gan H (2004) Equal processing and equal setup time cases of scheduling parallel machines with a single server. Comput Operat Res 31:1867\u20131889","journal-title":"Comput Operat Res"},{"key":"9727_CR3","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1016\/j.cor.2004.08.013","volume":"33","author":"A Abdekhodaee","year":"2006","unstructured":"Abdekhodaee A, Wirth A, Gan H (2006) Scheduling parallel machines with a single server: the general case. Comput Operat Res 33:994\u20131009","journal-title":"Comput Operat Res"},{"key":"9727_CR4","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1002\/jos.120","volume":"5","author":"P Brucker","year":"2002","unstructured":"Brucker P, Dhaenens-Flipo C, Knust S, Kravchenko SA, Werner F (2002) Complexity results for parallel machine problems with a single server. J Sched 5:429\u2013457","journal-title":"J Sched"},{"key":"9727_CR5","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1016\/j.ejor.2004.04.010","volume":"165","author":"P Brucker","year":"2005","unstructured":"Brucker P, Knust S, Wang G (2005) Complexity results for flow-shop problems with a single server. Eur J Operat Res 165:398\u2013407","journal-title":"Eur J Operat Res"},{"key":"9727_CR6","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s00607-002-1467-8","volume":"70","author":"TCE Cheng","year":"2005","unstructured":"Cheng TCE, Kovalyov M (2005) Scheduling a single server in a two-machine flow shop. Computing 70:167\u2013180","journal-title":"Computing"},{"key":"9727_CR7","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10951-005-2861-9","volume":"8","author":"M Dawande","year":"2005","unstructured":"Dawande M, Geismar H, Sethi S, Sriskandarajah C (2005) Sequencing and scheduling in robotic cells: recent developments. J Sched 8:387\u2013426","journal-title":"J Sched"},{"key":"9727_CR8","doi-asserted-by":"crossref","first-page":"2242","DOI":"10.1016\/j.cor.2011.11.007","volume":"39","author":"H Gan","year":"2005","unstructured":"Gan H, Wirth A, Abdekhodaee A (2005) A branch-and-price algorithm for the general case of scheduling parallel machines with a single server. Comput Operat Res 39:2242\u20132247","journal-title":"Comput Operat Res"},{"key":"9727_CR9","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R Graham","year":"1996","unstructured":"Graham R (1996) Bounds for certain multiprocessing anomalies. Bell Syst Tech J 45:1563\u20131581","journal-title":"Bell Syst Tech J"},{"key":"9727_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1018936219150","volume":"76","author":"T Ganesharajah","year":"1998","unstructured":"Ganesharajah T, Hall N, Sriskandarajah C (1998) Design and operational issues in AGV-served manufacturing systems. Annal Operat Res 76:109\u2013154","journal-title":"Annal Operat Res"},{"key":"9727_CR11","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0166-218X(99)00206-1","volume":"102","author":"N Hall","year":"2000","unstructured":"Hall N, Potts C, Sriskandarajah C (2000) Parallel machine scheduling with a common server. Discret Appl Math 102:223\u2013243","journal-title":"Discret Appl Math"},{"key":"9727_CR12","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/j.orl.2004.08.007","volume":"33","author":"S Iravani","year":"2005","unstructured":"Iravani S, Teo C (2005) Asymptotically optimal schedules for single-server flow shop problems with setup costs and times. Operat Res Lett 33:421\u2013430","journal-title":"Operat Res Lett"},{"key":"9727_CR13","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1016\/j.cie.2013.07.020","volume":"66","author":"Y Jiang","year":"2013","unstructured":"Jiang Y, Dong J, Ji M (2013) Preemptive scheduling on two parallel machines with a single server. Comput Indust Eng 66:514\u2013518","journal-title":"Comput Indust Eng"},{"key":"9727_CR14","doi-asserted-by":"crossref","first-page":"2457","DOI":"10.1016\/j.cor.2011.12.011","volume":"39","author":"MY Kim","year":"2012","unstructured":"Kim MY, Lee YH (2012) MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server. Comput Operat Res 39:2457\u20132468","journal-title":"Comput Operat Res"},{"issue":"10","key":"9727_CR15","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1016\/0305-0548(96)00011-1","volume":"23","author":"C Koulamas","year":"1996","unstructured":"Koulamas C (1996) Scheduling two parallel semiautomatic machines to minimize machine interference. Comput Operat Res 23(10):945\u2013956","journal-title":"Comput Operat Res"},{"key":"9727_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0895-7177(97)00236-7","volume":"26","author":"S Kravchenko","year":"1997","unstructured":"Kravchenko S, Werner F (1997) Parallel machine scheduling problems with a single server. Math Comput Model 26:1\u201311","journal-title":"Math Comput Model"},{"key":"9727_CR17","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s10951-009-0104-1","volume":"13","author":"J Ou","year":"2010","unstructured":"Ou J, Qi X, Lee C (2010) Parallel machine scheduling with multiple unloading servers. J Sched 13:213\u2013226","journal-title":"J Sched"},{"key":"9727_CR18","doi-asserted-by":"crossref","first-page":"2952","DOI":"10.1016\/j.cor.2007.01.002","volume":"35","author":"L Su","year":"2008","unstructured":"Su L, Lee Y (2008) The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time. Comput Operat Res 35:2952\u20132963","journal-title":"Comput Operat Res"},{"key":"9727_CR19","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/s10878-011-9441-z","volume":"26","author":"C Su","year":"2013","unstructured":"Su C (2013) Online LPT algorithms for parallel machines scheduling with a single server. J Comb Optim 26:480\u2013488","journal-title":"J Comb Optim"},{"key":"9727_CR20","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1057\/palgrave.jors.2601074","volume":"52","author":"G Wang","year":"2001","unstructured":"Wang G, Cheng TCE (2001) An approximation algorithm for parallel machine scheduling with a common server. J Operat Res Soc 52:234\u2013237","journal-title":"J Operat Res Soc"},{"issue":"10","key":"9727_CR21","doi-asserted-by":"crossref","first-page":"2109","DOI":"10.1134\/S0005117910100103","volume":"71","author":"F Werner","year":"2010","unstructured":"Werner F, Kravchenko S (2010) Scheduling with multiple servers. Autom Remote Control 71(10):2109\u20132121","journal-title":"Autom Remote Control"},{"key":"9727_CR22","doi-asserted-by":"crossref","unstructured":"Xie X, Li Y, Zhou H, Zheng Y (2012) Scheduling parallel machines with a single server. In: International Conference on Measurement, Information and Control (MIC), vol 1, pp 453\u2013456","DOI":"10.1109\/MIC.2012.6273340"},{"key":"9727_CR23","doi-asserted-by":"crossref","unstructured":"Xie X, Zheng Y, Li Y (2012) Scheduling parallel machines with a single server: a dedicated case. In: Fifth International Joint Conference on Computational Sciences and Optimization (CSO), pp 146\u2013149","DOI":"10.1109\/CSO.2012.39"},{"key":"9727_CR24","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/s00170-005-0053-6","volume":"30","author":"Y Yip","year":"2006","unstructured":"Yip Y, Cheng C, Low C (2006) Sequencing of an $$m$$ m machine flowshop with setup, processing and removal times separated. Int J Adv Manuf Technol 30:286\u2013296","journal-title":"Int J Adv Manuf Technol"},{"key":"9727_CR25","doi-asserted-by":"crossref","first-page":"1529","DOI":"10.1016\/j.cor.2008.02.015","volume":"36","author":"L Zhang","year":"2009","unstructured":"Zhang L, Andrew W (2009) On-line scheduling of two parallel machines with a single server. Comput Oper Res 36:1529\u20131553","journal-title":"Comput Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9727-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9727-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9727-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:23Z","timestamp":1559276603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9727-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,13]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["9727"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9727-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,13]]}}}