{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T08:22:43Z","timestamp":1648628563303},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,3,17]],"date-time":"2016-03-17T00:00:00Z","timestamp":1458172800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10951-016-0475-z","type":"journal-article","created":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T18:33:52Z","timestamp":1458326032000},"page":"609-616","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["High-multiplicity scheduling on one machine with forbidden start and completion times"],"prefix":"10.1007","volume":"19","author":[{"given":"Micha\u00ebl","family":"Gabay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Rapine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadia","family":"Brauner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,17]]},"reference":[{"issue":"1","key":"475_CR1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10288-007-0061-5","volume":"7","author":"JC Billaut","year":"2009","unstructured":"Billaut, J. C., & Sourd, F. (2009). Single machine scheduling with forbidden start times. 4OR, 7(1), 37\u201350.","journal-title":"4OR"},{"issue":"3","key":"475_CR2","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s10878-005-1414-7","volume":"9","author":"N Brauner","year":"2005","unstructured":"Brauner, N., Crama, Y., Grigoriev, A., & Van De Klundert, J. (2005). A framework for the complexity of high-multiplicity scheduling problems. Journal of Combinatorial Optimization, 9(3), 313\u2013323.","journal-title":"Journal of Combinatorial Optimization"},{"key":"475_CR3","doi-asserted-by":"crossref","unstructured":"Brauner, N., Finke, G., Lehoux-Lebacque, V., Rapine, C., Kellerer, H., Potts, C., et al. (2009). Operator non-availability periods. 4OR, 7(3), 239\u2013253.","DOI":"10.1007\/s10288-008-0084-6"},{"key":"475_CR4","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/j.ins.2013.07.003","volume":"251","author":"Y Chen","year":"2013","unstructured":"Chen, Y., Zhang, A., & Tan, Z. (2013). Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time. Information Sciences, 251, 150\u2013163.","journal-title":"Information Sciences"},{"issue":"3","key":"475_CR5","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/PL00011403","volume":"89","author":"JJ Clifford","year":"2001","unstructured":"Clifford, J. J., & Posner, M. E. (2001). Parallel machine scheduling with high multiplicity. Mathematical Programming, 89(3), 359\u2013383.","journal-title":"Mathematical Programming"},{"key":"475_CR6","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/978-3-540-39658-1_20","volume-title":"Algorithms\u2014ESA 2003","author":"F Eisenbrand","year":"2003","unstructured":"Eisenbrand, F. (2003). Fast integer programming in fixed dimension. In G. Battista & U. Zwick (Eds.), Algorithms\u2014ESA 2003 (Vol. 2832, pp. 196\u2013207)., Lecture notes in computer science Berlin: Springer."},{"issue":"1","key":"475_CR7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10107-004-0567-y","volume":"104","author":"C Filippi","year":"2005","unstructured":"Filippi, C., & Agnetis, A. (2005). An asymptotically exact algorithm for the high-multiplicity bin packing problem. Mathematical Programming, 104(1), 21\u201337.","journal-title":"Mathematical Programming"},{"issue":"5","key":"475_CR8","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/s10951-009-0122-z","volume":"12","author":"C Filippi","year":"2009","unstructured":"Filippi, C., & Romanin-Jacur, G. (2009). Exact and approximate algorithms for high-multiplicity parallel machine scheduling. Journal of Scheduling, 12(5), 529\u2013541.","journal-title":"Journal of Scheduling"},{"issue":"4","key":"475_CR9","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1287\/opre.39.4.648","volume":"39","author":"DS Hochbaum","year":"1991","unstructured":"Hochbaum, D. S., & Shamir, R. (1991). Strongly polynomial algorithms for the high multiplicity scheduling problem. Operations Research, 39(4), 648\u2013653.","journal-title":"Operations Research"},{"issue":"4","key":"475_CR10","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra","year":"1983","unstructured":"Lenstra, H. W. (1983). Integer programming with a fixed number of variables. Mathematics of Operations Research, 8(4), 538\u2013548.","journal-title":"Mathematics of Operations Research"},{"issue":"4","key":"475_CR11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.disopt.2013.07.003","volume":"10","author":"C Rapine","year":"2013","unstructured":"Rapine, C., & Brauner, N. (2013). A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times. Discrete Optimization, 10(4), 241\u2013250.","journal-title":"Discrete Optimization"},{"issue":"2","key":"475_CR12","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10951-012-0269-x","volume":"15","author":"C Rapine","year":"2012","unstructured":"Rapine, C., Brauner, N., Finke, G., & Lebacque, V. (2012). Single machine scheduling with small operator-non-availability periods. Journal of Scheduling, 15(2), 127\u2013139.","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-016-0475-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-016-0475-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0475-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0475-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:52Z","timestamp":1559468392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-016-0475-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,17]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["475"],"URL":"https:\/\/doi.org\/10.1007\/s10951-016-0475-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,17]]}}}