{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:27:43Z","timestamp":1759847263325},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,11,22]],"date-time":"2009-11-22T00:00:00Z","timestamp":1258848000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1007\/s11590-009-0163-4","type":"journal-article","created":{"date-parts":[[2009,11,21]],"date-time":"2009-11-21T05:17:24Z","timestamp":1258780644000},"page":"227-237","source":"Crossref","is-referenced-by-count":5,"title":["An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times"],"prefix":"10.1007","volume":"4","author":[{"given":"Ming","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengbin","family":"Chu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feifeng","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,11,22]]},"reference":[{"key":"163_CR1","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin A., El-Yaniv R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"163_CR2","unstructured":"Pruhs, K., Sgall, J., Torng, E.: Online scheduling. In: Leung, J.Y.-T. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis (2004)"},{"key":"163_CR3","unstructured":"Vestjens, A.P.A.: On-line machine scheduling. PhD Thesis, Eindhoven University of Technology (1997)"},{"key":"163_CR4","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0166-218X(00)00268-7","volume":"110","author":"B. Chen","year":"2001","unstructured":"Chen B., Du D., Han J., Wen J.: On-line scheduling of small open shops. Discrete Appl. Math. 110, 133\u2013150 (2001)","journal-title":"Discrete Appl. Math."},{"key":"163_CR5","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M. Pinedo","year":"2002","unstructured":"Pinedo M.: Scheduling: Theory, Algorithms, and Systems, 2nd edn. Prentice Hall, New York (2002)","edition":"2"},{"key":"163_CR6","volume-title":"Scheduling Algorithms","author":"P. Brucker","year":"2007","unstructured":"Brucker P.: Scheduling Algorithms. Springer, Berlin (2007)"},{"key":"163_CR7","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s006070050020","volume":"62","author":"Y. He","year":"1999","unstructured":"He Y., Zhang G.: Semi on-line scheduling on two identical machines. Computing 62, 179\u2013187 (1999)","journal-title":"Computing"},{"key":"163_CR8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s00453-003-1037-2","volume":"37","author":"E. Angelelli","year":"2003","unstructured":"Angelelli E., Speranza M.G., Tuza Z.: Semi on-line scheduling on two parallel processors with upper bound on the items. Algorithmica 37, 243\u2013262 (2003)","journal-title":"Algorithmica"},{"key":"163_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.46298\/dmtcs.367","volume":"8","author":"E. Angelelli","year":"2006","unstructured":"Angelelli E., Speranza M.G., Tuza Z.: New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks. Discrete Math. Theor. Comput. Sci. 8, 1\u20136 (2006)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"163_CR10","first-page":"141","volume":"150","author":"Y. He","year":"2005","unstructured":"He Y., Dosa G.: Semi-online scheduling jobs with tightly-grouped processing times on three identical machines. Discrete Appl. Math. 150, 141\u2013159 (2005)","journal-title":"Discrete Appl. Math."},{"key":"163_CR11","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T. Gonzalez","year":"1976","unstructured":"Gonzalez T., Sahni S.: Open shop scheduling to minimize finish time. J. ACM 23, 665\u2013679 (1976)","journal-title":"J. ACM"},{"key":"163_CR12","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10287-006-0023-y","volume":"3","author":"P. Pardalos","year":"2006","unstructured":"Pardalos P., Shylo O.: An algorithm for the job scheduling problem based on global equilibrium techniques. Comput. Manag. Sci. 3, 331\u2013348 (2006)","journal-title":"Comput. Manag. Sci."},{"key":"163_CR13","doi-asserted-by":"crossref","unstructured":"Pardalos, P., Shylo, O., Vazacopoulos, A.: Solving job shop scheduling problems utilizing the properties of backbone and \u201cbig valley\u201d. Comput. Optim. Appl. doi: 10.1007\/s10589-008-9206-5","DOI":"10.1007\/s10589-008-9206-5"},{"key":"163_CR14","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1016\/j.cor.2006.07.015","volume":"35","author":"P. Rocha","year":"2008","unstructured":"Rocha P., Ravetti M., Mateus G., Pardalos P.: Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times. Comput. Oper. Res. 35, 1250\u20131264 (2008)","journal-title":"Comput. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-009-0163-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-009-0163-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-009-0163-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,14]],"date-time":"2021-10-14T15:11:03Z","timestamp":1634224263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-009-0163-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,22]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["163"],"URL":"https:\/\/doi.org\/10.1007\/s11590-009-0163-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,22]]}}}