{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T23:08:21Z","timestamp":1723158501596},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0305-0548(01)00077-6","type":"journal-article","created":{"date-parts":[[2002,10,21]],"date-time":"2002-10-21T14:05:17Z","timestamp":1035209117000},"page":"51-62","source":"Crossref","is-referenced-by-count":30,"title":["Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine"],"prefix":"10.1016","volume":"30","author":[{"given":"T.C.E.","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Q.","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(01)00077-6_BIB1","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"},{"key":"10.1016\/S0305-0548(01)00077-6_BIB2","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\/S0305-0548(01)00077-6_BIB3","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\/S0305-0548(01)00077-6_BIB4","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"},{"key":"10.1016\/S0305-0548(01)00077-6_BIB5","unstructured":"Kononov AV. Scheduling problems with linear increasing processing times. Operations Research Proceedings 1996: Selected Papers of the Symposium on Operations Research (SOR \u201896), Braunschweig, September 3\u20136, 1996. Berlin: Springer, 1997, pp. 208\u201312."},{"key":"10.1016\/S0305-0548(01)00077-6_BIB6","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"},{"key":"10.1016\/S0305-0548(01)00077-6_BIB7","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"},{"key":"10.1016\/S0305-0548(01)00077-6_BIB8","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"},{"key":"10.1016\/S0305-0548(01)00077-6_BIB9","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"},{"key":"10.1016\/S0305-0548(01)00077-6_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"},{"key":"10.1016\/S0305-0548(01)00077-6_BIB11","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\/S0305-0548(01)00077-6_BIB12","series-title":"Scheduling theory, single-stage systems","author":"Tanaev","year":"1994"},{"key":"10.1016\/S0305-0548(01)00077-6_BIB13","series-title":"Scheduling jobs with linearly decreasing processing times. Working Paper, Faculty of Business and Information Systems","author":"Cheng","year":"1998"},{"key":"10.1016\/S0305-0548(01)00077-6_BIB14","series-title":"Computers and intractability: a Guide to the Theory of NP-completeness","author":"Garey","year":"1979"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054801000776?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054801000776?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T17:22:00Z","timestamp":1554398520000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054801000776"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0305054801000776"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(01)00077-6","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}