{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T15:44:06Z","timestamp":1770479046656,"version":"3.49.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1007\/bf02023075","type":"journal-article","created":{"date-parts":[[2005,8,12]],"date-time":"2005-08-12T12:47:48Z","timestamp":1123850868000},"page":"207-230","source":"Crossref","is-referenced-by-count":24,"title":["A tabu-search heuristic for the flexible-resource flow shop scheduling problem"],"prefix":"10.1007","volume":"41","author":[{"given":"Richard L.","family":"Daniels","sequence":"first","affiliation":[]},{"given":"Joseph B.","family":"Mazzola","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02023075_CR1","volume-title":"Introduction to Sequencing and Scheduling","author":"K.R. Baker","year":"1974","unstructured":"K.R. Baker,Introduction to Sequencing and Scheduling (Wiley, New York, 1974)."},{"key":"BF02023075_CR2","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1287\/opre.23.1.62","volume":"23","author":"K.R. Baker","year":"1975","unstructured":"K.R. Baker, A comparative study of flow shop algorithms, Oper. Res. 23(1975)62\u201373.","journal-title":"Oper. Res."},{"key":"BF02023075_CR3","unstructured":"J.W. Barnes and M. Laguna, Solving the multiple-machine weighted flow time problem using tabu search, IIE Trans., forthcoming."},{"key":"BF02023075_CR4","unstructured":"J.W. Barnes and M. Laguna, A tabu search experience in production scheduling, Working Paper, University of Colorado (1992)."},{"key":"BF02023075_CR5","volume-title":"Theory of Scheduling","author":"R.W. Conway","year":"1967","unstructured":"R.W. Conway, W.L. Maxwell and L.W. Miller,Theory of Scheduling (Addison-Wesley, Reading, MA, 1967)."},{"key":"BF02023075_CR6","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/0377-2217(90)90376-M","volume":"48","author":"R.L. Daniels","year":"1990","unstructured":"R.L. Daniels, A multi-objective approach to resource allocation in single machine scheduling, Euro. J. Oper. Res. 48(1990)226\u2013241.","journal-title":"Euro. J. Oper. Res."},{"key":"BF02023075_CR7","unstructured":"R.L. Daniels and J.B. Mazzola, Flow shop scheduling with flexible resources, Working Paper, Fuqua School of Business, Duke University (1991)."},{"key":"BF02023075_CR8","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1287\/opre.37.6.981","volume":"37","author":"R.L. Daniels","year":"1989","unstructured":"R.L. Daniels and R.K. Sarin, Single machine scheduling with controllable processing times and number of jobs tardy, Oper. Res. 37(1989)981\u2013984.","journal-title":"Oper. Res."},{"key":"BF02023075_CR9","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1287\/mnsc.23.11.1174","volume":"23","author":"D.G. Dannenbring","year":"1977","unstructured":"D.G. Dannenbring, An evaluation of flow shop sequencing heuristics, Manag. Sci. 23(1977)1174\u20131182.","journal-title":"Manag. Sci."},{"key":"BF02023075_CR10","series-title":"Working Paper","volume-title":"Applying tabu-search to the job-shop scheduling problem","author":"M. Dell'Amico","year":"1991","unstructured":"M. Dell'Amico and M. Trubian, Applying tabu-search to the job-shop scheduling problem, Working Paper, Politecnico de Milano, Italy (1991)."},{"key":"BF02023075_CR11","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0377-2217(89)90276-2","volume":"40","author":"A.M. Frieze","year":"1989","unstructured":"A.M. Frieze and J. Yadegar, A new integer programming formulation for the permutation flowshop problem, Euro. J. Oper. Res. 40(1989)90\u201398.","journal-title":"Euro. J. Oper. Res."},{"key":"BF02023075_CR12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"M.R. Garey, D.S. Johnson and R. Sethi, The complexity of flowshop and jobshop scheduling, Math. Oper. Res. 1(1976)117\u2013129.","journal-title":"Math. Oper. Res."},{"key":"BF02023075_CR13","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"F. Glover, Tabu search \u2014 Part I, ORSA J. Comput. 1(1989)190\u2013206.","journal-title":"ORSA J. Comput."},{"key":"BF02023075_CR14","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"F. Glover, Tabu search \u2014 Part II, ORSA J. Comput. 2(1990)4\u201332.","journal-title":"ORSA J. Comput."},{"key":"BF02023075_CR15","unstructured":"F. Glover, E. Taillard and D. de Werra, A user's guide to tabu search, Working Paper, University of Colorado (1991)."},{"key":"BF02023075_CR16","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/0377-2217(93)90175-M","volume":"64","author":"S.R. Lawrence","year":"1993","unstructured":"S.R. Lawrence and T.E. Morton, Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics, Euro. J. Oper. Res. 64(1993)168\u2013187.","journal-title":"Euro. J. Oper. Res."},{"key":"BF02023075_CR17","volume-title":"Sequencing by Enumerative Methods","author":"J.K. Lenstra","year":"1979","unstructured":"J.K. Lenstra,Sequencing by Enumerative Methods (Mathematisch Centrum, Amsterdam, 1979)."},{"key":"BF02023075_CR18","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M. Nawaz","year":"1983","unstructured":"M. Nawaz, E.E. Enscore and I. Ham, A heuristic algorithm for them-machine,n-job flow shop sequencing problem, OMEGA 11(1983)91\u201395.","journal-title":"OMEGA"},{"key":"BF02023075_CR19","doi-asserted-by":"crossref","unstructured":"I.H. Osman, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Ann. Oper. Res. (1993), this volume.","DOI":"10.1007\/BF02023004"},{"key":"BF02023075_CR20","unstructured":"J. Skorin-Kapov and A.J. Vakharia, Scheduling a flow-line manufacturing cell: A tabu search approach, Working Paper, SUNY Stony Brook (1992)."},{"key":"BF02023075_CR21","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0377-2217(81)90348-9","volume":"7","author":"R. Slowinski","year":"1981","unstructured":"R. Slowinski, Multiobjective network scheduling with efficient use of renewable and non-renewable resources, Euro. J. Oper. Res. 7(1981)265\u2013273.","journal-title":"Euro. J. Oper. Res."},{"key":"BF02023075_CR22","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","volume":"47","author":"E. Taillard","year":"1990","unstructured":"E. Taillard, Some efficient heuristic methods for the flow shop sequencing problem, Euro. J. Oper. Res. 47(1990)65\u201374.","journal-title":"Euro. J. Oper. Res."},{"key":"BF02023075_CR23","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1287\/mnsc.28.10.1197","volume":"28","author":"F.B. Talbot","year":"1982","unstructured":"F.B. Talbot, Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case, Manag, Sci. 28(1982)1197\u20131210.","journal-title":"Manag, Sci."},{"key":"BF02023075_CR24","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/S0377-2217(82)80008-8","volume":"11","author":"L.N. Wassenhove Van","year":"1982","unstructured":"L.N. Van Wassenhove and K.R. Baker, A bicriterion approach to time cost trade-offs in sequencing, Euro. J. Oper. Res. 11(1982)48\u201354.","journal-title":"Euro. J. Oper. Res."},{"key":"BF02023075_CR25","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1080\/05695558008974515","volume":"12","author":"R.G. Vickson","year":"1980","unstructured":"R.G. Vickson, Two single-machine sequencing problems involving controllable job processing times, AIEE Trans. 12(1980)258\u2013262.","journal-title":"AIEE Trans."},{"key":"BF02023075_CR26","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1287\/opre.28.5.1155","volume":"28","author":"R.G. Vickson","year":"1980","unstructured":"R.G. Vickson, Choosing the job sequence and processing times to minimize processing plus flow cost on a single machine, Oper. Res. 28(1980)1155\u20131167.","journal-title":"Oper. Res."},{"key":"BF02023075_CR27","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1145\/355744.355755","volume":"3","author":"J. Weglarz","year":"1977","unstructured":"J. Weglarz, J. Blasewicz, J. Cellary and R. Slowinski, An automatic revised simplex method for constrained resource network scheduling, ACM Trans. Math. Software 3(1977)295\u2013300.","journal-title":"ACM Trans. Math. Software"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023075.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02023075\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023075","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T22:39:57Z","timestamp":1557787197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02023075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["BF02023075"],"URL":"https:\/\/doi.org\/10.1007\/bf02023075","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}