{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T03:58:50Z","timestamp":1777607930407,"version":"3.51.4"},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"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":[[2001,12]]},"DOI":"10.1016\/s0377-2217(00)00319-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:51:33Z","timestamp":1027601493000},"page":"394-412","source":"Crossref","is-referenced-by-count":40,"title":["A new dominance rule to minimize total weighted tardiness with unequal release dates"],"prefix":"10.1016","volume":"135","author":[{"given":"M.Selim","family":"Akturk","sequence":"first","affiliation":[]},{"given":"Deniz","family":"Ozdemir","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0377-2217(00)00319-2_BIB1","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0305-0548(97)00073-7","article-title":"A new lower bounding scheme for the total weighted tardiness problem","volume":"25","author":"Akturk","year":"1998","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(00)00319-2_BIB2","unstructured":"M.S. Akturk, D. Ozdemir, New dominance properties for 1|rj|\u2211wjTj problem, Technical Report No. 98-30, Department of Industrial Engineering, Bilkent University, Turkey, 1998"},{"issue":"1","key":"10.1016\/S0377-2217(00)00319-2_BIB3","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/nav.3800290114","article-title":"Scheduling of a single machine to minimize total weighted completion time subject to release dates","volume":"29","author":"Bianco","year":"1982","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(00)00319-2_BIB4","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 unequal release dates","volume":"39","author":"Chu","year":"1992","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(00)00319-2_BIB5","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":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(00)00319-2_BIB6","doi-asserted-by":"crossref","unstructured":"C. Chu, M.C. Portmann, Some new efficient methods to solve the n|1\u2223ri|\u2211Ti scheduling problem, European Journal of Operational Research 58 (1992) 404\u2013413","DOI":"10.1016\/0377-2217(92)90071-G"},{"issue":"3","key":"10.1016\/S0377-2217(00)00319-2_BIB7","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1287\/ijoc.10.3.341","article-title":"Local search heuristics for the single machine total weighted tardiness scheduling problem","volume":"10","author":"Crauwels","year":"1998","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(00)00319-2_BIB8","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 Journal of Computing"},{"issue":"4","key":"10.1016\/S0377-2217(00)00319-2_BIB9","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1287\/opre.17.4.701","article-title":"One machine sequencing to minimize certain functions of job tardiness","volume":"17","author":"Emmons","year":"1969","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(00)00319-2_BIB10","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1287\/opre.31.1.114","article-title":"A new dominance concept in scheduling n jobs on a single machine with ready times and due dates","volume":"31","author":"Erschler","year":"1983","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(00)00319-2_BIB11","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","article-title":"Greedy randomized adaptive search procedures","volume":"6","author":"Feo","year":"1995","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/S0377-2217(00)00319-2_BIB12","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0166-218X(83)90019-7","article-title":"An algorithm for single machine sequencing with release dates to minimize total weighted completion time","volume":"5","author":"Hariri","year":"1983","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(00)00319-2_BIB13","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0377-2217(86)90015-9","article-title":"Tactically delayed versus non-delay scheduling: An experiment investigation","volume":"24","author":"Kanet","year":"1986","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/S0377-2217(00)00319-2_BIB14","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1111\/j.1937-5956.1993.tb00035.x","article-title":"A decision theory approach to priority dispatching for job shop scheduling","volume":"2","author":"Kanet","year":"1993","journal-title":"Production and Operations Management"},{"key":"10.1016\/S0377-2217(00)00319-2_BIB15","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","article-title":"A `pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness","volume":"1","author":"Lawler","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(00)00319-2_BIB16","series-title":"Heuristic Scheduling Systems with Applications to Production Systems and Project Management","author":"Morton","year":"1993"},{"key":"10.1016\/S0377-2217(00)00319-2_BIB17","series-title":"Intelligent Scheduling Systems","article-title":"Guided forward search in tardiness scheduling of large one machine problems","author":"Morton","year":"1995"},{"key":"10.1016\/S0377-2217(00)00319-2_BIB18","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1287\/mnsc.34.7.843","article-title":"Algorithms for scheduling a single machine to minimize the weighted number of late jobs","volume":"34","author":"Potts","year":"1988","journal-title":"Management Science"},{"issue":"3","key":"10.1016\/S0377-2217(00)00319-2_BIB19","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.35.3.450","article-title":"A note on weighted tardiness problem","volume":"35","author":"Rachamadugu","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(00)00319-2_BIB20","series-title":"Machine Scheduling Problems: Classification, Complexity and Computations","author":"Rinnooy Kan","year":"1976"},{"key":"10.1016\/S0377-2217(00)00319-2_BIB21","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1287\/opre.23.5.908","article-title":"Minimizing total costs in one-machine scheduling","volume":"23","author":"Rinnooy Kan","year":"1975","journal-title":"Operations Research"},{"issue":"10","key":"10.1016\/S0377-2217(00)00319-2_BIB22","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","article-title":"New search spaces for sequencing problems with application to job shop scheduling","volume":"38","author":"Storer","year":"1992","journal-title":"Management Science"},{"issue":"4","key":"10.1016\/S0377-2217(00)00319-2_BIB23","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1287\/ijoc.7.4.453","article-title":"Local search in problem and heuristic space for job shop scheduling","volume":"7","author":"Storer","year":"1995","journal-title":"ORSA Journal on Computing"},{"issue":"5","key":"10.1016\/S0377-2217(00)00319-2_BIB24","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1287\/mnsc.39.5.626","article-title":"Weighted tardiness single machine scheduling with proportional weights","volume":"39","author":"Szwarc","year":"1993","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(00)00319-2_BIB25","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1287\/mnsc.33.8.1035","article-title":"Priority rules for job shops with weighted tardiness costs","volume":"33","author":"Vepsalainen","year":"1987","journal-title":"Management Science"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700003192?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700003192?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T10:59:06Z","timestamp":1556189946000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221700003192"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,12]]}},"alternative-id":["S0377221700003192"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(00)00319-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2001,12]]}}}