{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T06:24:07Z","timestamp":1779171847036,"version":"3.51.4"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,9,23]],"date-time":"2016-09-23T00:00:00Z","timestamp":1474588800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10951-016-0497-6","type":"journal-article","created":{"date-parts":[[2016,9,23]],"date-time":"2016-09-23T02:23:13Z","timestamp":1474597393000},"page":"583-592","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Single machine scheduling with a generalized job-dependent cumulative effect"],"prefix":"10.1007","volume":"20","author":[{"given":"Kabir","family":"Rustogi","sequence":"first","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":[[2016,9,23]]},"reference":[{"key":"497_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-41880-8","volume-title":"Multiagent scheduling. Models and algorithms","author":"A Agnetis","year":"2014","unstructured":"Agnetis, A., Billaut, J.-C., Gawiejnowicz, S., Pacciarelli, D., & Soukhal, A. (2014). Multiagent scheduling. Models and algorithms. Berlin: Springer."},{"key":"497_CR2","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":"497_CR3","doi-asserted-by":"crossref","first-page":"1218","DOI":"10.1016\/j.cor.2010.06.004","volume":"39","author":"A Dolgui","year":"2012","unstructured":"Dolgui, A., Gordon, V., & Strusevich, V. (2012). Single machine scheduling with precedence constraints and positionally dependent processing times. Computers & Operations Research, 39, 1218\u20131224.","journal-title":"Computers & Operations Research"},{"key":"497_CR4","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":"497_CR5","volume-title":"Time-dependent scheduling","author":"S Gawiejnowicz","year":"2008","unstructured":"Gawiejnowicz, S. (2008). Time-dependent scheduling. Berlin: Springer."},{"key":"497_CR6","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s10951-008-0064-x","volume":"11","author":"VS 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":"497_CR7","doi-asserted-by":"crossref","unstructured":"Huang, X., & Wang, J.-J. (2015). Machine scheduling problems with a position-dependent deterioration. Applied Mathematical Modelling, 39, 2897\u20132908.","DOI":"10.1016\/j.apm.2014.11.002"},{"key":"497_CR8","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1007\/s10951-012-0287-8","volume":"16","author":"H Kellerer","year":"2013","unstructured":"Kellerer, H., Rustogi, K., & Strusevich, V. A. (2013). Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance. Journal of Scheduling, 16, 675\u2013683.","journal-title":"Journal of Scheduling"},{"key":"497_CR9","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1142\/S0129054110007301","volume":"21","author":"H Kellerer","year":"2010","unstructured":"Kellerer, H., & Strusevich, V. A. (2010). 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":"497_CR10","doi-asserted-by":"crossref","unstructured":"Kellerer, H., & Strusevich, V. A. (2012). The symmetric quadratic knapsack problem: Approximation and scheduling applications. 4OR, 10, 111\u2013161.","DOI":"10.1007\/s10288-011-0180-x"},{"key":"497_CR11","doi-asserted-by":"crossref","unstructured":"Kellerer, H., & Strusevich, V. A. (2016). Optimizing the half-product and related quadratic Boolean functions: Approximation and scheduling applications. Annals of Operations Research, 240, 39\u201394.","DOI":"10.1007\/s10479-015-2018-y"},{"key":"497_CR12","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":"497_CR13","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":"497_CR14","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0167-5060(08)70323-6","volume":"2","author":"EL Lawler","year":"1978","unstructured":"Lawler, E. L. (1978). Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Annals of Discrete Mathematics, 2, 75\u201390.","journal-title":"Annals of Discrete Mathematics"},{"key":"497_CR15","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":"497_CR16","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1287\/moor.4.3.215","volume":"4","author":"CL Monma","year":"1979","unstructured":"Monma, C. L., & Sidney, J. B. (1979). Sequencing with series-parallel precedence constraints. Mathematics of Operations Research, 4, 215\u2013234.","journal-title":"Mathematics of Operations Research"},{"key":"497_CR17","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. (2012a). Single machine scheduling with general positional deterioration and rate-modifying maintenance. Omega, 40, 791\u2013804.","journal-title":"Omega"},{"key":"497_CR18","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/j.ejor.2012.04.037","volume":"222","author":"K Rustogi","year":"2012","unstructured":"Rustogi, K., & Strusevich, V. A. (2012b). Simple matching vs linear assignment in scheduling models with positional effects: A critical review. European Journal of Operational Research, 222, 393\u2013407.","journal-title":"European Journal of Operational Research"},{"key":"497_CR19","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.omega.2013.05.005","volume":"42","author":"K Rustogi","year":"2014","unstructured":"Rustogi, K., & Strusevich, V. A. (2014). Combining time and position dependent effects on a single machine subject to rate-modifying activities. Omega, 42, 166\u2013178.","journal-title":"Omega"},{"key":"497_CR20","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1057\/jors.2014.18","volume":"66","author":"K Rustogi","year":"2015","unstructured":"Rustogi, K., & Strusevich, V. A. (2015). Single machine scheduling with time-dependent linear deterioration and rate-modifying maintenance. Journal of Operational Research Society, 66, 500\u2013515.","journal-title":"Journal of Operational Research Society"},{"key":"497_CR21","first-page":"66","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W. E. (1956). Various optimizers for single state production. Naval Research Logistics Quarterly, 3, 66\u201369.","journal-title":"Naval Research Logistics Quarterly"},{"key":"497_CR22","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF01581240","volume":"59","author":"A Tamir","year":"1993","unstructured":"Tamir, A. (1993). A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks. Mathematical Programming, 59, 117\u2013132.","journal-title":"Mathematical Programming"},{"key":"497_CR23","unstructured":"Tanaev, V. S., Gordon, V. S., & Shafransky, Y. M. (1984). Scheduling theory. Single-stage systems. Moscow: Nauka (in Russian; translated into English by Kluwer Academic, Dordrecht, 1994)."},{"key":"497_CR24","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1137\/0211023","volume":"11","author":"JR Valdes","year":"1982","unstructured":"Valdes, J. R., Tarjan, E., & Lawler, E. L. (1982). The recognition of series-parallel digraphs. SIAM Journal on Computing, 11, 361\u2013370.","journal-title":"SIAM Journal on Computing"},{"key":"497_CR25","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.ipl.2004.12.018","volume":"94","author":"J-B Wang","year":"2005","unstructured":"Wang, J.-B., & Xia, Z.-Q. (2005). Scheduling jobs under decreasing linear deterioration. Information Processing Letters, 94, 63\u201369.","journal-title":"Information Processing Letters"},{"key":"497_CR26","doi-asserted-by":"crossref","first-page":"2416","DOI":"10.1016\/j.ins.2009.02.015","volume":"179","author":"Y Yin","year":"2009","unstructured":"Yin, Y., Xu, D., Sun, K., & Li, H. (2009). Some scheduling problems with general position-dependent and time-dependent learning effects. Information Sciences, 179, 2416\u20132425.","journal-title":"Information Sciences"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-016-0497-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0497-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0497-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,21]],"date-time":"2017-11-21T09:30:05Z","timestamp":1511256605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-016-0497-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,23]]},"references-count":26,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["497"],"URL":"https:\/\/doi.org\/10.1007\/s10951-016-0497-6","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,23]]}}}