{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T04:37:46Z","timestamp":1780547866223,"version":"3.54.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[1991,4]]},"DOI":"10.1007\/bf01471219","type":"journal-article","created":{"date-parts":[[2005,4,13]],"date-time":"2005-04-13T20:46:17Z","timestamp":1113425177000},"page":"63-73","source":"Crossref","is-referenced-by-count":95,"title":["Tabu search methods for a single machine scheduling problem"],"prefix":"10.1007","volume":"2","author":[{"given":"Manuel","family":"Laguna","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J. Wesley","family":"Barnes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fred W.","family":"Glover","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Barnes, J. W. and Vanston, L. K. (1981) Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs.Operations Research,29.","DOI":"10.1287\/opre.29.1.146"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01720782","volume":"11","author":"D. Werra de","year":"1989","unstructured":"de Werra, D. and Hertz, A. (1989) Tabu Search Techniques: A Tutorial and an Application to Neural Networks.OR Spectrum,11, 131?41.","journal-title":"OR Spectrum"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/05695557408974926","volume":"16","author":"S. E. Elmaghraby","year":"1974","unstructured":"Elmaghraby, S. E. and Park, S. H. (1974) Scheduling Jobs on a Number of Identical Machines.AIIE Transactions,16, 1?13.","journal-title":"AIIE Transactions"},{"key":"CR4","unstructured":"Feo, T. A. and Resende, M. G. C. A Probabilistic Heuristic for a Computationally Difficult Set Covering Problem.Technical Report Series, Graduate Program in Operations Research, The University of Texas at Austin, USA."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F. (1989) Tabu Search?Part I.ORSA Journal on Computing,1, 190?206.","journal-title":"ORSA Journal on Computing"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F. (1990) Tabu Search?Part II.ORSA Journal on Computing,2, 4?32.","journal-title":"ORSA Journal on Computing"},{"key":"CR7","volume-title":"Target Analysis","author":"F. Glover","year":"1989","unstructured":"Glover, F. and Greenberg, H. J. (1989)Target Analysis, Center for Applied Artificial Intelligence, The University of Colorado at Boulder, USA."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","volume":"29","author":"A. Hertz","year":"1987","unstructured":"Hertz, A. and de Werra, D. (1987) Using Tabu Search Techniques for Graph Coloring.Computing,29, 345?51.","journal-title":"Computing"},{"key":"CR9","series-title":"Technical Report Series, Graduate Program in Operations Research","volume-title":"Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs and Times Using Tabu Search","author":"M. Laguana","year":"1989","unstructured":"Laguana, M., Barnes, J. W. and Glover, F. (1989) Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs and Times Using Tabu Search.Technical Report Series, Graduate Program in Operations Research, The University of Texas at Austin, USA."},{"key":"CR10","unstructured":"Malek, M., Guruswamy, M., Owens, H. and Pandya, M. (1989) Serial and Parallel Search Techniques for Traveling Salesman Problem.Annals of OR: Linkages with Artificial Intelligence."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.24.4.611","volume":"24","author":"T. L. Morin","year":"1976","unstructured":"Morin, T. L. and Marsten, R. F. (1976) Branch- and Bound-Strategies for Dynamic Programming.Operations Research,24, 611?27.","journal-title":"Operations Research"},{"key":"CR12","unstructured":"Vanston, L. K. (1977) Scheduling N Jobs with Setup Charge Dependencies and Linear Delay Penalties.Report no. UT 77-2."}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01471219.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01471219\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01471219","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T19:07:18Z","timestamp":1556824038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01471219"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["BF01471219"],"URL":"https:\/\/doi.org\/10.1007\/bf01471219","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}