{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:06Z","timestamp":1740122466658,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,1,9]],"date-time":"2019-01-09T00:00:00Z","timestamp":1546992000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003005","name":"Eindhoven University of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003005","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s10878-019-00381-6","type":"journal-article","created":{"date-parts":[[2019,1,9]],"date-time":"2019-01-09T12:20:00Z","timestamp":1547036400000},"page":"224-253","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Online interval scheduling on two related machines: the power of lookahead"],"prefix":"10.1007","volume":"38","author":[{"given":"Nicolas","family":"Pinson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2547-3782","authenticated-orcid":false,"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,9]]},"reference":[{"issue":"3","key":"381_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0166-218X(95)80003-M","volume":"59","author":"MC Carlisle","year":"1995","unstructured":"Carlisle MC, Lloyd EL (1995) On the k-coloring of intervals. Discrete Appl Math 59(3):225\u2013235","journal-title":"Discrete Appl Math"},{"key":"381_CR2","doi-asserted-by":"crossref","unstructured":"Disser Y, Klimm M, L\u00fcbbecke E (2015) Scheduling bidirectional traffic on a path. arXiv preprint \n                    arXiv:1504.07129","DOI":"10.1007\/978-3-662-47672-7_33"},{"issue":"1","key":"381_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(94)90150-3","volume":"130","author":"G Dosa","year":"1994","unstructured":"Dosa G, Wang Y, Han X, Guo H (1994) Online scheduling with rearrangement on two related machines. Theor Comput Sci 130(1):5\u201316","journal-title":"Theor Comput Sci"},{"issue":"1","key":"381_CR4","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/s00453-014-9940-2","volume":"74","author":"L Epstein","year":"2016","unstructured":"Epstein L, Je\u017c \u0141, Sgall J, van Stee R (2016) Online scheduling of jobs with fixed start times on related machines. Algorithmica 74(1):156\u2013176","journal-title":"Algorithmica"},{"key":"381_CR5","doi-asserted-by":"publisher","first-page":"3129","DOI":"10.1016\/j.tcs.2010.04.042","volume":"411","author":"L Epstein","year":"2010","unstructured":"Epstein L, Levin A (2010) Improved randomized results for the interval selection problem. Theor Comput Sci 411:3129\u20133135","journal-title":"Theor Comput Sci"},{"issue":"1","key":"381_CR6","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0196-6774(02)00291-2","volume":"46","author":"T Erlebach","year":"2003","unstructured":"Erlebach T, Spieksma F (2003) Interval selection: applications, algorithms, and lower bounds. J Algorithms 46(1):27\u201353","journal-title":"J Algorithms"},{"issue":"1","key":"381_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0166-218X(95)00112-5","volume":"58","author":"U Faigle","year":"1995","unstructured":"Faigle U, Nawijn WM (1995) Note on scheduling intervals on-line. Discrete Appl Math 58(1):13\u201317","journal-title":"Discrete Appl Math"},{"key":"381_CR8","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/j.ipl.2012.01.015","volume":"112","author":"SP Fung","year":"2012","unstructured":"Fung SP, Poon CK, Yung DK (2012) On-line scheduling of equal-length intervals on parallel machines. Inf Process Lett 112:376\u2013379","journal-title":"Inf Process Lett"},{"issue":"3","key":"381_CR9","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/s10878-007-9131-z","volume":"16","author":"SP Fung","year":"2008","unstructured":"Fung SP, Poon CK, Zheng F (2008) Online interval scheduling: randomized and multiprocessor cases. J Comb Optim 16(3):248\u2013262","journal-title":"J Comb Optim"},{"issue":"1","key":"381_CR10","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/s00224-013-9528-2","volume":"55","author":"SP Fung","year":"2014","unstructured":"Fung SP, Poon CK, Zheng F (2014) Improved randomized online scheduling of intervals and jobs. Theory Comput Syst 55(1):202\u2013228","journal-title":"Theory Comput Syst"},{"issue":"4","key":"381_CR11","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s10951-013-0364-7","volume":"17","author":"J Hermans","year":"2014","unstructured":"Hermans J (2014) Optimization of inland shipping. J Sched 17(4):305","journal-title":"J Sched"},{"issue":"5","key":"381_CR12","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1002\/nav.20231","volume":"54","author":"AW Kolen","year":"2007","unstructured":"Kolen AW, Lenstra JK, Papadimitriou CH, Spieksma FC (2007) Interval scheduling: a survey. Nav Res Logist 54(5):530\u2013543","journal-title":"Nav Res Logist"},{"issue":"12","key":"381_CR13","doi-asserted-by":"publisher","first-page":"1836","DOI":"10.1016\/j.cor.2011.03.001","volume":"38","author":"SO Krumke","year":"2011","unstructured":"Krumke SO, Thielen C, Westphal S (2011) Interval scheduling on related machines. Comput Oper Res 38(12):1836\u20131844","journal-title":"Comput Oper Res"},{"key":"381_CR14","doi-asserted-by":"publisher","first-page":"5182","DOI":"10.1016\/j.tcs.2009.07.056","volume":"410","author":"W Li","year":"2009","unstructured":"Li W, Yuan J, Cao J, Bu H (2009) Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead. Theor Comput Sci 410:5182\u20135187","journal-title":"Theor Comput Sci"},{"key":"381_CR15","first-page":"302","volume":"94","author":"RJ Lipton","year":"1994","unstructured":"Lipton RJ, Tomkins A (1994) Online interval scheduling. SODA 94:302\u2013311","journal-title":"SODA"},{"issue":"4","key":"381_CR16","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/B:JOSH.0000031423.39762.d3","volume":"7","author":"H Miyazawa","year":"2004","unstructured":"Miyazawa H, Erlebach T (2004) An improved randomized on-line algorithm for a weighted interval selection problem. J Sched 7(4):293\u2013311","journal-title":"J Sched"},{"key":"381_CR17","doi-asserted-by":"crossref","unstructured":"Passchyn W, Briskorn D, Spieksma F (2016) No-wait scheduling for locks. INFORMS J Comput (to appear)","DOI":"10.2139\/ssrn.2747309"},{"issue":"3","key":"381_CR18","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1016\/j.ejor.2015.09.012","volume":"248","author":"W Passchyn","year":"2016","unstructured":"Passchyn W, Briskorn D, Spieksma FC (2016) Mathematical programming models for lock scheduling with an emission objective. Eur J Oper Res 248(3):802\u2013814","journal-title":"Eur J Oper Res"},{"issue":"2","key":"381_CR19","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.ejor.2015.12.007","volume":"251","author":"W Passchyn","year":"2016","unstructured":"Passchyn W, Coene S, Briskorn D, Hurink J\u00a0L, Spieksma F\u00a0C, Vanden\u00a0Berghe G (2016) The lockmaster\u2019s problem. Eur J Oper Res 251(2):432\u2013441","journal-title":"Eur J Oper Res"},{"key":"381_CR20","doi-asserted-by":"crossref","unstructured":"Prandtstetter M, Ritzinger U, Schmidt P, Ruthmair M (2015) A variable neighborhood search approach for the interdependent lock scheduling problem. In: European Conference on Evolutionary Computation in Combinatorial Optimization, pp. 36\u201347. Springer","DOI":"10.1007\/978-3-319-16468-7_4"},{"key":"381_CR21","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.ipl.2008.03.018","volume":"108","author":"U Schwarz","year":"2008","unstructured":"Schwarz U (2008) Online scheduling on semi-related machines. Inf Process Lett 108:38\u201340","journal-title":"Inf Process Lett"},{"key":"381_CR22","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/BFb0029570","volume-title":"Online algorithms: the state of the art","author":"J Sgall","year":"1998","unstructured":"Sgall J (1998) On-line scheduling. In: Fiat A, Woeginger G (eds) Online algorithms: the state of the art. Springer, Berlin, pp 196\u2013231"},{"issue":"5","key":"381_CR23","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/j.tre.2011.02.005","volume":"47","author":"LD Smith","year":"2011","unstructured":"Smith LD, Nauss RM, Mattfeld DC, Li J, Ehmke JF, Reindl M (2011) Scheduling operations at system choke points with sequence-dependent delays and processing times. Transp Res Part E Logist Transp Rev 47(5):669\u2013680","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"1","key":"381_CR24","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(94)90150-3","volume":"130","author":"GJ Woeginger","year":"1994","unstructured":"Woeginger GJ (1994) On-line scheduling of jobs with fixed start and end times. Theor Comput Sci 130(1):5\u201316","journal-title":"Theor Comput Sci"},{"issue":"2","key":"381_CR25","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s11590-017-1191-0","volume":"12","author":"G Yu","year":"2018","unstructured":"Yu G, Jacobson SH (2018) Online c-benevolent job scheduling on multiple machines. Optim Lett 12(2):251\u2013263","journal-title":"Optim Lett"},{"issue":"1","key":"381_CR26","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.cor.2012.06.003","volume":"40","author":"F Zheng","year":"2013","unstructured":"Zheng F, Cheng Y, Liu M, Xu Y (2013) Online interval scheduling on a single machine with finite lookahead. Comput Oper Res 40(1):180\u2013191","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-019-00381-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-019-00381-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00381-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T19:12:29Z","timestamp":1578510749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-019-00381-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,9]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["381"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00381-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2019,1,9]]},"assertion":[{"value":"9 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}