{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:05:16Z","timestamp":1747652716668},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1007\/bf00871895","type":"journal-article","created":{"date-parts":[[2004,12,27]],"date-time":"2004-12-27T06:47:33Z","timestamp":1104130053000},"page":"159-172","source":"Crossref","is-referenced-by-count":25,"title":["Intelligent scheduling with tabu search: An application to jobs with linear delay penalties and sequence-dependent setup costs and times"],"prefix":"10.1007","volume":"3","author":[{"given":"Manuel","family":"Laguna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Wesley","family":"Barnes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/05695557408974926","volume":"16","author":"S.E. Elmaghraby","year":"1974","unstructured":"S.E. Elmaghraby and S.H. Park, ?Scheduling jobs on a number of identical machines,AIIE Trans., vol. 16, no. 1, pp. 1?13, March 1974.","journal-title":"AIIE Trans."},{"issue":"1","key":"CR2","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1287\/opre.29.1.146","volume":"29","author":"J.W. Barnes","year":"1981","unstructured":"J.W. Barnes and L.K. Vanston, ?Scheduling jobs with linear delay penalties and sequence dependent setup costs,?Operations Res., vol. 29, no. 1, pp. 146?160, January?February 1981.","journal-title":"Operations Res."},{"issue":"4","key":"CR3","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.24.4.611","volume":"24","author":"T.L. Morin","year":"1976","unstructured":"T.L. Morin and R.F. Marsten, ?Branch-and-bound strategies for dynamic programming,?Operations Res., vol. 24, no. 4, pp. 611?627, July?August 1976.","journal-title":"Operations Res."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01720782","volume":"11","author":"D. Werra de","year":"1989","unstructured":"D. de Werra and A. Hertz, ?Tabu search techniques: A tutorial and an application to neural networks,OR Spectrum, vol. 11, pp. 131?141, 1989.","journal-title":"OR Spectrum"},{"issue":"4","key":"CR5","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/inte.20.4.74","volume":"20","author":"F. Glover","year":"1990","unstructured":"F. Glover, ?Tabu search: A tutorial,?Interfaces, vol. 20, no. 4, pp. 74?94, July?August 1990.","journal-title":"Interfaces"},{"key":"CR6","volume-title":"Modern Heuristics for Combinatorial Optimization","author":"F. Glover","year":"1993","unstructured":"F. Glover and M. Laguna, ?Tabu search,? inModern Heuristics for Combinatorial Optimization, C.R. Reeves (Ed.), Blackwell Scientific Publications, Oxford, 1993."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","volume":"29","author":"A. Hertz","year":"1987","unstructured":"A. Hertz and D. de Werra, ?Using tabu search techniques for graph coloring,?Computing, vol. 29, pp. 345?351, 1987.","journal-title":"Computing"},{"key":"CR8","unstructured":"F. Glover, E. Taillard, and D. de Werra, ?A user's guide to tabu search,?Ann. Operations Res. (in press)."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"I.H. Osman, ?Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem,Ann. Operations Res. (in press).","DOI":"10.1007\/BF02023004"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"J. Chakrapani and J. Skorin-Kapov, ?Massively parallel tabu search for the quadratic assignment problem,?Ann. Operations Res. (in press).","DOI":"10.1007\/BF02022999"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0377-2217(89)90383-4","volume":"41","author":"M. Widmer","year":"1989","unstructured":"M. Widmer and A. Hertz, ?A new method for the flow sequencing problem,?Eur. J. Operations Res., vol. 41, pp. 186?193, 1989.","journal-title":"Eur. J. Operations Res."},{"key":"CR12","unstructured":"L.K. Vanston, ?A hybrid dynamic programming\/branch-and-bound algorithm to solve multiple-machine scheduling problems,? Ph.D. Dissertation, Mechanical Engineering Department, The University of Texas at Austin, 1979."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.A. Feo","year":"1989","unstructured":"T.A. Feo and M.G.C. Resende, ?A probabilistic heuristic for a computationally difficult set covering problem,?Operations Res. Lett., vol. 8, pp. 67?71, 1989.","journal-title":"Operations Res. Lett."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01471219","volume":"2","author":"M. Laguna","year":"1991","unstructured":"M. Laguna, J.W. Barnes, and F. Glover, ?Tabu search methods for a single machine scheduling problem,?J. Intell. Manufact., vol. 2, pp. 63?74, 1991.","journal-title":"J. Intell. Manufact."},{"issue":"3","key":"CR15","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0305-0483(87)90071-5","volume":"15","author":"S.K. Gupta","year":"1987","unstructured":"S.K. Gupta and J. Kyparisis, ?Single machine scheduling research,?OMEGA Int. J. Mgmt. Sci., vol. 15, no. 3, pp. 207?227, 1987.","journal-title":"OMEGA Int. J. Mgmt. Sci."}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00871895.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00871895\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00871895","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T23:26:21Z","timestamp":1556321181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00871895"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["BF00871895"],"URL":"https:\/\/doi.org\/10.1007\/bf00871895","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}