{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:17:50Z","timestamp":1760707070220},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0167-6377(02)00215-8","type":"journal-article","created":{"date-parts":[[2003,2,12]],"date-time":"2003-02-12T07:54:29Z","timestamp":1045036469000},"page":"142-148","source":"Crossref","is-referenced-by-count":16,"title":["Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem"],"prefix":"10.1016","volume":"31","author":[{"given":"F.","family":"Della Croce","sequence":"first","affiliation":[]},{"given":"V.","family":"T'kindt","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(02)00215-8_BIB1","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1002\/1520-6750(199012)37:6<967::AID-NAV3220370616>3.0.CO;2-K","article-title":"Lower bounds for single-machine scheduling problems","volume":"37","author":"Ahmadi","year":"1990","journal-title":"Nav. Res. Logistics"},{"key":"10.1016\/S0167-6377(02)00215-8_BIB2","series-title":"Introduction to Sequencing and Scheduling","author":"Baker","year":"1974"},{"key":"10.1016\/S0167-6377(02)00215-8_BIB3","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1002\/(SICI)1520-6750(199608)43:5<709::AID-NAV7>3.0.CO;2-9","article-title":"Single-machine scheduling with dynamic arrivals","volume":"43","author":"Chand","year":"1996","journal-title":"Nav. Res. Logistics"},{"key":"10.1016\/S0167-6377(02)00215-8_BIB4","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/0305-0548(95)00071-2","article-title":"An iterative heuristic for the single machine dynamic total completion time scheduling problem","volume":"23","author":"Chand","year":"1996","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00215-8_BIB5","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1023\/A:1018961818782","article-title":"Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates","volume":"70","author":"Chand","year":"1997","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00215-8_BIB6","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1002\/nav.3800260315","article-title":"On n|1|F\u0304 dynamic deterministic problems","volume":"26","author":"Chandra","year":"1979","journal-title":"Nav. Res. Logistics"},{"key":"10.1016\/S0167-6377(02)00215-8_BIB7","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0167-6377(92)90092-H","article-title":"Efficient heuristics to minimize total flow time with release dates","volume":"12","author":"Chu","year":"1992","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(02)00215-8_BIB8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/1520-6750(199203)39:2<265::AID-NAV3220390209>3.0.CO;2-L","article-title":"A branch-and-bound algorithm to minimize total tardiness with different release dates","volume":"39","author":"Chu","year":"1992","journal-title":"Nav. Res. Logistics"},{"key":"10.1016\/S0167-6377(02)00215-8_BIB9","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1002\/1520-6750(199210)39:6<859::AID-NAV3220390610>3.0.CO;2-W","article-title":"A branch-and-bound algorithm to minimize total flow time with unequal release dates","volume":"39","author":"Chu","year":"1992","journal-title":"Nav. Res. Logistics"},{"key":"10.1016\/S0167-6377(02)00215-8_BIB10","doi-asserted-by":"crossref","unstructured":"F. Della Croce, V. T'kindt, A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem, J. Oper. Res. Soc. 53 (2002) 1275\u20131280.","DOI":"10.1057\/palgrave.jors.2601389"},{"key":"10.1016\/S0167-6377(02)00215-8_BIB11","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1137\/0210014","article-title":"Sequencing jobs with unequal ready times to minimize mean flow time","volume":"10","author":"Dessouky","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(02)00215-8_BIB12","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1137\/S0097539796305778","article-title":"Approximability and non approximability results for minimizing total flow time on a single machine","volume":"28","author":"Kellerer","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(02)00215-8_BIB13","unstructured":"E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan, P. Zipkin (Eds.), Handbooks in Operations Research and Management Science, Vol 4: Logistics of Production and Inventory, North-Holland, Amsterdam, 1993."},{"key":"10.1016\/S0167-6377(02)00215-8_BIB14","doi-asserted-by":"crossref","first-page":"1521","DOI":"10.1080\/00207549108948029","article-title":"Effective heuristics for the single machine sequencing problem with ready times","volume":"29","author":"Liu","year":"1991","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/S0167-6377(02)00215-8_BIB15","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/0377-2217(93)E0290-E","article-title":"Heuristics for scheduling a single machine subject to unequal job release times","volume":"80","author":"Reeves","year":"1995","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00215-8_BIB16","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1002\/nav.3800030106","article-title":"Various optimizers for single-state production","volume":"3","author":"Smith","year":"1956","journal-title":"Nav. Res. Logistics Quarterly"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702002158?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702002158?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T21:25:00Z","timestamp":1553894700000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637702002158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0167637702002158"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(02)00215-8","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}