{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:01:43Z","timestamp":1648771303552},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,11,7]],"date-time":"2007-11-07T00:00:00Z","timestamp":1194393600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1007\/s10288-007-0061-5","type":"journal-article","created":{"date-parts":[[2007,11,6]],"date-time":"2007-11-06T07:38:49Z","timestamp":1194334729000},"page":"37-50","source":"Crossref","is-referenced-by-count":6,"title":["Single machine scheduling with forbidden start times"],"prefix":"10.1007","volume":"7","author":[{"given":"Jean-Charles","family":"Billaut","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francis","family":"Sourd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,11,7]]},"reference":[{"key":"61_CR1","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 and van de Klundert J (2005). A framework for the complexity of high- multiplicity scheduling problems. J Comb Optim 9: 313\u2013323","journal-title":"J Comb Optim"},{"key":"61_CR2","volume-title":"Computers and intractability; a guide to the theory of $$\\mathcal {NP}$$ -completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR and Johnson DS (1979). Computers and intractability; a guide to the theory of $$\\mathcal {NP}$$ -completeness. W.H. Freeman, New York"},{"issue":"1","key":"61_CR3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.dam.2004.12.003","volume":"148","author":"A Gharbi","year":"2005","unstructured":"Gharbi A and Haouari M (2005). Optimal parallel machines scheduling with availability constraints. Discrete App Math 148(1): 63\u201387","journal-title":"Discrete App Math"},{"key":"61_CR4","unstructured":"ILOG Inc (2003) ILOG Scheduler Reference Manual. October"},{"issue":"5","key":"61_CR5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0167-6377(92)90087-J","volume":"12","author":"J Keil","year":"1992","unstructured":"Keil J (1992). On the complexity of scheduling tasks with discrete starting times. Oper Res Lett 12(5): 293\u2013295","journal-title":"Oper Res Lett"},{"issue":"3\u20134","key":"61_CR6","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF00121681","volume":"9","author":"C-Y Lee","year":"1996","unstructured":"Lee C-Y (1996). Machine scheduling with an availability constraint. J Glob Optim 9(3\u20134): 395\u2013416","journal-title":"J Glob Optim"},{"issue":"2","key":"61_CR7","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/S0377-2217(97)00452-9","volume":"114","author":"C-Y Lee","year":"1999","unstructured":"Lee C-Y (1999). Two-machine flowshop scheduling with availability constraints. Eur J Oper Res 114(2): 420\u2013429","journal-title":"Eur J Oper Res"},{"key":"61_CR8","volume-title":"Handbook of scheduling: algorithms, models and performance analysis, Chap 22","author":"C-Y Lee","year":"2004","unstructured":"Lee C-Y (2004). Machine scheduling with availability constraints. In: Leung, JYT (eds) Handbook of scheduling: algorithms, models and performance analysis, Chap 22, Chapman & Hall\/CRC, Boca Raton"},{"key":"61_CR9","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10951-005-6812-2","volume":"8","author":"Maugui\u00e8re Ph","year":"2005","unstructured":"Ph Maugui\u00e8re, Billaut J-C and Bouquard J-L (2005). New single machine and job-shop scheduling problems with availability constraints. J Sched 8: 211\u2013231","journal-title":"J Sched"},{"issue":"4","key":"61_CR10","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/0196-6774(82)90030-X","volume":"3","author":"K Nakajima","year":"1982","unstructured":"Nakajima K and Hakimi SL (1982). Complexity results for scheduling tasks with discrete starting times. J Algor 3(4): 344\u2013361","journal-title":"J Algor"},{"issue":"1","key":"61_CR11","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s004530010079","volume":"3","author":"DJ Rosenkrantz","year":"2001","unstructured":"Rosenkrantz DJ, Yu L and Ravi SS (2001). Efficient construction of minimum makespan schedules for tasks with a fixed number of distinct execution times. Algorithmica 3(1): 83\u2013100","journal-title":"Algorithmica"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0061-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-007-0061-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0061-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:55Z","timestamp":1559131975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-007-0061-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,7]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["61"],"URL":"https:\/\/doi.org\/10.1007\/s10288-007-0061-5","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,7]]}}}