{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T04:59:27Z","timestamp":1778821167832,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,11,22]],"date-time":"2022-11-22T00:00:00Z","timestamp":1669075200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,22]],"date-time":"2022-11-22T00:00:00Z","timestamp":1669075200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10951-022-00766-2","type":"journal-article","created":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T08:03:49Z","timestamp":1669190629000},"page":"239-256","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2709-599X","authenticated-orcid":false,"given":"Dvir","family":"Shabtay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baruch","family":"Mor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,22]]},"reference":[{"issue":"3","key":"766_CR1","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/S0377-2217(00)00284-8","volume":"134","author":"TCE Cheng","year":"2001","unstructured":"Cheng, T. C. E., & Ding, Q. (2001). Single machine scheduling with step-deteriorating processing times. European Journal of Operational Research, 134(3), 623\u2013630.","journal-title":"European Journal of Operational Research"},{"key":"766_CR2","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1006\/jcom.1998.0473","volume":"14","author":"J-Y Cai","year":"1998","unstructured":"Cai, J.-Y., Cai, P., & Zhu, Y. (1998). On a scheduling problem of time deteriorating jobs. Journal of Complexity, 14, 190\u2013209.","journal-title":"Journal of Complexity"},{"key":"766_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106329","volume":"144","author":"TCE Cheng","year":"2020","unstructured":"Cheng, T. C. E., Kravchenko, S. A., & Lin, B. M. T. (2020). Scheduling step-deteriorating jobs to minimize the total completion time. Computers & Industrial Engineering, 144, 106329.","journal-title":"Computers & Industrial Engineering"},{"key":"766_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"R Downey","year":"1999","unstructured":"Downey, R., & Fellows, M. (1999). Parameterized complexity. Berlin: Springer."},{"key":"766_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-59362-2","volume-title":"Models and algorithms of time-dependent scheduling","author":"S Gawiejnowicz","year":"2020","unstructured":"Gawiejnowicz, S. (2020). Models and algorithms of time-dependent scheduling. Springer."},{"key":"766_CR6","first-page":"3","volume":"23","author":"S Gawiejnowicz","year":"2020","unstructured":"Gawiejnowicz, S. (2020). A review of four decades of time-dependent scheduling: Main results. New Topics, and Open Problems, Journal of Scheduling, 23, 3\u201347.","journal-title":"New Topics, and Open Problems, Journal of Scheduling"},{"key":"766_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1, 117\u2013129.","journal-title":"Mathematics of Operations Research"},{"key":"766_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"2","key":"766_CR9","first-page":"92","volume":"4","author":"P Guo","year":"2017","unstructured":"Guo, P., Cheng, W., & Wang, Y. (2017). Scheduling step-deteriorating jobs to minimise the total weighted tardiness on a single machine. International Journal of Systems Science: Operations and Logistics, 4(2), 92\u2013107.","journal-title":"International Journal of Systems Science: Operations and Logistics"},{"issue":"4","key":"766_CR10","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1137\/130925153","volume":"28","author":"N Halman","year":"2014","unstructured":"Halman, N., Klabjan, D., Li, C. L., Orlin, J., & Simchi-Levi, D. (2014). Fully polynomial time approximation schemes for stochastic dynamic programming. SIAM Journal of Discrete Mathematics, 28(4), 1725\u20131796.","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"766_CR11","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s10951-019-00616-8","volume":"23","author":"N Halman","year":"2020","unstructured":"Halman, N. (2020). A technical note: Fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times. Journal of Scheduling, 23, 643\u2013648.","journal-title":"Journal of Scheduling"},{"key":"766_CR12","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"OH Ibarra","year":"1975","unstructured":"Ibarra, O. H., & Kim, C. E. (1975). Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM, 22, 463\u2013468.","journal-title":"Journal of the ACM"},{"key":"766_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S. M. (1954). Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1, 61\u201380.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"3","key":"766_CR14","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1057\/palgrave.jors.2601693","volume":"55","author":"AAK Jeng","year":"2004","unstructured":"Jeng, A. A. K., & Lin, B. M. T. (2004). Makespan minimization in single-machine scheduling with step-deterioration of processing times. Journal of the Operational Research Society, 55(3), 247\u2013256.","journal-title":"Journal of the Operational Research Society"},{"key":"766_CR15","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1023\/A:1009626427432","volume":"3","author":"MY 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":"766_CR16","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1504\/IJPS.2012.050127","volume":"1","author":"MY Kovalyov","year":"2012","unstructured":"Kovalyov, M. Y., & Kubiak, W. (2012). A generic FPTAS for partition type optimisation problems. International Journal of Planning and Scheduling, 1, 209\u2013233.","journal-title":"International Journal of Planning and Scheduling"},{"issue":"5","key":"766_CR17","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1002\/(SICI)1520-6750(199808)45:5<511::AID-NAV5>3.0.CO;2-6","volume":"45","author":"W Kubiak","year":"1998","unstructured":"Kubiak, W., & Van de Velde, S. (1998). Scheduling deteriorating jobs to minimize makespan. Naval Research Logistics, 45(5), 511\u2013523.","journal-title":"Naval Research Logistics"},{"key":"766_CR18","doi-asserted-by":"crossref","unstructured":"Lalla-Ruiz, E., & Vo\u00df, S. (2016). Modeling the parallel machine scheduling problem with step deteriorating jobs. European Journal of Operational Research, 255(1), 21\u201333.","DOI":"10.1016\/j.ejor.2016.04.010"},{"issue":"4","key":"766_CR19","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HL Lenstra","year":"1983","unstructured":"Lenstra, H. L. (1983). Integer programming with a fixed number of variables. Mathematics of Operations Research, 8(4), 538\u2013548.","journal-title":"Mathematics of Operations Research"},{"key":"766_CR20","doi-asserted-by":"publisher","DOI":"10.1201\/9780203489802","volume-title":"Handbook of scheduling: Algorithms, models, and performance analysis","author":"JYT Leung","year":"2004","unstructured":"Leung, J. Y. T. (2004). Handbook of scheduling: Algorithms, models, and performance analysis. New York: CRC Press."},{"issue":"4","key":"766_CR21","doi-asserted-by":"publisher","first-page":"1955","DOI":"10.3934\/jimo.2018131","volume":"15","author":"C Miao","year":"2019","unstructured":"Miao, C., & Zhang, Y. (2019). Scheduling with step-deteriorating jobs to minimize the makespan. Journal of Industrial & Management Optimization, 15(4), 1955\u20131964.","journal-title":"Journal of Industrial & Management Optimization"},{"issue":"4","key":"766_CR22","first-page":"869","volume":"28","author":"G Mosheiov","year":"1995","unstructured":"Mosheiov, G. (1995). Scheduling jobs with step-deterioration. Minimizing Makespan on a Single-and Multi-Machine, Computers & Industrial Engineering, 28(4), 869\u2013879.","journal-title":"Minimizing Makespan on a Single-and Multi-Machine, Computers & Industrial Engineering"},{"key":"766_CR23","doi-asserted-by":"crossref","unstructured":"Niedermeier, R. (2006) Invitation to fixed-parameter algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford Univerity Press, Oxford.","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"766_CR24","volume-title":"Scheduling: Theory, algorithms and systems","author":"M Pinedo","year":"2008","unstructured":"Pinedo, M. (2008). Scheduling: Theory, algorithms and systems (3rd ed.). New Jersey: Prentice-Hall.","edition":"3"},{"issue":"1","key":"766_CR25","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S. (1976). Algorithms for scheduling independent tasks. Journal of the ACM, 23(1), 116\u2013127.","journal-title":"Journal of the ACM"},{"key":"766_CR26","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/(SICI)1099-1425(1998100)1:3<157::AID-JOS12>3.0.CO;2-Y","volume":"1","author":"N Shakhlevich","year":"1998","unstructured":"Shakhlevich, N., Hoogeveen, H., & Pinedo, M. (1998). Minimizing total weighted completion time in a proportionate flow shop. Journal of Scheduling, 1, 157\u2013168.","journal-title":"Journal of Scheduling"},{"key":"766_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-39574-6","volume-title":"Scheduling with time-changing effects and rate-modifying activities","author":"VA Strusevich","year":"2017","unstructured":"Strusevich, V. A., & Rustogi, K. (2017). Scheduling with time-changing effects and rate-modifying activities. Cham: Springer."},{"issue":"3","key":"766_CR28","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/0377-2217(94)90048-5","volume":"78","author":"PS Sundararaghavan","year":"1994","unstructured":"Sundararaghavan, P. S., & Kunnathur, A. S. (1994). Single machine scheduling with start time-dependent processing times: Some solvable cases. European Journal of Operational Research, 78(3), 394\u2013403.","journal-title":"European Journal of Operational Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00766-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-022-00766-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00766-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T07:19:02Z","timestamp":1747293542000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-022-00766-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,22]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["766"],"URL":"https:\/\/doi.org\/10.1007\/s10951-022-00766-2","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,22]]},"assertion":[{"value":"27 October 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}