{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:23:28Z","timestamp":1761895408456},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,12,29]],"date-time":"2011-12-29T00:00:00Z","timestamp":1325116800000},"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":[[2012,6]]},"DOI":"10.1007\/s10951-011-0264-7","type":"journal-article","created":{"date-parts":[[2011,12,28]],"date-time":"2011-12-28T13:58:59Z","timestamp":1325080739000},"page":"381-390","source":"Crossref","is-referenced-by-count":16,"title":["Semi-online two-level supply chain scheduling problems"],"prefix":"10.1007","volume":"15","author":[{"given":"Igor","family":"Averbakh","sequence":"first","affiliation":[]},{"given":"Mehmet","family":"Baysan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,12,29]]},"reference":[{"key":"264_CR1","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1016\/j.ejor.2006.06.004","volume":"181","author":"I. Averbakh","year":"2007","unstructured":"Averbakh, I., & Xue, Z. (2007). Online supply chain scheduling problems with preemption. European Journal of Operational Research, 181, 500\u2013504.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"264_CR2","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.ejor.2008.12.030","volume":"200","author":"I. Averbakh","year":"2010","unstructured":"Averbakh, I. (2010). Online integrated production-distribution scheduling problems with capacitated deliveries. European Journal of Operational Research, 200(2), 377\u2013384.","journal-title":"European Journal of Operational Research"},{"key":"264_CR3","volume-title":"Online computation and competitive analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., & El-Yaniv, R. (1998). Online computation and competitive analysis. Cambridge: Cambridge University Press."},{"issue":"1","key":"264_CR4","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.1080.0688","volume":"58","author":"Z.-L. Chen","year":"2010","unstructured":"Chen, Z.-L. (2010). Integrated production and outbound scheduling: review and extensions. Operations Research, 58(1), 130\u2013148.","journal-title":"Operations Research"},{"key":"264_CR5","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1287\/opre.1070.0412","volume":"55","author":"Z.-L. Chen","year":"2007","unstructured":"Chen, Z.-L., & Hall, N. (2007). Supply chain scheduling: conflict and cooperation in assembly systems. Operations Research, 55, 1072\u20131089.","journal-title":"Operations Research"},{"key":"264_CR6","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1287\/opre.1060.0280","volume":"54","author":"Z.-L. Chen","year":"2006","unstructured":"Chen, Z.-L., & Pundoor, G. (2006). Order assignment and scheduling in a supply chain. Operations Research, 54, 555\u2013572.","journal-title":"Operations Research"},{"key":"264_CR7","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.tcs.2006.12.040","volume":"374","author":"R. Fu","year":"2007","unstructured":"Fu, R., Ji, T., Yuan, J., & Lin, Y. (2007). On-line scheduling in a parallel batch processing system to minimize makespan using restarts. Theoretical Computer Science, 374, 196\u2013202.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"264_CR8","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1287\/opre.51.4.566.16106","volume":"51","author":"N. G. Hall","year":"2003","unstructured":"Hall, N. G., & Potts, C. N. (2003). Supply chain scheduling: batching and delivery. Operations Research, 51(4), 566\u2013584.","journal-title":"Operations Research"},{"key":"264_CR9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10479-005-6234-8","volume":"135","author":"N. G. Hall","year":"2005","unstructured":"Hall, N. G., & Potts, C. N. (2005). The coordination of scheduling and batch deliveries. Annals of Operations Research, 135, 41\u201364.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"264_CR10","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1137\/S0895480196296823","volume":"13","author":"J. A. Hoogeveen","year":"2000","unstructured":"Hoogeveen, J. A., & Vestjens, A. P. A. (2000). A best possible on-line algorithm for minimizing maximum delivery time on a single machine. SIAM Journal on Discrete Mathematics, 13(1), 56\u201363.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"264_CR11","unstructured":"Ivanov, D., & Sokolov, B. (2010a). Dynamic supply chain scheduling. Journal of Scheduling, to appear. doi: 10.1007\/s10951-010-01891-6 ."},{"key":"264_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84882-952-7","volume-title":"Adaptive supply chain management","author":"D. Ivanov","year":"2010","unstructured":"Ivanov, D., & Sokolov, B. (2010b). Adaptive supply chain management. Berlin: Springer."},{"key":"264_CR13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/1099-1425(200101\/02)4:1<3::AID-JOS57>3.0.CO;2-D","volume":"4","author":"C.-Y. Lee","year":"2001","unstructured":"Lee, C.-Y., & Chen, Z.-L. (2001). Machine scheduling with transportation considerations. Journal of Scheduling, 4, 3\u201324.","journal-title":"Journal of Scheduling"},{"key":"264_CR14","first-page":"15.1","volume-title":"Handbook of scheduling: algorithms, models, and performance analysis","author":"K. Pruhs","year":"2004","unstructured":"Pruhs, K., Sgall, J., & Torng, E. (2004). On-line scheduling. In J. Y.-T. Leung (Ed.), Handbook of scheduling: algorithms, models, and performance analysis (pp. 15.1\u201315.41). Boca Raton: CRC Press. Chap.\u00a015."},{"key":"264_CR15","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.tcs.2006.12.001","volume":"374","author":"J. Tian","year":"2007","unstructured":"Tian, J., Fu, R., & Yuan, J. (2007). On-line scheduling with delivery time on a single batch machine. Theoretical Computer Science, 374, 49\u201357.","journal-title":"Theoretical Computer Science"},{"key":"264_CR16","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/1099-1425(200011\/12)3:6<333::AID-JOS53>3.0.CO;2-8","volume":"3","author":"M. Akker van\u00a0den","year":"2000","unstructured":"van\u00a0den Akker, M., Hoogeveen, H., & Vakhania, N. (2000). Restarts can help in the on-line minimization of the maximum delivery time on a single machine. Journal of Scheduling, 3, 333\u2013341.","journal-title":"Journal of Scheduling"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0264-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-011-0264-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0264-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:47Z","timestamp":1559468387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-011-0264-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,29]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["264"],"URL":"https:\/\/doi.org\/10.1007\/s10951-011-0264-7","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,29]]}}}