{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T09:47:07Z","timestamp":1764841627380},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,6,4]],"date-time":"2010-06-04T00:00:00Z","timestamp":1275609600000},"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":[[2010,8]]},"DOI":"10.1007\/s10951-010-0182-0","type":"journal-article","created":{"date-parts":[[2010,6,3]],"date-time":"2010-06-03T19:44:25Z","timestamp":1275594265000},"page":"443-449","source":"Crossref","is-referenced-by-count":42,"title":["Scheduling jobs under increasing linear machine maintenance time"],"prefix":"10.1007","volume":"13","author":[{"given":"Dehua","family":"Xu","sequence":"first","affiliation":[]},{"given":"Yunqiang","family":"Yin","sequence":"additional","affiliation":[]},{"given":"Hongxing","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,6,4]]},"reference":[{"key":"182_CR1","volume-title":"Computer algorithms: introduction to design and analysis","author":"S. Baase","year":"2000","unstructured":"Baase, S., & Gelder, A. V. (2000). Computer algorithms: introduction to design and analysis (3rd ed.). Massachusetts: Addison-Wesley.","edition":"3"},{"key":"182_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"E. G. Coffman Jr.","year":"1978","unstructured":"Coffman, Jr., E. G., Garey, M. R., & Johnson, D. S. (1978). An application of bin-packing to multiprocessor scheduling. SIAM Journal on Computing, 7, 1\u201317.","journal-title":"SIAM Journal on Computing"},{"key":"182_CR3","first-page":"46","volume-title":"Approximation algorithms for NP-hard problems","author":"E. G. Coffman Jr.","year":"1997","unstructured":"Coffman, Jr., E. G., Garey, M. R., & Johnson, D. S. (1997). Approximation algorithms for bin packing: a survey. In D. S. Hochbaum (Ed.), Approximation algorithms for NP-hard problems (pp. 46\u201393). Boston: PWS."},{"key":"182_CR4","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R. L. Graham","year":"1966","unstructured":"Graham, R. L. (1966). Bounds for certain multiprocessor anomalies. Bell System Technical Journal, 45, 1563\u20131581.","journal-title":"Bell System Technical Journal"},{"key":"182_CR5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. L. Graham","year":"1979","unstructured":"Graham, R. L., Lawer, E. L., Lenstra, J. K., & Rinnooy Kan,\u00a0A.\u00a0H.\u00a0G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"182_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":"182_CR7","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. Boca Raton: Chapman & Hall\/CRC (Chap.\u00a022)."},{"key":"182_CR8","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1007\/s002360050143","volume":"35","author":"E. Sanlaville","year":"1998","unstructured":"Sanlaville, E., & Schmidt, G. (1998). Machine scheduling with availability constraints. Acta Informatica, 35, 795\u2013811.","journal-title":"Acta Informatica"},{"key":"182_CR9","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 Operational Research, 121, 1\u201315.","journal-title":"European Journal of Operational Research"},{"key":"182_CR10","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1002\/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G","volume":"41","author":"D. Simchi-Levi","year":"1994","unstructured":"Simchi-Levi, D. (1994). New worst-case results for the bin packing problem. Naval Research Logistics, 41, 579\u2013585.","journal-title":"Naval Research Logistics"},{"key":"182_CR11","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1016\/j.cor.2006.08.015","volume":"35","author":"D. H. Xu","year":"2008","unstructured":"Xu, D. H., Sun, K. B., & Li, H. X. (2008). Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan. Computers & Operations Research, 35, 1344\u20131349.","journal-title":"Computers & Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0182-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0182-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0182-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:44Z","timestamp":1559468384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0182-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,4]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["182"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0182-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2010,6,4]]}}}