{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:33:58Z","timestamp":1759847638240,"version":"3.41.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1023\/a:1009786526733","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:50:41Z","timestamp":1040597441000},"page":"355-365","source":"Crossref","is-referenced-by-count":16,"title":["On-Line Scheduling of Two-Machine Open Shops  Where Jobs Arrive Over Time"],"prefix":"10.1007","volume":"1","author":[{"given":"Bo","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arjen P.A.","family":"Vestjens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"151707_CR1","first-page":"8","volume":"28","author":"V.A. Aksjonov","year":"1988","unstructured":"V.A. Aksjonov, \u201cA polynomial-time algorithm of approximate solution of a scheduling problem (in Russian),\u201d Upravlyaemye Sistemy, vol. 28, pp. 8\u201311, 1988.","journal-title":"Upravlyaemye Sistemy"},{"key":"151707_CR2","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1287\/ijoc.5.3.321","volume":"5","author":"B. Chen","year":"1993","unstructured":"B. Chen and V.A. Strusevich, \u201cApproximation algorithms for three-machine open shop scheduling,\u201d ORSA Journal on Computing, vol. 5, pp. 321\u2013326, 1993.","journal-title":"ORSA Journal on Computing"},{"key":"151707_CR3","doi-asserted-by":"crossref","unstructured":"B. Chen and G.J. Woeginger, \u201cA study of on-line scheduling two-stage shops,\u201d in Minimax and Applications, D.-Z. Du and P.M. Pardalos (Eds.), 1995, pp. 97\u2013107.","DOI":"10.1007\/978-1-4613-3557-3_6"},{"key":"151707_CR4","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T. Gonzalez","year":"1976","unstructured":"T. Gonzalez and S. Sahni, \u201cOpen shop scheduling to minimize finish time,\u201d J. Assoc. Comput. Mach., vol. 23, pp. 665\u2013679, 1976.","journal-title":"J. Assoc. Comput. Mach."},{"key":"151707_CR5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/moor.6.1.153","volume":"6","author":"E.L. Lawler","year":"1981","unstructured":"E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan, \u201cMinimizing maximum lateness in a two-machine open shop,\u201d Mathematics of Operations Research, vol. 6, pp. 153\u2013158, 1981.","journal-title":"Mathematics of Operations Research"},{"key":"151707_CR6","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume":"4","author":"E.L. Lawler","year":"1993","unstructured":"E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, \u201cSequencing and scheduling: algorithms and complexity,\u201d in Handbooks in Operations Research and Management Science, North Holland, 1993, vol. 4, pp. 445\u2013522.","journal-title":"Handbooks in Operations Research and Management Science"},{"key":"151707_CR7","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(94)90151-1","volume":"130","author":"R. Motwani","year":"1994","unstructured":"R. Motwani, S. Phillips, and E. Torng, \u201cNon-clairvoyant scheduling,\u201d Theoretical Computer Science, vol. 130, pp. 17\u201347, 1994.","journal-title":"Theoretical Computer Science"},{"key":"151707_CR8","unstructured":"D.B. Shmoys, C. Stein, and J. Wein, \u201cImproved Approximation Algorithms for Shop Scheduling Problems,\u201d Proc. of the 2nd ACM-SIAM Symposium on Discrete Algorithms, 1991, pp. 148\u2013157."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009786526733.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009786526733\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009786526733.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:02:23Z","timestamp":1751281343000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009786526733"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["151707"],"URL":"https:\/\/doi.org\/10.1023\/a:1009786526733","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}