{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:47Z","timestamp":1725455927931},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634768"},{"type":"electronic","value":"9783540695783"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0027176","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T02:08:44Z","timestamp":1132366124000},"page":"213-225","source":"Crossref","is-referenced-by-count":0,"title":["Directing the search of evolutionary and neighbourhood-search optimisers for the flowshop sequencing problem with an idle-time heuristic"],"prefix":"10.1007","author":[{"given":"Peter","family":"Ross","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Tuson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,18]]},"reference":[{"key":"15_CR1","unstructured":"A. Brindle. Genetic Algorithms for Function Optimization. PhD thesis, University of Alberta, 1981."},{"key":"15_CR2","volume-title":"New Optimisation Heuristics: The Great Deluge Algorithm and the Record-to-Record Travel","author":"G. Du\u00e9ck","year":"1990","unstructured":"G. Du\u00e9ck. New Optimisation Heuristics: The Great Deluge Algorithm and the Record-to-Record Travel. Technical report, IBM Germany, Heidelburg Scientific Center, 1990."},{"key":"15_CR3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G. Dueck","year":"1990","unstructured":"G. Dueck and T. Scheuer. Threshold Accepting: A General Purpose Optimisation Algorithm Superior to Simulated Annealing. Journal of Computation Physics, 90:161\u2013175, 1990.","journal-title":"Journal of Computation Physics"},{"key":"15_CR4","volume-title":"The Vehicle Routing Problem and Local Search Metaheuristics","author":"C. Hjorring","year":"1995","unstructured":"C. Hjorring. The Vehicle Routing Problem and Local Search Metaheuristics. PhD thesis, University of Queensland, Australia, 1995."},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0377-2217(91)90080-F","volume":"52","author":"J.C. Ho","year":"1991","unstructured":"J.C. Ho and Y.-H. Chang. A new heuristic for the n-job, M-machine flow-shop problem. European Journal of Operational Research, 52:194\u2013202, 1991.","journal-title":"European Journal of Operational Research"},{"key":"15_CR6","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"J.H. Holland. Adaptation in Natural and Artificial Systems. Ann Arbor: The University of Michigan Press, 1975."},{"key":"15_CR7","volume-title":"Machine Sequencing Problems: Classification, complexity and computations","author":"A. H. G. Rinnooy Kan","year":"1976","unstructured":"A. H. G. Rinnooy Kan. Machine Sequencing Problems: Classification, complexity and computations. Martinus Nijhoff, The Hague, 1976."},{"key":"15_CR8","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C.D. Gelatt, Jr., and M.P. Vecchi. Optimization by Simulated Annealing. Science, 220:671\u2013680, 1983.","journal-title":"Science"},{"key":"15_CR9","unstructured":"S. Minton, A. Phillips, A. Johnston, and P. Laird. Solving Large Scale CSP and Scheduling Problems with a Heuristic Repair Method. In Proceedings of AAAI-90, 1990."},{"key":"15_CR10","unstructured":"G. F. Mott. Optimising Flowshop Scheduling Through Adaptive Genetic Algorithms. Chemistry Part II Thesis, Oxford University, 1990."},{"key":"15_CR11","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","volume":"91","author":"E. Nowicki","year":"1996","unstructured":"E. Nowicki and C. Smutnicki. A fast tabu search algorithm for the permutation flow-shop problem. European Journal of Operational Research, 91:160\u2013175, 1996.","journal-title":"European Journal of Operational Research"},{"key":"15_CR12","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","volume":"17","author":"I. H. Osman","year":"1989","unstructured":"I. H. Osman and C. N. Potts. Simulated annealing for permutation flow-shop scheduling. OMEGA, 17:551\u2013557, 1989.","journal-title":"OMEGA"},{"key":"15_CR13","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/0377-2217(92)90361-C","volume":"61","author":"C. Rajendran","year":"1991","unstructured":"C. Rajendran and D. Chaudhuri. An efficient heuristic approach to the scheduling of jobs in a flowshop. European Journal of Operational Research, 61:318\u2013325, 1991.","journal-title":"European Journal of Operational Research"},{"key":"15_CR14","unstructured":"Peter Ross. Personal communication, 1996."},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Peter Ross, Dave Corne, and Hsiao-Lan Fang. Improving evolutionary timetabling with delta evaluation and directed mutation. In Y. Davidor, H-P. Schwefel, and R. Manner, editors, Parallel Problem-solving from Nature-PPSN III, LNCS, pages 566\u2013565. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58484-6_298"},{"key":"15_CR16","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"E. Taillard. Benchmarks for basic scheduling problems. European Journal of operations research, 64:278\u2013285, 1993.","journal-title":"European Journal of operations research"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"T. Yamada and R. Nakano. Scheduling by Genetic Local Search with Multi-Step Crossover. In The Fourth International Conference on Parallel Problem Solving From Nature (PPSN IV), 1996.","DOI":"10.1007\/3-540-61723-X_1059"},{"key":"15_CR18","unstructured":"M. Zweben and E. Davis. Learning to Improve Iterative Repair Scheduling. Technical report, NASA Ames Research Centre, Report FIA-92-14, 1992."},{"key":"15_CR19","unstructured":"M. Zweben, E. Davis, B. Daun, and M. Deale. Scheduling and Rescheduling with Iterative Repair. Technical report, NASA Ames Research Centre, Report FIA-92-16, 1992."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0027176","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T17:23:11Z","timestamp":1549300991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0027176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634768","9783540695783"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0027176","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}