{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T00:21:33Z","timestamp":1771460493392,"version":"3.50.1"},"reference-count":24,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"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 &amp; Operations Research"],"published-print":{"date-parts":[[2004,3]]},"DOI":"10.1016\/s0305-0548(02)00198-3","type":"journal-article","created":{"date-parts":[[2003,2,11]],"date-time":"2003-02-11T20:10:51Z","timestamp":1044994251000},"page":"397-414","source":"Crossref","is-referenced-by-count":107,"title":["A tabu search algorithm for parallel machine total tardiness problem"],"prefix":"10.1016","volume":"31","author":[{"given":"\u00dcmit","family":"Bilge","sequence":"first","affiliation":[]},{"given":"Furkan","family":"K\u0131ra\u00e7","sequence":"additional","affiliation":[]},{"given":"M\u00fcjde","family":"Kurtulan","sequence":"additional","affiliation":[]},{"given":"Pelin","family":"Pekg\u00fcn","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0305-0548(02)00198-3_BIB1","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","article-title":"Sequencing with earliness and tardiness penalties","volume":"38","author":"Baker","year":"1990","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00198-3_BIB2","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0377-2217(89)90100-8","article-title":"Survey of scheduling research involving due date determination decisions","volume":"38","author":"Cheng","year":"1989","journal-title":"EJOR"},{"key":"10.1016\/S0305-0548(02)00198-3_BIB3","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1287\/opre.42.6.1025","article-title":"The total tardiness problem","volume":"42","author":"Koulamas","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00198-3_BIB4","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","article-title":"Minimizing total tardiness on one machine is NP-hard","volume":"15","author":"Du","year":"1990","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0305-0548(02)00198-3_BIB5","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1287\/mnsc.11.3.460","article-title":"Scheduling with deadlines and loss functions on k parallel machines","volume":"11","author":"Root","year":"1965","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(02)00198-3_BIB6","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","article-title":"A \u2018pseudopolynomial\u2019 algorithm for sequencing jobs to minimize total tardiness","volume":"1","author":"Lawler","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0305-0548(02)00198-3_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/05695557408974926","article-title":"Scheduling jobs on a number of identical machines","volume":"6","author":"Elmaghraby","year":"1974","journal-title":"AIIE Transactions"},{"issue":"4","key":"10.1016\/S0305-0548(02)00198-3_BIB8","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1016\/S0360-8352(98)00105-3","article-title":"Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness","volume":"34","author":"Dessouky","year":"1998","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0305-0548(02)00198-3_BIB9","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 Transactions"},{"key":"10.1016\/S0305-0548(02)00198-3_BIB10","doi-asserted-by":"crossref","first-page":"1208","DOI":"10.1287\/mnsc.25.12.1208","article-title":"Evaluation of a heuristic for scheduling independent jobs on parallel identical processors","volume":"25","author":"Dogramaci","year":"1979","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(02)00198-3_BIB11","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1002\/1520-6750(199106)38:3<367::AID-NAV3220380307>3.0.CO;2-I","article-title":"Heuristics for minimizing mean tardiness for m parallel machines","volume":"38","author":"Ho","year":"1991","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0305-0548(02)00198-3_BIB12","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/(SICI)1520-6750(199702)44:1<109::AID-NAV7>3.0.CO;2-E","article-title":"Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem","volume":"44","author":"Koulamas","year":"1997","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0305-0548(02)00198-3_BIB13","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","article-title":"Genetic algorithms and random keys for sequencing and optimization","volume":"6","author":"Bean","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0305-0548(02)00198-3_BIB14","series-title":"Tabu search","author":"Glover","year":"1997"},{"key":"10.1016\/S0305-0548(02)00198-3_BIB15","series-title":"Modern heuristic techniques for combinatorial problems","author":"Reeves","year":"1993"},{"key":"10.1016\/S0305-0548(02)00198-3_BIB16","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01471219","article-title":"Tabu search methods for a single machine scheduling problem","volume":"2","author":"Laguna","year":"1991","journal-title":"Journal of Intelligent Manufacturing"},{"key":"10.1016\/S0305-0548(02)00198-3_BIB17","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/S0377-2217(97)00261-0","article-title":"Performance enhancements to tabu search for the early\/tardy scheduling problem","volume":"106","author":"James","year":"1998","journal-title":"EJOR"},{"issue":"8","key":"10.1016\/S0305-0548(02)00198-3_BIB18","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1016\/0305-0548(94)90017-5","article-title":"Applying tabu search with influential diversification to multiprocessor scheduling","volume":"21","author":"H\u00fcbscher","year":"1994","journal-title":"Computers Operations Research"},{"key":"10.1016\/S0305-0548(02)00198-3_BIB19","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/S0377-2217(97)00260-9","article-title":"The flow shop with parallel machines","volume":"106","author":"Nowicki","year":"1998","journal-title":"EJOR"},{"key":"10.1016\/S0305-0548(02)00198-3_BIB20","doi-asserted-by":"crossref","unstructured":"Liaw, Ching-Fang. A tabu search algorithm for the open shop scheduling problem. Computers Operations Research 1999;26:109\u201326.","DOI":"10.1016\/S0305-0548(98)00056-2"},{"issue":"3\u20134","key":"10.1016\/S0305-0548(02)00198-3_BIB21","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1016\/S0360-8352(97)00255-6","article-title":"Search heuristics for a parallel machine scheduling problem with ready times and due dates","volume":"33","author":"Park","year":"1997","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0305-0548(02)00198-3_BIB22","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/S0305-0548(98)00090-2","article-title":"Parallel machine scheduling with earliness and tardiness penalties","volume":"26","author":"Sivrikaya-\u015eerifo\u011flu","year":"1999","journal-title":"Computers Operations Research"},{"key":"10.1016\/S0305-0548(02)00198-3_BIB23","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0305-0548(98)00051-3","article-title":"Early\/tardy scheduling with sequence dependent setups on uniform parallel machines","volume":"26","author":"Balakrishnan","year":"1999","journal-title":"Computers Operations Research"},{"key":"10.1016\/S0305-0548(02)00198-3_BIB24","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/S0377-2217(97)00279-8","article-title":"A tabu search algorithm for the optimization of telecommunication networks","volume":"106","author":"Costamagna","year":"1998","journal-title":"EJOR"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802001983?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802001983?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T12:27:39Z","timestamp":1553776059000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802001983"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S0305054802001983"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00198-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}