{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:18:59Z","timestamp":1760707139758},"reference-count":24,"publisher":"Elsevier BV","issue":"13","license":[{"start":{"date-parts":[[2004,11,1]],"date-time":"2004-11-01T00:00:00Z","timestamp":1099267200000},"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":[[2004,11]]},"DOI":"10.1016\/s0305-0548(03)00172-2","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"2199-2213","source":"Crossref","is-referenced-by-count":24,"title":["A novel threshold accepting meta-heuristic for the job-shop scheduling problem"],"prefix":"10.1016","volume":"31","author":[{"given":"Dae","family":"Sung Lee","sequence":"first","affiliation":[]},{"given":"Vassilios S","family":"Vassiliadis","sequence":"additional","affiliation":[]},{"given":"Jong Moon","family":"Park","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0305-0548(03)00172-2_BIB1","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","article-title":"NP-complete scheduling problems","volume":"10","author":"Ullman","year":"1975","journal-title":"Journal of Computer and System Science"},{"issue":"2","key":"10.1016\/S0305-0548(03)00172-2_BIB2","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","article-title":"Deterministic job-shop scheduling","volume":"113","author":"Jain","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00172-2_BIB3","unstructured":"Tarantilis CD, Kiranoudis CT, Vassiliadis VS. Efficient solutions of the general heterogeneous fleet vehicle routing problem via novel threshold acceptance metaheuristics. AIChE Annual Meeting, Los Angeles, USA, 12\u201317th November, 2000."},{"issue":"25","key":"10.1016\/S0305-0548(03)00172-2_BIB4","doi-asserted-by":"crossref","first-page":"6579","DOI":"10.1021\/ie010570n","article-title":"List based threshold accepting algorithm for zero-wait scheduling multiproduct batch plants","volume":"41","author":"Lee","year":"2002","journal-title":"Industrial and Engineering Chemistry Research"},{"key":"10.1016\/S0305-0548(03)00172-2_BIB5","series-title":"Industrial scheduling","first-page":"225","article-title":"Probabilistic learning combinations of local job-shop scheduling rules","author":"Fisher","year":"1963"},{"issue":"1","key":"10.1016\/S0305-0548(03)00172-2_BIB6","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","article-title":"Job shop scheduling by simulated annealing","volume":"40","author":"Van Laarhooven","year":"1992","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/S0305-0548(03)00172-2_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0377-2217(95)00362-2","article-title":"The job-shop scheduling problem","volume":"93","author":"Blazewicz","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00172-2_BIB8","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1287\/ijoc.6.2.118","article-title":"A computational study of local search algorithms for job shop scheduling","volume":"6","author":"Aarts","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0305-0548(03)00172-2_BIB9","series-title":"Job-shop scheduling by simulated annealing combined with deterministic local search, meta-heuristics: theory and applications","author":"Yamada","year":"1996"},{"key":"10.1016\/S0305-0548(03)00172-2_BIB10","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","article-title":"Threshold accepting","volume":"90","author":"Dueck","year":"1990","journal-title":"Journal of Computational Physics"},{"key":"10.1016\/S0305-0548(03)00172-2_BIB11","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/0377-2217(95)00011-E","article-title":"A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems","volume":"83","author":"Lin","year":"1995","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/S0305-0548(03)00172-2_BIB12","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0166-218X(93)E0127-K","article-title":"Insertion techniques for the heuristic solution of the job-shop problem","volume":"58","author":"Werner","year":"1995","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"10.1016\/S0305-0548(03)00172-2_BIB13","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","article-title":"A fast taboo search algorithm for the job-shop problem","volume":"42","author":"Nowicki","year":"1996","journal-title":"Management Science"},{"issue":"3","key":"10.1016\/S0305-0548(03)00172-2_BIB14","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","article-title":"The shifting bottleneck procedure for job shop scheduling","volume":"34","author":"Adams","year":"1988","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(03)00172-2_BIB15","unstructured":"Jain AS. A multi-level hybrid framework for the deterministic job-shop scheduling problem. PhD thesis, University of Dendee, UK, 1998."},{"key":"10.1016\/S0305-0548(03)00172-2_BIB16","unstructured":"Matsuo H, Suh CJ, Sullivan RS. A controlled search simulated annealing method for the general job-shop scheduling problem. Working paper #03-04-88, Graduate School of Business, The University of Texas at Austin, Austin, TX, USA, 1988."},{"issue":"3","key":"10.1016\/S0305-0548(03)00172-2_BIB17","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1287\/ijoc.8.3.302","article-title":"Job shop scheduling by local search","volume":"8","author":"Vaessens","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0305-0548(03)00172-2_BIB18","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","article-title":"A computational study of the job-shop scheduling problem","volume":"3","author":"Applegate","year":"1991","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0305-0548(03)00172-2_BIB19","series-title":"Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement). Graduate School of Industrial Administration","author":"Lawrence","year":"1984"},{"key":"10.1016\/S0305-0548(03)00172-2_BIB20","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1080\/07408179508936739","article-title":"Solving the job shop scheduling problem using tabu search","volume":"27","author":"Barnes","year":"1995","journal-title":"IIE Transactions"},{"key":"10.1016\/S0305-0548(03)00172-2_BIB21","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0305-0548(93)E0015-L","article-title":"A genetic algorithm for the job shop problem","volume":"22","author":"Della Croce","year":"1995","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(03)00172-2_BIB22","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0305-0548(93)E0016-M","article-title":"Evolution based learning in a job shop scheduling environment","volume":"22","author":"Dorndorf","year":"1995","journal-title":"Computers and Operations Research"},{"issue":"1","key":"10.1016\/S0305-0548(03)00172-2_BIB23","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0377-2217(97)00420-7","article-title":"Some new results on simulated annealing applied to the job shop scheduling problem","volume":"113","author":"Kolonko","year":"1999","journal-title":"European Journal of Operation Research"},{"key":"10.1016\/S0305-0548(03)00172-2_BIB24","unstructured":"Dongarra JJ. Performance of various computers using standard linear equations software. Technical Report CS-89-85, Computer Science Department, University of Tennessee, Knoxville, TN, 2001."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001722?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001722?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T12:22:52Z","timestamp":1552911772000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803001722"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,11]]},"references-count":24,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2004,11]]}},"alternative-id":["S0305054803001722"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00172-2","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,11]]}}}