{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T20:44:43Z","timestamp":1761252283034},"reference-count":40,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":[[1998,4]]},"DOI":"10.1016\/s0377-2217(97)00275-0","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"277-300","source":"Crossref","is-referenced-by-count":22,"title":["A tabu search approach to machine scheduling"],"prefix":"10.1016","volume":"106","author":[{"given":"Vicente","family":"Valls","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Angeles Perez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Sacramento Quintanilla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00275-0_BIB1","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\/S0377-2217(97)00275-0_BIB2","series-title":"Introduction to Sequencing and Scheduling","author":"Baker","year":"1974"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB3","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","article-title":"Sequencing with earliness and tardiness penalties: A review","volume":"38","author":"Baker","year":"1990","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB4","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1287\/opre.17.6.941","article-title":"Machine sequencing via disjunctive graphs: An implicit enumeration algorithm","volume":"17","author":"Balas","year":"1969","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB5","article-title":"Guided local search with shifting bottleneck for job shop scheduling","author":"Balas","year":"1994"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB6","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02023072","article-title":"A tabu search experience in production scheduling","volume":"41","author":"Barnes","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0166-218X(94)90204-6","article-title":"A branch and bound algorithm for the job-shop scheduling problem","volume":"49","author":"Brucker","year":"1994","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB8","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","article-title":"An algorithm for solving the job-shop problem","volume":"35","author":"Carlier","year":"1989","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB9","series-title":"Fourth International Workshop on Project Management and Scheduling","article-title":"Adjustment of heads and tails for the job-shop problem","author":"Carlier","year":"1992"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB10","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1287\/opre.29.3.511","article-title":"Preemptive scheduling of independent jobs with release and due times on open, flow and job shops","volume":"29","author":"Cho","year":"1981","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB11","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF02023075","article-title":"A tabu-search heuristic for the flexible-resource flow shop scheduling problem","volume":"41","author":"Daniels","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB12","article-title":"Optimal Algorithms for Various Classes of Multiple Resource-Constrained Project Scheduling Problems","author":"Demculemeester","year":"1993","journal-title":"Doctoral Dissertation"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB13","series-title":"A genetic algorithm for the job shop problem","author":"Della Croce","year":"1993"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB14","series-title":"Fourth International Workshop on Project Management and Scheduling","article-title":"Applying tabu-search to the job-shop scheduling problem","author":"Dell'Amico","year":"1993"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB15","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1111\/j.1468-0394.1984.tb00424.x","article-title":"ISIS \u2014 a knowledge-based system for factory scheduling","volume":"1","author":"Fox","year":"1984","journal-title":"Expert Systems"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB16","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flowshop and jobshop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB17","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1287\/mnsc.13.3.167","article-title":"Heuristics in job shop scheduling","volume":"13","author":"Gere","year":"1966","journal-title":"Managements Science"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB18","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB19","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB20","series-title":"Tabu thresholding: Improved search by nonmonotic trajectories","author":"Glover","year":"1993"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB21","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/opre.26.1.36","article-title":"Flowshop and jobshop schedules: Complexity and approximations","volume":"26","author":"Gonzalez","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB22","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1287\/mnsc.20.1.65","article-title":"Alternative formulation of the job shop problem with due dates","volume":"20","author":"Holloway","year":"1973","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB23","doi-asserted-by":"crossref","first-page":"1264","DOI":"10.1287\/mnsc.20.9.1264","article-title":"Job shop scheduling with due dates and variable processing times","volume":"20","author":"Holloway","year":"1974","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB24","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1287\/mnsc.20.3.293","article-title":"An economic evaluation of job shop dispatching rules","volume":"20","author":"Jones","year":"1973","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB25","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0377-2217(88)90250-0","article-title":"Implementation of an expert system for production scheduling","volume":"33","author":"Kerr","year":"1988","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB26","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0377-2217(88)90346-3","article-title":"Expert systems for planning and scheduling manufacturing systems","volume":"34","author":"Kusiak","year":"1988","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB27","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":"Laarhoven","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB28","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1287\/mnsc.24.4.441","article-title":"Job-shop scheduling by implicit enumeration","volume":"24","author":"Lageweg","year":"1977","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB29","series-title":"Heuristic Scheduling Systems. Wiley Series in Engineering and Technology Management","author":"Morton","year":"1993"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB30","series-title":"Industrial Scheduling","author":"Muth","year":"1963"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB31","series-title":"Proceeding of the Fourth International Conference on Genetic Algorithms","first-page":"474","article-title":"Conventional genetic algorithms for job shop problems","author":"Nakano","year":"1991"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB32","series-title":"Preprint 8\/93","article-title":"A fast taboo search algorithm for the job shop problem","author":"Nowicki","year":"1993"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB33","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0377-2217(94)90350-6","article-title":"A decision support system for the resource constrained project scheduling problem","volume":"79","author":"Nowicki","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB34","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.25.1.45","article-title":"A survey of scheduling rules","volume":"35","author":"Panwalkar","year":"1977","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB35","series-title":"Machine Scheduling Problems","author":"Rinnoy Kan","year":"1976"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB36","article-title":"Les problems d'ordonnancement avec contraintes disjonctives","author":"Roy","year":"1964"},{"issue":"4","key":"10.1016\/S0377-2217(97)00275-0_BIB37","first-page":"45","article-title":"Constructing and maintaining detailed production plans: Investigations into the development of knowledge-based factory scheduling systems","volume":"7","author":"Smith","year":"1986","journal-title":"AI Magazine"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB38","article-title":"Parallel tabu search techniques for the job shop scheduling problem","author":"Taillard","year":"1989"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB39","article-title":"A decision support system for production planning and scheduling problems","author":"Wollensak","year":"1991","journal-title":"IFORS DSS, Brujas"},{"key":"10.1016\/S0377-2217(97)00275-0_BIB40","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1111\/j.1937-5956.1992.tb00341.x","article-title":"Sequencing and batching for two classes of jobs with deadlines and setup times","volume":"1","author":"Woodrufl","year":"1992","journal-title":"Production and Operations Management"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002750?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002750?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T12:56:09Z","timestamp":1556110569000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797002750"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":40,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0377221797002750"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00275-0","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}