{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T07:05:40Z","timestamp":1773299140908,"version":"3.50.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"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":8539,"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":[[1990,3]]},"DOI":"10.1016\/0166-218x(90)90103-j","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"235-253","source":"Crossref","is-referenced-by-count":154,"title":["A survey of algorithms for the single machine total weighted tardiness scheduling problem"],"prefix":"10.1016","volume":"26","author":[{"given":"T.S.","family":"Abdul-Razaq","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.N.","family":"Potts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.N.","family":"Van Wassenhove","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90103-J_BIB1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1057\/jors.1988.26","article-title":"Dynamic programming state-space relaxation for single machine scheduling","volume":"39","author":"Abdul-Razaq","year":"1988","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/0166-218X(90)90103-J_BIB2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/nav.3800210114","article-title":"An experimental comparison of solution algorithms for the single-machine tardiness problem","volume":"21","author":"Baker","year":"1974","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(90)90103-J_BIB3","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.3230110207","article-title":"State-space relaxation procedures for the computation of bounds to routing problems","volume":"11","author":"Christofides","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0166-218X(90)90103-J_BIB4","first-page":"105","article-title":"The one-machine sequencing problem with delay costs","volume":"19","author":"Elmaghraby","year":"1968","journal-title":"J. Indust. Eng."},{"key":"10.1016\/0166-218X(90)90103-J_BIB5","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":"Oper. Res."},{"key":"10.1016\/0166-218X(90)90103-J_BIB6","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01580393","article-title":"A dual algorithm for the one-machine scheduling problem","volume":"11","author":"Fisher","year":"1976","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(90)90103-J_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"The Lagrangian relaxation method for solving integer programming problems","volume":"27","author":"Fisher","year":"1981","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(90)90103-J_BIB8","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1287\/opre.22.1.46","article-title":"Coordinating aggregate and detailed scheduling in the one-machine job shop I: Theory","volume":"22","author":"Gelders","year":"1974","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(90)90103-J_BIB9","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1287\/opre.23.2.312","article-title":"Coordinating aggregate and detailed scheduling in the one-machine job shop II: Computation and structure","volume":"23","author":"Gelders","year":"1975","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(90)90103-J_BIB10","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangean relaxation for integer programming","volume":"2","author":"Geoffrion","year":"1974","journal-title":"Math. Programming Stud."},{"key":"10.1016\/0166-218X(90)90103-J_BIB11","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1287\/opre.30.2.375","article-title":"On dynamic programming methods for assembly line balancing problems","volume":"30","author":"Kao","year":"1982","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(90)90103-J_BIB12","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1287\/mnsc.11.2.280","article-title":"On scheduling with deferral costs","volume":"11","author":"Lawler","year":"1964","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(90)90103-J_BIB13","series-title":"Rept. BW 106","article-title":"Efficient implementation of dynamic programming algorithms for sequencing problems","author":"Lawler","year":"1979"},{"key":"10.1016\/0166-218X(90)90103-J_BIB14","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/opre.26.1.86","article-title":"The time dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling","volume":"26","author":"Picard","year":"1978","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(90)90103-J_BIB15","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.33.2.363","article-title":"A branch and bound algorithm for the total weighted tardiness problem","volume":"33","author":"Potts","year":"1985","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(90)90103-J_BIB16","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/S0377-2217(87)80008-5","article-title":"Dynamic programming and decomposition approaches for the single machine total tardiness problem","volume":"32","author":"Potts","year":"1987","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(90)90103-J_BIB17","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":"Oper. Res."},{"key":"10.1016\/0166-218X(90)90103-J_BIB18","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1287\/mnsc.12.5.437","article-title":"Scheduling independent tasks on parallel processors","volume":"12","author":"Rothkopf","year":"1966","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(90)90103-J_BIB19","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1287\/opre.32.2.451","article-title":"There are no undiscovered priority index rules for minimizing total delay costs","volume":"32","author":"Rothkopf","year":"1984","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(90)90103-J_BIB20","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/opre.26.3.444","article-title":"Dynamic programming solution of sequencing problems with precedence constraints","volume":"26","author":"Schrage","year":"1978","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(90)90103-J_BIB21","doi-asserted-by":"crossref","first-page":"B301","DOI":"10.1287\/mnsc.18.6.B301","article-title":"On the N-job, one-machine, sequence-independent scheduling problem with tardiness penalties: A branch-and-bound solution","volume":"18","author":"Shwimer","year":"1972","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(90)90103-J_BIB22","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","article-title":"Various optimizers for single-stage production","volume":"3","author":"Smith","year":"1956","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(90)90103-J_BIB23","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1002\/nav.3800180304","article-title":"A hybrid algorithm for the one-machine sequencing problem to minimize total tardiness","volume":"18","author":"Srinivasan","year":"1971","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(90)90103-J_BIB24","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0377-2217(78)90043-7","article-title":"Four solution techniques for a general one machine scheduling problem: A comparative study","volume":"2","author":"Van Wassenhove","year":"1978","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(90)90103-J_BIB25","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1080\/05695557108974812","article-title":"An improved algorithm for scheduling independent tasks","volume":"3","author":"Wilkerson","year":"1971","journal-title":"AIIE Trans."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090103J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090103J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:56:40Z","timestamp":1555120600000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090103J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":25,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["0166218X9090103J"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90103-j","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}