{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T19:32:53Z","timestamp":1775158373269,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4156,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0166-218x(00)00385-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T05:10:54Z","timestamp":1027573854000},"page":"195-209","source":"Crossref","is-referenced-by-count":95,"title":["Complexity analysis of job-shop scheduling with deteriorating jobs"],"prefix":"10.1016","volume":"117","author":[{"given":"Gur","family":"Mosheiov","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00385-1_BIB1","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":"Oper. Res."},{"key":"10.1016\/S0166-218X(00)00385-1_BIB2","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 Appl. Math."},{"key":"10.1016\/S0166-218X(00)00385-1_BIB3","unstructured":"T.C.E. Cheng, Q. Ding, A state-of-the-art survey on scheduling with time-dependent processing times, Working Paper, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, 1998."},{"key":"10.1016\/S0166-218X(00)00385-1_BIB4","series-title":"Computers and Intractability \u2014 A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(00)00385-1_BIB5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flowshop and jobshop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(00)00385-1_BIB6","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","article-title":"Open shop scheduling to minimize finish time","volume":"23","author":"Gonzalez","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0166-218X(00)00385-1_BIB7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two- and three-stage production schedules with setup times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/S0166-218X(00)00385-1_BIB8","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":"J. Algorithms"},{"key":"10.1016\/S0166-218X(00)00385-1_BIB9","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 Res. Logist."},{"key":"10.1016\/S0166-218X(00)00385-1_BIB10","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0167-5060(08)70821-5","article-title":"Computational complexity of discrete optimization problems","volume":"4","author":"Lenstra","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(00)00385-1_BIB11","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1287\/opre.39.6.979","article-title":"V-Shaped policies to schedule deteriorating jobs","volume":"39","author":"Mosheiov","year":"1991","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(00)00385-1_BIB12","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/0305-0548(94)90080-9","article-title":"Scheduling deteriorating jobs under simple linear deterioration","volume":"21","author":"Mosheiov","year":"1994","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(00)00385-1_BIB13","unstructured":"G. Mosheiov, On flow-shop scheduling with deteriorating jobs, Working Paper, The Hebrew University, Jerusalem, 1996."},{"key":"10.1016\/S0166-218X(00)00385-1_BIB14","first-page":"205","article-title":"Multi-machine scheduling with linear deterioration","volume":"36","author":"Mosheiov","year":"1998","journal-title":"INFOR"},{"key":"10.1016\/S0166-218X(00)00385-1_BIB15","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 J. Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003851?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003851?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T08:24:25Z","timestamp":1556958265000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003851"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0166218X00003851"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00385-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}