{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:15:37Z","timestamp":1773656137309,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,2,24]],"date-time":"2009-02-24T00:00:00Z","timestamp":1235433600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s10951-009-0104-1","type":"journal-article","created":{"date-parts":[[2009,2,23]],"date-time":"2009-02-23T15:26:04Z","timestamp":1235402764000},"page":"213-226","source":"Crossref","is-referenced-by-count":36,"title":["Parallel machine scheduling with multiple unloading servers"],"prefix":"10.1007","volume":"13","author":[{"given":"Jinwen","family":"Ou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangtong","family":"Qi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung-Yee","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,2,24]]},"reference":[{"key":"104_CR1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0305-0548(00)00074-5","volume":"29","author":"A. H. Abdekhodaee","year":"2002","unstructured":"Abdekhodaee, A. H., & Wirth, A. (2002). Scheduling parallel machines with a single server: some solvable cases and heuristics. Computers & Operations Research, 29, 295\u2013315.","journal-title":"Computers & Operations Research"},{"key":"104_CR2","doi-asserted-by":"crossref","first-page":"1867","DOI":"10.1016\/S0305-0548(03)00144-8","volume":"31","author":"A. H. Abdekhodaee","year":"2004","unstructured":"Abdekhodaee, A. H., Wirth, A., & Gan, H. S. (2004). Equal processing and equal setup time cases of scheduling parallel machines with a single server. Computers & Operations Research, 31, 1867\u20131889.","journal-title":"Computers & Operations Research"},{"key":"104_CR3","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1016\/j.cor.2004.08.013","volume":"33","author":"A. H. Abdekhodaee","year":"2006","unstructured":"Abdekhodaee, A. H., Wirth, A., & Gan, H. S. (2006). Scheduling two parallel machines with a single server: the general case. Computers & Operations Research, 33, 994\u20131009.","journal-title":"Computers & Operations Research"},{"key":"104_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, S.A., & Werner, F. (2002). Complexity results for parallel machine problems with a single server. Journal of Scheduling, 5, 429\u2013457.","journal-title":"Journal of Scheduling"},{"key":"104_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. European Journal of Operational Research, 165, 398\u2013407.","journal-title":"European Journal of Operational Research"},{"key":"104_CR6","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1016\/S0305-0548(98)00087-2","volume":"26","author":"T. C. E. Cheng","year":"1999","unstructured":"Cheng, T. C. E., Wang, G., & Sriskandarajah, C. (1999). One-operator-two-machine flowshop scheduling with setup and dismounting times. Computers & Operations Research, 26, 715\u2013730.","journal-title":"Computers & Operations Research"},{"key":"104_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. N., Sethi, S. P., & Sriskandarajah, C. (2005). Sequencing and scheduling in robotic cells: recent developments. Journal of Scheduling, 8, 387\u2013426.","journal-title":"Journal of Scheduling"},{"key":"104_CR8","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1002\/(SICI)1520-6750(200006)47:4<304::AID-NAV3>3.0.CO;2-1","volume":"47","author":"C. A. Glass","year":"2000","unstructured":"Glass, C. A., Shafransky, Y. M., & Strusevich, V. A. (2000). Scheduling for parallel dedicated machines with a single server. Naval Research Logistics, 47, 304\u2013328.","journal-title":"Naval Research Logistics"},{"key":"104_CR9","first-page":"23","volume":"102","author":"N. G. Hall","year":"2000","unstructured":"Hall, N. G., Potts, C. N., & Sriskandarajah, C. (2000). Parallel machine scheduling with a common server. Discrete Applied Mathematics, 102, 23\u2013243.","journal-title":"Discrete Applied Mathematics"},{"key":"104_CR10","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1016\/0305-0548(96)00011-1","volume":"23","author":"C. P. Koulamas","year":"1996","unstructured":"Koulamas, C. P. (1996). Scheduling two parallel semiautomatic machines to minimize machine interference. Computers & Operations Research, 23, 945\u2013956.","journal-title":"Computers & Operations Research"},{"key":"104_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0895-7177(97)00236-7","volume":"26","author":"S. A. Kravchenko","year":"1997","unstructured":"Kravchenko, S. A., & Werner, F. (1997). Parallel machine scheduling problems with a single server. Mathematical and Computer Modelling, 26, 1\u201311.","journal-title":"Mathematical and Computer Modelling"},{"key":"104_CR12","unstructured":"Kravchenko, S. A., & Werner, F. (1998). Scheduling on parallel machines with servers. Otto-von-Guericke University, preprint 30\/98."},{"key":"104_CR13","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0020-0190(01)00136-3","volume":"79","author":"S. A. Kravchenko","year":"2001","unstructured":"Kravchenko, S. A., & Werner, F. (2001). A heuristic for minimizing flow time with unit setups. Information Processing Letters, 79, 291\u2013296.","journal-title":"Information Processing Letters"},{"key":"104_CR14","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0166-218X(91)90013-M","volume":"30","author":"C.-Y. Lee","year":"1991","unstructured":"Lee, C.-Y. (1991). Parallel machines scheduling with nonsimultaneous machine available time. Discrete Applied Mathematics, 30, 53\u201361.","journal-title":"Discrete Applied Mathematics"},{"key":"104_CR15","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0166-218X(99)00201-2","volume":"100","author":"C.-Y. Lee","year":"2000","unstructured":"Lee, C.-Y., He, Y., & Tang, G. (2000). A note on parallel machine scheduling with non-simultaneous machine available time. Discrete Applied Mathematics, 100, 133\u2013135.","journal-title":"Discrete Applied Mathematics"},{"key":"104_CR16","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s10951-006-8787-z","volume":"9","author":"A. Lim","year":"2006","unstructured":"Lim, A., Rodrigues, B., & Wang, C. (2006). Two-machine flow shop problems with a single server. Journal of Scheduling, 9, 515\u2013543.","journal-title":"Journal of Scheduling"},{"key":"104_CR17","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1287\/opre.1030.0073","volume":"52","author":"C. Sriskandarajah","year":"2004","unstructured":"Sriskandarajah, C., Drobouchevitch, I., Sethi, S. P., & Chandrasekaran, R. (2004). Scheduling multiple parts in a robotic cell served by a dual-gripper robot. Operations Research, 52, 65\u201382.","journal-title":"Operations Research"},{"key":"104_CR18","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1057\/palgrave.jors.2601074","volume":"52","author":"G. Wang","year":"2001","unstructured":"Wang, G., & Cheng, T. C. E. (2001). An approximation algorithm for parallel machine scheduling with a common server. Journal of Operational Research Society, 52, 234\u2013237.","journal-title":"Journal of Operational Research Society"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0104-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0104-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0104-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:42Z","timestamp":1559468382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0104-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,24]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["104"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0104-1","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,24]]}}}