{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,29]],"date-time":"2023-01-29T02:10:15Z","timestamp":1674958215934},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,3,20]],"date-time":"2014-03-20T00:00:00Z","timestamp":1395273600000},"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":[[2014,6]]},"DOI":"10.1007\/s10288-014-0257-4","type":"journal-article","created":{"date-parts":[[2014,3,19]],"date-time":"2014-03-19T09:26:22Z","timestamp":1395221182000},"page":"101-121","source":"Crossref","is-referenced-by-count":10,"title":["On scheduling with the non-idling constraint"],"prefix":"10.1007","volume":"12","author":[{"given":"Philippe","family":"Chr\u00e9tienne","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,20]]},"reference":[{"key":"257_CR1","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/opre.31.2.381","volume":"31","author":"KR Baker","year":"1983","unstructured":"Baker KR, Lawler EL, Lenstra JK, Rinnoy Kan AHG (1983) Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints. Oper Res 31:381\u2013386","journal-title":"Oper Res"},{"key":"257_CR2","doi-asserted-by":"crossref","unstructured":"Baptiste P (2005) Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for off-line dynamic power management. Research Report, Laboratoire d\u2019Informatique CNRS LIX","DOI":"10.1145\/1109557.1109598"},{"key":"257_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24804-0","volume-title":"Scheduling algorithms","author":"P Brucker","year":"2004","unstructured":"Brucker P (2004) Scheduling algorithms. Springer, Berlin"},{"issue":"2","key":"257_CR4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/j.cie.2010.03.007","volume":"59","author":"J Carlier","year":"2010","unstructured":"Carlier J, Moukrim A, Gu\u00e9dira K (2010) Exact resolution of the ne-machine sequencing problem with no machine idle time. Comput Ind Eng 59(2):193\u2013199","journal-title":"Comput Ind Eng"},{"issue":"156","key":"257_CR5","doi-asserted-by":"crossref","first-page":"2543","DOI":"10.1016\/j.dam.2008.03.010","volume":"13","author":"P Chr\u00e9tienne","year":"2008","unstructured":"Chr\u00e9tienne P (2008) On single-machine scheduling without intermediate delays. Discret Appl Math 13(156):2543\u20132550","journal-title":"Discret Appl Math"},{"key":"257_CR6","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"EG Coffman","year":"1972","unstructured":"Coffman EG, Graham RL (1972) Optimal scheduling for two processor systems. Acta Inform 1:200\u2013213","journal-title":"Acta Inform"},{"key":"257_CR7","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","volume":"9","author":"TC Hu","year":"1961","unstructured":"Hu TC (1961) Parallel sequencing and assemble line problems. Oper Res 9:841\u2013848","journal-title":"Oper Res"},{"issue":"2","key":"257_CR8","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s10951-010-0185-x","volume":"15","author":"A Jouglet","year":"2012","unstructured":"Jouglet A (2012) Single-machine scheduling with no idle time and release dates to minimize a regular criterion. J Sched 15(2):217\u2013238","journal-title":"J Sched"},{"key":"257_CR9","doi-asserted-by":"crossref","unstructured":"Kacem I, Kellerer H (2014) Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times. Discret Appl Math 164:154\u2013160","DOI":"10.1016\/j.dam.2011.07.005"},{"key":"257_CR10","unstructured":"Landis K (1993) Group Technology and Cellular Manufacturing in the Westvaco Los Angeles VH Department. Project Report in IOM 581, School of Business, University of Southern california"},{"issue":"1","key":"257_CR11","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.26.1.22","volume":"26","author":"JK Lenstra","year":"1978","unstructured":"Lenstra JK, Rinnoy Kan AHG (1978) Complexity of scheduling under precedence constraints. Oper Res 26(1):22\u201335","journal-title":"Oper Res"},{"key":"257_CR12","volume-title":"Algorithmic problems in power management","author":"K Pruhs","year":"2005","unstructured":"Pruhs K (2005) Algorithmic problems in power management, vol 36. ACM Press, New York, USA"},{"issue":"10\u201311","key":"257_CR13","doi-asserted-by":"crossref","first-page":"1586","DOI":"10.1016\/j.dam.2013.01.019","volume":"161","author":"A Quilliot","year":"2013","unstructured":"Quilliot A, Chr\u00e9tienne P (2013) Homogeneously non-idling schedules of unit-time jobs on identical parallel machine. Discret Appl Math 161(10\u201311):1586\u20131597","journal-title":"Discret Appl Math"},{"key":"257_CR14","doi-asserted-by":"crossref","unstructured":"Quilliot A, Chr\u00e9tienne P (2013) A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machine. In: Procceedings of MISTA 2013, Gent, Belgium","DOI":"10.1016\/j.dam.2013.01.019"},{"key":"257_CR15","doi-asserted-by":"crossref","first-page":"2905","DOI":"10.1016\/j.cor.2004.04.016","volume":"32","author":"JMS Valente","year":"2005","unstructured":"Valente JMS, Alves RAFS (2005) An exact approach to early\/tardy scheduling with releases dates. Comput Oper Res 32:2905\u20132917","journal-title":"Comput Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-014-0257-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-014-0257-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-014-0257-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T08:52:50Z","timestamp":1648630370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-014-0257-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,20]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["257"],"URL":"https:\/\/doi.org\/10.1007\/s10288-014-0257-4","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,20]]}}}