{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:47:29Z","timestamp":1757314049776},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,2,15]],"date-time":"2012-02-15T00:00:00Z","timestamp":1329264000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10951-012-0269-x","type":"journal-article","created":{"date-parts":[[2012,2,14]],"date-time":"2012-02-14T19:08:46Z","timestamp":1329246526000},"page":"127-139","source":"Crossref","is-referenced-by-count":18,"title":["Single machine scheduling with small operator-non-availability periods"],"prefix":"10.1007","volume":"15","author":[{"given":"Christophe","family":"Rapine","sequence":"first","affiliation":[]},{"given":"Nadia","family":"Brauner","sequence":"additional","affiliation":[]},{"given":"Gerd","family":"Finke","sequence":"additional","affiliation":[]},{"given":"Vassilissa","family":"Lebacque","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,15]]},"reference":[{"issue":"1","key":"269_CR1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10288-007-0061-5","volume":"7","author":"J.-C. 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":"269_CR2","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10288-008-0084-6","volume":"7","author":"N. Brauner","year":"2009","unstructured":"Brauner, N., Finke, G., Lehoux-Lebacque, V., Rapine, C., Kellerer, H., Potts, C., & Strusevich, V. (2009). Operator non-availability periods. 4OR, 7(3), 239\u2013253.","journal-title":"4OR"},{"key":"269_CR3","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1002\/jos.120","volume":"5","author":"P. Brucker","year":"2002","unstructured":"Brucker, P., Dhaenens-Flipo, C., Knust, S., Kravchenko, S. A., & Werner, F. (2002). Complexity results for parallel machine problems with a single server. Journal of Scheduling, 5, 429\u2013457.","journal-title":"Journal of Scheduling"},{"key":"269_CR4","first-page":"244","volume":"17","author":"R. L. Graham","year":"1969","unstructured":"Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17, 244\u2013257.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"269_CR5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0166-218X(99)00206-1","volume":"102","author":"N. G. Hall","year":"2000","unstructured":"Hall, N. G., Potts, C., & Sriskandarajah, C. (2000). Parallel machine scheduling with a common server. Discrete Applied Mathematics, 102, 223\u2013243.","journal-title":"Discrete Applied Mathematics"},{"key":"269_CR6","doi-asserted-by":"crossref","first-page":"1764","DOI":"10.1016\/j.cor.2005.05.034","volume":"34","author":"M. Ji","year":"2007","unstructured":"Ji, M., He, Y., & Cheng, T. C. E. (2007). Single-machine scheduling with periodic maintenance to minimize makespan. Computers & Operations Research, 34, 1764\u20131770.","journal-title":"Computers & Operations Research"},{"key":"269_CR7","isbn-type":"print","first-page":"21","volume-title":"Les syst\u00e8mes de production: applications interdisciplinaires et mutations","author":"V. Lebacque","year":"2007","unstructured":"Lebacque, V., Brauner, N., Celse, B., Finke, G., & Rapine, C. (2007). Planification d\u2019exp\u00e9riences dans l\u2019industrie chimique. In J.-F. Boujut, D. Llerena, & D. Brissaud (Eds.), Les syst\u00e8mes de production: applications interdisciplinaires et mutations (pp. 21\u201332). Paris: Herm\u00e8s-Lavoisier. ISBN978-2-7462-1819-2.","ISBN":"http:\/\/id.crossref.org\/isbn\/9782746218"},{"key":"269_CR8","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. Journal of Global Optimization, 9, 395\u2013416.","journal-title":"Journal of Global Optimization"},{"key":"269_CR9","first-page":"22-1","volume-title":"Handbook of scheduling: algorithms, models and performance analysis","author":"C.-Y. Lee","year":"2004","unstructured":"Lee, C.-Y. (2004). Machine scheduling with availability constraints. In J. Y.-T. Leung (Ed.), Handbook of scheduling: algorithms, models and performance analysis (pp. 22-1\u201322-13). London: Chapman & Hall\/CRC."},{"key":"269_CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/jos.75","volume":"4","author":"J. Y.-T. Leung","year":"2001","unstructured":"Leung, J. Y.-T., Dror, M., & Young, G. H. (2001). A note on an open-end bin packing problem. Journal of Scheduling, 4, 201\u2013207.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"269_CR11","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.cie.2009.04.014","volume":"58","author":"Y. Ma","year":"2010","unstructured":"Ma, Y., Chu, C., & Zuo, C. (2010). A survey of scheduling with deterministic machine availability constraints. Computers and Industrial Engineering, 58(2), 199\u2013211.","journal-title":"Computers and Industrial Engineering"},{"key":"269_CR12","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10951-005-6812-2","volume":"8","author":"P. Maugui\u00e8re","year":"2005","unstructured":"Maugui\u00e8re, P., Billaut, J.-C., & Bouquard, J.-L. (2005). New single machine and job-shop scheduling problems with availability constraints. Journal of Scheduling, 8, 211\u2013231.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"269_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(98)00367-1","volume":"121","author":"G. Schmidt","year":"2000","unstructured":"Schmidt, G. (2000). Scheduling with limited machine availability. European Journal of Operations Research, 121(1), 1\u201315.","journal-title":"European Journal of Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0269-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-012-0269-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0269-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:47Z","timestamp":1559468387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-012-0269-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,15]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["269"],"URL":"https:\/\/doi.org\/10.1007\/s10951-012-0269-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,15]]}}}