{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T04:15:48Z","timestamp":1775708148548,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2008,5,13]],"date-time":"2008-05-13T00:00:00Z","timestamp":1210636800000},"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":[[2008,10]]},"DOI":"10.1007\/s10951-008-0064-x","type":"journal-article","created":{"date-parts":[[2008,5,12]],"date-time":"2008-05-12T13:03:12Z","timestamp":1210597392000},"page":"357-370","source":"Crossref","is-referenced-by-count":81,"title":["Single machine scheduling models with deterioration and\u00a0learning: handling precedence constraints via\u00a0priority\u00a0generation"],"prefix":"10.1007","volume":"11","author":[{"given":"V. S.","family":"Gordon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. N.","family":"Potts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. A.","family":"Strusevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. D.","family":"Whitehead","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,5,13]]},"reference":[{"key":"64_CR1","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1057\/palgrave.jors.2600740","volume":"50","author":"B. Alidaee","year":"1999","unstructured":"Alidaee, B., & Womer, N. K. (1999). Scheduling with time dependent processing times: review and extensions. Journal of the Operational Research Society, 50, 711\u2013720.","journal-title":"Journal of the Operational Research Society"},{"key":"64_CR2","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0020-0190(01)00196-X","volume":"81","author":"A. Bachman","year":"2002","unstructured":"Bachman, A., Janiak, A., & Kovalyov, M. Y. (2002). Minimizing the total weighted completion time of deteriorating jobs. Information Processing Letters, 81, 81\u201384.","journal-title":"Information Processing Letters"},{"key":"64_CR3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0377-2217(98)00246-X","volume":"115","author":"D. Biskup","year":"1999","unstructured":"Biskup, D. (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115, 173\u2013178.","journal-title":"European Journal of Operational Research"},{"key":"64_CR4","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":"64_CR5","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1287\/opre.38.3.495","volume":"38","author":"S. Browne","year":"1990","unstructured":"Browne, S., & Yechiali, U. (1990). Scheduling deteriorating jobs on a single processor. Operations Research, 38, 495\u2013498.","journal-title":"Operations Research"},{"key":"64_CR6","first-page":"99","volume":"1","author":"V. Y. Burdyuk","year":"1980","unstructured":"Burdyuk, V. Y., & Reva, V. N. (1980). A\u00a0method for optimizing functions over permutations under constraints. Kibernetika (Kiev), 1, 99\u2013103 (in Russian).","journal-title":"Kibernetika (Kiev)"},{"key":"64_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(02)00909-8","volume":"152","author":"T. C. E. Cheng","year":"2004","unstructured":"Cheng, T. C. E., Ding, Q., & Lin, B. M. T. (2004). A\u00a0concise survey of scheduling with time-dependent processing times. European Journal of Operational Research, 152, 1\u201313.","journal-title":"European Journal of Operational Research"},{"key":"64_CR8","unstructured":"Cheng, T. C. E., & Kovalyov, M. Y. (1994). Scheduling with learning effects on job processing times (Working paper no.\u00a006\/94). Faculty of Business and Information Systems, The Hong Kong Polytechnic University."},{"key":"64_CR9","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1631\/jzus.2006.A0597","volume":"7","author":"M.-B. Cheng","year":"2006","unstructured":"Cheng, M.-B., & Sun, S.-L. (2006). The single-machine scheduling problems with deteriorating jobs and learning effect. Journal of Zhejiang University-Science\u00a0A, 7, 597\u2013601.","journal-title":"Journal of Zhejiang University-Science\u00a0A"},{"key":"64_CR10","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1023\/A:1018978322417","volume":"70","author":"H. A. J. Crauwels","year":"1997","unstructured":"Crauwels, H. A. J., Potts, C. N., & Van Wassenhove, L. N. (1997). Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time. Annals of Operations Research, 70, 261\u2013279.","journal-title":"Annals of Operations Research"},{"key":"64_CR11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/A:1018920416308","volume":"83","author":"H. A. J. Crauwels","year":"1998","unstructured":"Crauwels, H. A. J., Hariri, A. M. A., Potts, C. N., & Van Wassenhove, L. N. (1998). Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time. Annals of Operations Research, 83, 59\u201376.","journal-title":"Annals of Operations Research"},{"key":"64_CR12","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(95)00009-2","volume":"54","author":"S. Gawiejnowicz","year":"1995","unstructured":"Gawiejnowicz, S., & Pankovska, L. (1995). Scheduling jobs with varying processing times. Information Processing Letters, 54, 175\u2013178.","journal-title":"Information Processing Letters"},{"key":"64_CR13","first-page":"244","volume":"22","author":"V. S. Gordon","year":"1978","unstructured":"Gordon, V. S., & Shafransky, Y. M. (1978). Optimal ordering with series-parallel precedence constraints. Doklady Akademii Nauk BSSR, 22, 244\u2013247 (in\u00a0Russian).","journal-title":"Doklady Akademii Nauk BSSR"},{"key":"64_CR14","first-page":"15","volume":"13","author":"V. S. Gordon","year":"2005","unstructured":"Gordon, V. S., Proth, J.-M., & Strusevich, V. A. (2005). Single machine scheduling and due date assignment under series-parallel precedence constraints. Central European Journal of Operations Research, 13, 15\u201335.","journal-title":"Central European Journal of Operations Research"},{"key":"64_CR15","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0020-0190(93)90175-9","volume":"48","author":"K. I.-J. Ho","year":"1993","unstructured":"Ho, K. I.-J., Leung, J. Y.-T., & Wei, W.-D. (1993). Complexity of scheduling tasks with time dependent execution times. Information Processing Letters, 48, 315\u2013320.","journal-title":"Information Processing Letters"},{"key":"64_CR16","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.ejor.2004.12.012","volume":"173","author":"A. Janiak","year":"2006","unstructured":"Janiak, A., & Kovalyov, M. Y. (2006). Scheduling in a contaminated area: a model and polynomial algorithms. European Journal of Operational Research, 173, 125\u2013132.","journal-title":"European Journal of Operational Research"},{"key":"64_CR17","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":"64_CR18","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":"64_CR19","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0167-5060(08)70323-6","volume":"2","author":"E. L. 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":"64_CR20","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1287\/opre.26.4.563","volume":"26","author":"E. L. Lawler","year":"1978","unstructured":"Lawler, E. L., & Sivazlian, B. D. (1978). Minimization of time-varying costs in single-machine sequencing. Operations Research, 26, 563\u2013569.","journal-title":"Operations Research"},{"key":"64_CR21","series-title":"Handbooks in operations research and management science","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume-title":"Logistics of production and inventory","author":"E. L. Lawler","year":"1993","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1993). Sequencing and scheduling: algorithms and complexity. In S. C. Graves, A. H. G. Rinnooy, & P. H. Zipkin (Eds.), Handbooks in operations research and management science : Vol.\u00a04. Logistics of production and inventory (pp.\u00a0445\u2013522). Amsterdam: North-Holland."},{"key":"64_CR22","first-page":"405","volume":"49","author":"R. H. M\u00f6hring","year":"1985","unstructured":"M\u00f6hring, R. H., & Rademacher, F. J. (1985). Generalized results on the polynomiality of certain weighted sum scheduling problems. Methods of Operations Research, 49, 405\u2013417.","journal-title":"Methods of Operations Research"},{"key":"64_CR23","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1287\/moor.4.3.215","volume":"4","author":"C. L. 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":"64_CR24","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/moor.12.1.22","volume":"12","author":"C. L. Monma","year":"1987","unstructured":"Monma, C. L., & Sidney, J. B. (1987). Optimal sequencing via modular decomposition: characterization of sequencing functions. Mathematics of Operations Research, 12, 22\u201331.","journal-title":"Mathematics of Operations Research"},{"key":"64_CR25","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1057\/jors.1996.146","volume":"47","author":"G. Mosheiov","year":"1996","unstructured":"Mosheiov, G. (1996). \u039b-shaped policies to schedule deteriorating jobs. Journal of the Operational Research Society, 47, 1184\u20131191.","journal-title":"Journal of the Operational Research Society"},{"key":"64_CR26","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/S0377-2217(00)00175-2","volume":"132","author":"G. Mosheiov","year":"2001","unstructured":"Mosheiov, G. (2001). Scheduling problems with a learning effect. European Journal of Operational Research, 132, 687\u2013693.","journal-title":"European Journal of Operational Research"},{"key":"64_CR27","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1016\/j.mcm.2004.09.004","volume":"41","author":"G. Mosheiov","year":"2005","unstructured":"Mosheiov, G. (2005). A note on scheduling deteriorating jobs. Mathematical and Computer Modelling, 41, 883\u2013886.","journal-title":"Mathematical and Computer Modelling"},{"key":"64_CR28","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/S0020-0190(01)00244-7","volume":"81","author":"C. T. Ng","year":"2002","unstructured":"Ng, C. T., Cheng, T. C. E., Bachman, A., & Janiak, A. (2002). Three scheduling problems with deteriorating jobs to minimize the total completion time. Information Processing Letters, 81, 327\u2013333.","journal-title":"Information Processing Letters"},{"key":"64_CR29","unstructured":"Reva, V. N. (1979). On an algorithm for optimizing functions over the permutations of a partially ordered set. In Actual Problems of computers and programming (pp.\u00a092\u201395). Dnepropetrovsk (in\u00a0Russian)."},{"key":"64_CR30","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1287\/mnsc.12.5.437","volume":"12","author":"M. E. Rothkopf","year":"1966","unstructured":"Rothkopf, M. E. (1966). Scheduling independent tasks on parallel processors. Management Science, 12, 437\u2013447.","journal-title":"Management Science"},{"key":"64_CR31","first-page":"120","volume":"2","author":"Y. M. Shafransky","year":"1978","unstructured":"Shafransky, Y. M. (1978a). On optimal sequencing for deterministic systems with a tree-like partial order. Vestsi Akademii Navuk BSSR, Seria Fizika-Matematychnykh Navuk, 2, 120 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR, Seria Fizika-Matematychnykh Navuk"},{"key":"64_CR32","first-page":"119","volume":"2","author":"Y. M. Shafransky","year":"1978","unstructured":"Shafransky, Y. M. (1978b). Optimization for deterministic scheduling systems with a tree-like partial order. Vestsi Akademii Navuk BSSR, Seria Fizika-Matematychnykh Navuk, 2, 119 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR, Seria Fizika-Matematychnykh Navuk"},{"key":"64_CR33","first-page":"132","volume":"5","author":"Y. M. Shafransky","year":"1980","unstructured":"Shafransky, Y. M. (1980). On a problem of minimizing functions over a set of permutations of partially ordered elements, part\u00a0I. Vestsi Akademii Navuk BSSR, Seria Fizika-Matematychnykh Navuk, 5, 132 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR, Seria Fizika-Matematychnykh Navuk"},{"key":"64_CR34","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1287\/opre.34.4.606","volume":"34","author":"J. B. Sidney","year":"1986","unstructured":"Sidney, J. B., & Steiner, G. (1986). Optimal sequencing by modular decomposition: polynomial algorithms. Operations Research, 34, 606\u2013612.","journal-title":"Operations Research"},{"key":"64_CR35","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W. E. Smith","year":"1956","unstructured":"Smith, W. E. (1956). Various optimizers for single stage production. Naval Research Logistics Quarterly, 3, 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"key":"64_CR36","first-page":"11","volume":"9","author":"V. S. Tanaev","year":"1965","unstructured":"Tanaev, V. S. (1965). Some objective functions of a single-stage production. Doklady Akademii Nauk BSSR, 9, 11\u201314 (in Russian).","journal-title":"Doklady Akademii Nauk BSSR"},{"key":"64_CR37","volume-title":"Scheduling theory. Single-stage systems","author":"V. S. Tanaev","year":"1984","unstructured":"Tanaev, V. S., Gordon, V. S., & Shafransky, Y. M. (1984). Scheduling theory. Single-stage systems. Moscow: Nauka (in\u00a0Russian); translated into English by Kluwer Academic, Dordrecht, 1994."},{"key":"64_CR38","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1137\/0211023","volume":"11","author":"J. R. 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":"64_CR39","doi-asserted-by":"crossref","first-page":"2684","DOI":"10.1016\/j.cor.2006.12.026","volume":"35","author":"J.-B. Wang","year":"2008","unstructured":"Wang, J.-B., Ng, C. T., & Cheng, T. C. E. (2008). Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint. Computers and Operations Research, 35, 2684\u20132693.","journal-title":"Computers and Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0064-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-008-0064-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0064-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:40Z","timestamp":1559468380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-008-0064-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,13]]},"references-count":39,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["64"],"URL":"https:\/\/doi.org\/10.1007\/s10951-008-0064-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5,13]]}}}