{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T13:37:16Z","timestamp":1778852236166,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,9,12]],"date-time":"2012-09-12T00:00:00Z","timestamp":1347408000000},"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":[[2013,12]]},"DOI":"10.1007\/s10951-012-0287-8","type":"journal-article","created":{"date-parts":[[2012,9,11]],"date-time":"2012-09-11T22:48:11Z","timestamp":1347403691000},"page":"675-683","source":"Crossref","is-referenced-by-count":16,"title":["Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance"],"prefix":"10.1007","volume":"16","author":[{"given":"Hans","family":"Kellerer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kabir","family":"Rustogi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly A.","family":"Strusevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,12]]},"reference":[{"key":"287_CR1","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1287\/moor.23.3.649","volume":"33","author":"T. Badics","year":"1998","unstructured":"Badics, T., & Boros, E. (1998). Minimization of Half-Products. Mathematics of Operations Research, 33, 649\u2013660.","journal-title":"Mathematics of Operations Research"},{"key":"287_CR2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ejor.2007.05.040","volume":"188","author":"D. Biskup","year":"2008","unstructured":"Biskup, D. (2008). A state-of-the-art review on scheduling with learning effects. European Journal of Operational Research, 188, 315\u2013329.","journal-title":"European Journal of Operational Research"},{"key":"287_CR3","doi-asserted-by":"crossref","first-page":"3046","DOI":"10.1016\/j.dam.2008.01.018","volume":"156","author":"E. Erel","year":"2008","unstructured":"Erel, E., & Ghosh, J. B. (2008). FPTAS for Half-Products minimization with scheduling applications. Discrete Applied Mathematics, 156, 3046\u20133056.","journal-title":"Discrete Applied Mathematics"},{"key":"287_CR4","volume-title":"Time-dependent scheduling","author":"S. Gawiejnowicz","year":"2008","unstructured":"Gawiejnowicz, S. (2008). Time-dependent scheduling. Berlin: Springer."},{"key":"287_CR5","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s10951-008-0064-x","volume":"11","author":"V. S. Gordon","year":"2008","unstructured":"Gordon, V. S., Potts, C. N., Strusevich, V. A., & Whitehead, J. D. (2008). Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation. Journal of Scheduling, 11, 357\u2013370.","journal-title":"Journal of Scheduling"},{"key":"287_CR6","first-page":"269","volume":"69","author":"D. S. Hochbaum","year":"1995","unstructured":"Hochbaum, D. S., & Hong, S.-P. (1995). About strongly polynomial time algorithms for quadratic optimization over submodular constraints. Mathematical Programming, 69, 269\u2013309.","journal-title":"Mathematical Programming"},{"key":"287_CR7","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0166-218X(96)00040-6","volume":"72","author":"B. Jurisch","year":"1997","unstructured":"Jurisch, B., Kubiak, W., & J\u00f3zefowska, J. (1997). Algorithms for minclique scheduling problems. Discrete Applied Mathematics, 72, 115\u2013139.","journal-title":"Discrete Applied Mathematics"},{"key":"287_CR8","first-page":"159","volume-title":"Handbook of combinatorial optimization","author":"N. Katoh","year":"1998","unstructured":"Katoh, N., & Ibaraki, T. (1998). Resource allocation problems. In D.-Z. Du & P. M. Pardalos (Eds.), Handbook of combinatorial optimization (Vol.\u00a02, pp. 159\u2013260). Dordrecht: Kluwer."},{"key":"287_CR9","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1007\/s00453-008-9248-1","volume":"57","author":"H. Kellerer","year":"2010","unstructured":"Kellerer, H., & Strusevich, V. A. (2010a). Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica, 57, 769\u2013795.","journal-title":"Algorithmica"},{"key":"287_CR10","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1142\/S0129054110007301","volume":"21","author":"H. Kellerer","year":"2010","unstructured":"Kellerer, H., & Strusevich, V. A. (2010b). Minimizing total weighted earliness-tardiness on a single machine around a small common due date: An FPTAS using quadratic knapsack. International Journal of Foundations of Computer Science, 21, 357\u2013383.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"287_CR11","first-page":"111","volume":"10","author":"H. Kellerer","year":"2012","unstructured":"Kellerer, H., & Strusevich, V. A. (2012). The symmetric quadratic knapsack problem: approximation and scheduling applications. 4QR, 10, 111\u2013161.","journal-title":"4QR"},{"key":"287_CR12","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/S0022-0000(03)00006-0","volume":"66","author":"H. Kellerer","year":"2003","unstructured":"Kellerer, H., Mansini, R., Pferschy, U., & Speranza, M. G. (2003). An efficient fully polynomial approximation scheme for the Subset-Sum Problem. Journal of Computer and System Sciences, 66, 349\u2013370.","journal-title":"Journal of Computer and System Sciences"},{"key":"287_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., & Pisinger, D. (2004). Knapsack problems. Berlin: Springer."},{"key":"287_CR14","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/j.ejor.2006.01.030","volume":"178","author":"C. Koulamas","year":"2007","unstructured":"Koulamas, C., & Kyparisis, G. J. (2007). Single-machine and two-machine flowshop scheduling with general learning functions. European Journal of Operational Research, 178, 402\u2013407.","journal-title":"European Journal of Operational Research"},{"key":"287_CR15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1023\/A:1009626427432","volume":"3","author":"M. Y. Kovalyov","year":"1998","unstructured":"Kovalyov, M. Y., & Kubiak, W. (1998). A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs. Journal of Heuristics, 3, 287\u2013297.","journal-title":"Journal of Heuristics"},{"key":"287_CR16","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(93)E0125-I","volume":"58","author":"W. Kubiak","year":"1995","unstructured":"Kubiak, W. (1995). New results on the completion time variance minimization. Discrete Applied Mathematics, 58, 157\u2013168.","journal-title":"Discrete Applied Mathematics"},{"key":"287_CR17","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10288-005-0070-1","volume":"3","author":"M. A. Kubzin","year":"2005","unstructured":"Kubzin, M. A., & Strusevich, V. A. (2005). Two-machine flow shop no-wait scheduling with machine maintenance. 4OR, 3, 303\u2013313.","journal-title":"4OR"},{"key":"287_CR18","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/opre.1060.0301","volume":"54","author":"M. A. Kubzin","year":"2006","unstructured":"Kubzin, M. A., & Strusevich, V. A. (2006). Planning machine maintenance in two-machine shop scheduling. Operations Research, 54, 789\u2013800.","journal-title":"Operations Research"},{"key":"287_CR19","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.ipl.2005.09.007","volume":"97","author":"W.-H. Kuo","year":"2006","unstructured":"Kuo, W.-H., & Yang, D.-L. (2006a). Minimizing the makespan in a single machine scheduling problem with a time-based learning effect. Information Processing Letters, 97, 64\u201367.","journal-title":"Information Processing Letters"},{"key":"287_CR20","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1016\/j.ejor.2005.03.020","volume":"174","author":"W.-H. Kuo","year":"2006","unstructured":"Kuo, W.-H., & Yang, D.-L. (2006b). Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect. European Journal of Operational Research, 174, 1184\u20131190.","journal-title":"European Journal of Operational Research"},{"key":"287_CR21","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1057\/palgrave.jors.2602363","volume":"59","author":"W.-H. Kuo","year":"2008","unstructured":"Kuo, W.-H., & Yang, D.-L. (2008). Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect. Journal of the Operational Research Society, 59, 416\u2013420.","journal-title":"Journal of the Operational Research Society"},{"key":"287_CR22","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0377-2217(99)00066-1","volume":"128","author":"C.-Y. Lee","year":"2001","unstructured":"Lee, C.-Y., & Leon, V. J. (2001). Machine scheduling with a rate-modifying activity. European Journal of Operational Research, 128, 119\u2013128.","journal-title":"European Journal of Operational Research"},{"key":"287_CR23","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1016\/j.ejor.2009.03.027","volume":"201","author":"E. J. Lodree Jr.","year":"2010","unstructured":"Lodree, E. J. Jr., & Geiger, C. D. (2010). A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration. European Journal of Operational Research, 201, 644\u2013648.","journal-title":"European Journal of Operational Research"},{"key":"287_CR24","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1057\/jors.2009.5","volume":"61","author":"G. Mosheiov","year":"2010","unstructured":"Mosheiov, G., & Sidney, J. B. (2010). Scheduling a deteriorating maintenance activity on a single machine. Journal of the Operational Research Society, 61, 882\u2013887.","journal-title":"Journal of the Operational Research Society"},{"key":"287_CR25","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1016\/j.omega.2011.12.007","volume":"40","author":"K. Rustogi","year":"2012","unstructured":"Rustogi, K., & Strusevich, V. A. (2012). Single machine scheduling with general positional deterioration and rate-modifying maintenance. Omega, 40, 791\u2013804.","journal-title":"Omega"},{"key":"287_CR26","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1016\/j.cie.2011.01.016","volume":"60","author":"C.-C. Wu","year":"2011","unstructured":"Wu, C.-C., Yin, Y., & Cheng, S.-R. (2011). Some single-machine scheduling problems with a truncation learning effect. Computers & Industrial Engineering, 60, 790\u2013795.","journal-title":"Computers & Industrial Engineering"},{"key":"287_CR27","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/j.omega.2010.01.003","volume":"38","author":"S.-J. Yang","year":"2010","unstructured":"Yang, S.-J., & Yang, D.-L. (2010). Minimizing the makespan single-machine scheduling with aging effects and variable maintenance activities. Omega, 38, 528\u2013533.","journal-title":"Omega"},{"key":"287_CR28","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1016\/j.apm.2009.07.002","volume":"34","author":"C.-L. Zhao","year":"2010","unstructured":"Zhao, C.-L., & Tang, H.-Y. (2010). Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan. Applied Mathematical Modelling, 34, 837\u2013841.","journal-title":"Applied Mathematical Modelling"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0287-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-012-0287-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0287-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:47Z","timestamp":1559453987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-012-0287-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,12]]},"references-count":28,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["287"],"URL":"https:\/\/doi.org\/10.1007\/s10951-012-0287-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,12]]}}}