{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T16:14:05Z","timestamp":1783095245124,"version":"3.54.6"},"reference-count":62,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0377-2217(02)00909-8","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T14:55:35Z","timestamp":1048604135000},"page":"1-13","source":"Crossref","is-referenced-by-count":572,"title":["A concise survey of scheduling with time-dependent processing times"],"prefix":"10.1016","volume":"152","author":[{"given":"T.C.E","family":"Cheng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Q","family":"Ding","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"B.M.T","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0377-2217(02)00909-8_BIB1","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0305-0548(91)90033-N","article-title":"Single machine scheduling with nonlinear cost functions","volume":"18","author":"Alidaee","year":"1991","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB2","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1057\/palgrave.jors.2600740","article-title":"Scheduling with time dependent processing times: Review and extensions","volume":"50","author":"Alidaee","year":"1999","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB3","unstructured":"Bachman, A., Janiak, A., 1997. Scheduling Jobs with Special Type of Start Time Dependent Processing Time, Report no. 34\/97, Institute of Engineering Cybernetics, Wroclaw University of Technology, Wroclaw"},{"issue":"3","key":"10.1016\/S0377-2217(02)00909-8_BIB4","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/S0377-2217(99)00310-0","article-title":"Minimizing maximum lateness under linear deterioration","volume":"126","author":"Bachman","year":"2000","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/S0377-2217(02)00909-8_BIB5","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1057\/palgrave.jors.2601359","article-title":"Scheduling start time dependent jobs to minimize the total weighted completion time","volume":"53","author":"Bachman","year":"2002","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"10.1016\/S0377-2217(02)00909-8_BIB6","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0020-0190(01)00196-X","article-title":"Minimizing the total weighted completion time of deteriorating jobs","volume":"81","author":"Bachman","year":"2002","journal-title":"Information Processing Letters"},{"issue":"1","key":"10.1016\/S0377-2217(02)00909-8_BIB7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0377-2217(98)00246-X","article-title":"Single-machine scheduling with learning considerations","volume":"115","author":"Biskup","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB8","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1287\/opre.38.3.495","article-title":"Scheduling deteriorating jobs on a single processor","volume":"38","author":"Browne","year":"1990","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB9","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1006\/jcom.1998.0473","article-title":"On a scheduling problem of time deteriorating jobs","volume":"14","author":"Cai","year":"1998","journal-title":"Journal of Complexity"},{"issue":"3","key":"10.1016\/S0377-2217(02)00909-8_BIB10","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0167-6377(94)00058-E","article-title":"A note on single-processor scheduling with time-dependent execution times","volume":"17","author":"Chen","year":"1995","journal-title":"Operations Research Letters"},{"issue":"1","key":"10.1016\/S0377-2217(02)00909-8_BIB11","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0166-218X(96)00102-3","article-title":"Parallel machine scheduling with time-dependent processing times","volume":"70","author":"Chen","year":"1996","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"10.1016\/S0377-2217(02)00909-8_BIB12","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0166-218X(97)00002-4","article-title":"Erratum: Parallel machine scheduling with time-dependent processing times","volume":"75","author":"Chen","year":"1997","journal-title":"Discrete Applied Mathematics"},{"issue":"12","key":"10.1016\/S0377-2217(02)00909-8_BIB13","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0898-1221(98)00099-6","article-title":"The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times","volume":"35","author":"Cheng","year":"1998","journal-title":"Computers and Mathematics with Applications"},{"issue":"2","key":"10.1016\/S0377-2217(02)00909-8_BIB14","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0020-0190(97)00195-6","article-title":"The complexity of single machine scheduling with release time","volume":"65","author":"Cheng","year":"1998","journal-title":"Information Processing Letters"},{"issue":"8","key":"10.1016\/S0377-2217(02)00909-8_BIB15","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1016\/S0305-0548(98)00093-8","article-title":"The time dependent machine makespan problem is strongly NP-complete","volume":"26","author":"Cheng","year":"1999","journal-title":"Computers and Operations Research"},{"issue":"9\u201310","key":"10.1016\/S0377-2217(02)00909-8_BIB16","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1007\/s002360050170","article-title":"Single machine scheduling with deadlines and increasing rates of processing times","volume":"36","author":"Cheng","year":"2000","journal-title":"Acta Informatica"},{"issue":"3","key":"10.1016\/S0377-2217(02)00909-8_BIB17","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/S0377-2217(00)00284-8","article-title":"Single machine scheduling with step-deteriorating processing times","volume":"134","author":"Cheng","year":"2001","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/S0377-2217(02)00909-8_BIB18","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0305-0548(01)00077-6","article-title":"Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine","volume":"30","author":"Cheng","year":"2003","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB19","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1023\/A:1019216726076","article-title":"Single machine scheduling with learning effect considerations","volume":"98","author":"Cheng","year":"2000","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB20","doi-asserted-by":"crossref","unstructured":"Cheng, T.C.E., Ding, Q., Kovalyov, M.Y., Bachman, A., Janiak, A., 2003. Scheduling jobs with linearly decreasing processing times. Naval Research Logistics","DOI":"10.1002\/nav.10073"},{"issue":"1\u20133","key":"10.1016\/S0377-2217(02)00909-8_BIB21","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0166-218X(96)00121-7","article-title":"A variant of the permutation flow shop model with variable processing times","volume":"76","author":"Finke","year":"1997","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB22","series-title":"Computers and Intractability\u2013\u2013A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"1","key":"10.1016\/S0377-2217(02)00909-8_BIB23","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0020-0190(96)00021-X","article-title":"A note on scheduling on a single processor with speed dependent on a number of executed jobs","volume":"57","author":"Gawiejnowicz","year":"1996","journal-title":"Information Processing Letters"},{"issue":"3","key":"10.1016\/S0377-2217(02)00909-8_BIB24","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(95)00009-2","article-title":"Scheduling jobs with varying processing times","volume":"54","author":"Gawiejnowicz","year":"1995","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB25","first-page":"79","article-title":"A greedy approach for a time-dependent scheduling problem","volume":"vol. 2328","author":"Gawiejnowicz","year":"2002"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB26","series-title":"Operations Research Proceedings","first-page":"199","article-title":"Bicriterion approach to a single machine time-dependent scheduling problem","author":"Gawiejnowicz","year":"2002"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB27","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","volume":"5","author":"Graham","year":"1976","journal-title":"Annals of Discrete Mathematics"},{"issue":"4","key":"10.1016\/S0377-2217(02)00909-8_BIB28","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0305-0483(87)90020-X","article-title":"Optimal repayment policies for multiple loans","volume":"15","author":"Gupta","year":"1987","journal-title":"OMEGA"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB29","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0360-8352(88)90041-1","article-title":"Single facility scheduling with nonlinear processing times","volume":"14","author":"Gupta","year":"1988","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB30","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0020-0190(93)90175-9","article-title":"Complexity of scheduling tasks with time dependent execution times","volume":"48","author":"Ho","year":"1993","journal-title":"Information Processing Letters"},{"issue":"4","key":"10.1016\/S0377-2217(02)00909-8_BIB31","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1016\/S0360-8352(97)00025-9","article-title":"Scheduling linearly deteriorating jobs on multiple machines","volume":"32","author":"Hsieh","year":"1997","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB32","doi-asserted-by":"crossref","unstructured":"Hsu, Y.H., Lin, B.M.T., 2002. Minimization of maximum lateness under linear deterioration (submitted)","DOI":"10.1016\/j.omega.2003.08.003"},{"issue":"2","key":"10.1016\/S0377-2217(02)00909-8_BIB33","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0377-2217(96)00129-4","article-title":"Single machine scheduling subject to deadlines and resource dependent processing times","volume":"94","author":"Janiak","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB34","unstructured":"Jeng, A.A.K., Lin, B.M.T., 2002. Makespan minimization in single-machine scheduling with step-deterioration of processing times (submitted)"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB35","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0196-6774(81)90037-7","article-title":"The NP-completeness column: An ongoing guide","volume":"4","author":"Johnson","year":"1981","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB36","doi-asserted-by":"crossref","unstructured":"Kononov, A., 1997. Scheduling problems with linear increasing processing times. In: Operations Research Proceedings 1996. Springer, Berlin, pp. 199\u2013206","DOI":"10.1007\/978-3-642-60744-8_38"},{"issue":"6","key":"10.1016\/S0377-2217(02)00909-8_BIB37","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1057\/palgrave.jors.2601117","article-title":"NP-hard cases in scheduling deteriorating jobs on dedicated machines","volume":"52","author":"Kononov","year":"2001","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"10.1016\/S0377-2217(02)00909-8_BIB38","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1023\/A:1009626427432","article-title":"A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs","volume":"3","author":"Kovalyov","year":"1998","journal-title":"Journal of Heuristics"},{"issue":"5","key":"10.1016\/S0377-2217(02)00909-8_BIB39","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1002\/(SICI)1520-6750(199808)45:5<511::AID-NAV5>3.0.CO;2-6","article-title":"Scheduling deteriorating jobs to minimize makespan","volume":"45","author":"Kubiak","year":"1998","journal-title":"Naval Research Logistics"},{"issue":"1","key":"10.1016\/S0377-2217(02)00909-8_BIB40","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/0377-2217(90)90089-T","article-title":"Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem","volume":"47","author":"Kunnathur","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB41","series-title":"Handbook of Operations Research and Management Science","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","article-title":"Sequencing and scheduling: Algorithms and complexity","volume":"Vol. 4","author":"Lawler","year":"1993"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB42","series-title":"Contributions to Operations Research","first-page":"72","article-title":"An introduction to stochastic scheduling problems","author":"Mohring","year":"1985"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB43","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1287\/opre.39.6.979","article-title":"V-shaped policies for scheduling jobs","volume":"39","author":"Mosheiov","year":"1991","journal-title":"Operations Research"},{"issue":"6","key":"10.1016\/S0377-2217(02)00909-8_BIB44","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/0305-0548(94)90080-9","article-title":"Scheduling jobs under simple linear deterioration","volume":"21","author":"Mosheiov","year":"1994","journal-title":"Computers and Operations Research"},{"issue":"4","key":"10.1016\/S0377-2217(02)00909-8_BIB45","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1016\/0360-8352(95)00006-M","article-title":"Scheduling jobs with step-deterioration: Minimizing makespan on a single and multi-machine","volume":"28","author":"Mosheiov","year":"1995","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB46","unstructured":"Mosheiov, G., 1996a. On flow shop scheduling with deteriorating jobs. Working Paper, School of Business Administration, Hebrew University, Jerusalem"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB47","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1057\/jors.1996.146","article-title":"\u2227-shaped polices to schedule deteriorating jobs","volume":"47","author":"Mosheiov","year":"1996","journal-title":"Journal of the Operation al Research Society"},{"issue":"4","key":"10.1016\/S0377-2217(02)00909-8_BIB48","first-page":"205","article-title":"Multi-machine scheduling with linear deterioration","volume":"36","author":"Mosheiov","year":"1998","journal-title":"INFOR"},{"issue":"3","key":"10.1016\/S0377-2217(02)00909-8_BIB49","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/S0377-2217(00)00175-2","article-title":"Scheduling problems with a learning effect","volume":"132","author":"Mosheiov","year":"2001","journal-title":"European Journal of Operational Research"},{"issue":"1\u20133","key":"10.1016\/S0377-2217(02)00909-8_BIB50","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0166-218X(00)00385-1","article-title":"Complexity analysis of job-shop scheduling with deteriorating jobs","volume":"117","author":"Mosheiov","year":"2002","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"10.1016\/S0377-2217(02)00909-8_BIB51","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/S0020-0190(01)00244-7","article-title":"Three scheduling problems with deteriorating jobs to minimize the total completion time","volume":"81","author":"Ng","year":"2002","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB52","series-title":"Scheduling, Theory, Algorithms and Systems","author":"Pinedo","year":"1995"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB53","series-title":"Stochastic Orders","article-title":"Stochastic scheduling","author":"Righter","year":"1994"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB54","series-title":"Machine Scheduling Problems: Classification, Complexity and Computations","author":"Rinnooy Kan","year":"1976"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB55","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1057\/jors.1989.159","article-title":"Scheduling of a two machine flow-shop with processing time linearly dependent on job waiting-time","volume":"40","author":"Sriskandarajah","year":"1989","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB56","first-page":"193","article-title":"Hierarchical control of the two processor flow-shop with state-dependent processing times: Complexity analysis and approximate algorithms","volume":"29","author":"Sriskandarajah","year":"1991","journal-title":"INFOR"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB57","unstructured":"Sundararaghavan, P.S., Kunnathur, A.S., 1990. Single machine scheduling with due dates and processing time penalties. Proceedings of the National Meeting of the Decision Sciences Institute, Louisiana, USA"},{"issue":"3","key":"10.1016\/S0377-2217(02)00909-8_BIB58","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/0377-2217(94)90048-5","article-title":"Single machine scheduling with start time-dependent processing times: Some solvable cases","volume":"78","author":"Sundararaghavan","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB59","series-title":"Scheduling Theory, Single-stage Systems","author":"Tanaev","year":"1994"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB60","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1002\/1520-6750(199308)40:5<697::AID-NAV3220400511>3.0.CO;2-V","article-title":"The two-machine permutation flow shop with state-dependent processing times","volume":"40","author":"Wagneur","year":"1993","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(02)00909-8_BIB61","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF01439161","article-title":"Optimal control of a class of DEDS: Flow-shops with state-dependent processing times","volume":"3","author":"Wagneur","year":"1993","journal-title":"Discrete Event Dynamic Systems: Theory Applications"},{"issue":"3","key":"10.1016\/S0377-2217(02)00909-8_BIB62","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0020-0190(95)00011-Z","article-title":"Scheduling with time-dependent execution times","volume":"54","author":"Woeginger","year":"1995","journal-title":"Information Processing Letters"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702009098?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702009098?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T05:21:42Z","timestamp":1584508902000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702009098"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":62,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0377221702009098"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00909-8","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}