{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:21:51Z","timestamp":1725740511535},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401039"},{"type":"electronic","value":"9783642401046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40104-6_15","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T05:36:30Z","timestamp":1373520990000},"page":"170-181","source":"Crossref","is-referenced-by-count":5,"title":["Interval Selection with Machine-Dependent Intervals"],"prefix":"10.1007","author":[{"given":"Kate\u0159ina","family":"B\u00f6hmov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yann","family":"Disser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mat\u00fa\u0161","family":"Mihal\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(87)90037-0","volume":"18","author":"E.M. Arkin","year":"1987","unstructured":"Arkin, E.M., Silverberg, E.B.: Scheduling jobs with fixed start and end times. Discrete Applied Mathematics\u00a018(1), 1\u20138 (1987)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"15_CR2","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1137\/S0097539799354138","volume":"31","author":"A. Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Approximating the throughput of multiple machines in real-time scheduling. SIAM J. Comput.\u00a031(2), 331\u2013352 (2001)","journal-title":"SIAM J. Comput."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"B\u00f6hmov\u00e1, K., Disser, Y., Mihal\u00e1k, M., Widmayer, P.: Interval selection with machine-dependent intervals. Tech. Rep. 786, Institute of Theoretical Computer Science, ETH Zurich (2013)","DOI":"10.1007\/978-3-642-40104-6_15"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF00121680","volume":"9","author":"K.I. Bouzina","year":"1996","unstructured":"Bouzina, K.I., Emmons, H.: Interval scheduling on identical machines. Journal of Global Optimization\u00a09, 379\u2013393 (1996)","journal-title":"Journal of Global Optimization"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Ostrovsky, R., Rabani, Y.: Approximation algorithms for the job interval selection problem and related scheduling problems. In: Proc. of the 42nd IEEE Symp. on Foundations of Computer Science (FOCS), pp. 348\u2013356 (2001)","DOI":"10.1109\/SFCS.2001.959909"},{"issue":"1","key":"15_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.C.R.: Interval selection: applications, algorithms, and lower bounds. Journal of Algorithms\u00a046(1), 27\u201353 (2003)","journal-title":"Journal of Algorithms"},{"key":"15_CR7","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"5","key":"15_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0167-6377(92)90087-J","volume":"12","author":"J.M. Keil","year":"1992","unstructured":"Keil, J.M.: On the complexity of scheduling tasks with discrete starting times. Operations Research Letters\u00a012(5), 293\u2013295 (1992)","journal-title":"Operations Research Letters"},{"issue":"5","key":"15_CR9","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1002\/nav.20231","volume":"54","author":"A.W.J. Kolen","year":"2007","unstructured":"Kolen, A.W.J., Lenstra, J.K., Papadimitriou, C.H., Spieksma, F.C.R.: Interval scheduling: a survey. Naval Research Logistics (NRL)\u00a054(5), 530\u2013543 (2007)","journal-title":"Naval Research Logistics (NRL)"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/BF01456961","volume":"77","author":"D. K\u00f6nig","year":"1916","unstructured":"K\u00f6nig, D.: \u00dcber Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Mathematische Annalen\u00a077, 453\u2013465 (1916)","journal-title":"Mathematische Annalen"},{"issue":"4","key":"15_CR11","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/0196-6774(82)90030-X","volume":"3","author":"K. Nakajima","year":"1982","unstructured":"Nakajima, K., Hakimi, S.L.: Complexity results for scheduling tasks with discrete starting times. Journal of Algorithms\u00a03(4), 344\u2013361 (1982)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0190(97)00223-8","volume":"65","author":"V. Raman","year":"1998","unstructured":"Raman, V., Ravikumar, B., Rao, S.S.: A simplified NP-complete MAXSAT problem. Information Processing Letters\u00a065(1), 1\u20136 (1998)","journal-title":"Information Processing Letters"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-33090-2_2","volume-title":"Algorithms \u2013 ESA 2012","author":"J. Sgall","year":"2012","unstructured":"Sgall, J.: Open problems in throughput scheduling. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol.\u00a07501, pp. 2\u201311. Springer, Heidelberg (2012)"},{"key":"15_CR14","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-1-4614-1123-9_1","volume-title":"Just-in-Time Systems","author":"D. Shabtay","year":"2012","unstructured":"Shabtay, D., Steiner, G.: Scheduling to maximize the number of just-in-time jobs: a survey. In: Just-in-Time Systems. Springer Optimization and Its Applications, vol.\u00a060, pp. 3\u201320. Springer, New York (2012)"},{"issue":"5","key":"15_CR15","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<215::AID-JOS27>3.0.CO;2-Y","volume":"2","author":"F.C.R. Spieksma","year":"1999","unstructured":"Spieksma, F.C.R.: On the approximability of an interval scheduling problem. Journal of Scheduling\u00a02(5), 215\u2013227 (1999)","journal-title":"Journal of Scheduling"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10951-005-2863-7","volume":"8","author":"S.C. Sung","year":"2005","unstructured":"Sung, S.C., Vlach, M.: Maximizing weighted number of just-in-time jobs on unrelated parallel machines. Journal of Scheduling\u00a08, 453\u2013460 (2005)","journal-title":"Journal of Scheduling"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40104-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T18:44:48Z","timestamp":1557945888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40104-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401039","9783642401046"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40104-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}