{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:55:24Z","timestamp":1725476124274},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540673545"},{"type":"electronic","value":"9783540455622"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10720076_5","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T10:06:39Z","timestamp":1167386799000},"page":"52-62","source":"Crossref","is-referenced-by-count":1,"title":["Intensification and Diversification Strategies with Tabu Search: One-Machine Problem with Weighted Tardiness Objective"],"prefix":"10.1007","author":[{"given":"Ricardo P.","family":"Beausoleil","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Laguna, M., Mart\u00ed, R.: Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization, University of Colorado at Boulder (1997)"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"R. McNaughton","year":"1959","unstructured":"McNaughton, R.: Scheduling with Deadlines and Loss Functions. Management Science\u00a06(1), 1\u201312 (1959)","journal-title":"Management Science"},{"issue":"1","key":"5_CR3","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M. Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A Dynamic Programming Approach to Sequencing Problems. Journal of the Society for Industrial and Applied Mathematics\u00a010(1), 196\u2013210 (1962)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1287\/mnsc.11.2.280","volume":"11","author":"E. Lawler","year":"1964","unstructured":"Lawler, E.: On Scheduling Problems with Deferral Costs. Management Science\u00a011(2), 280\u2013288 (1964)","journal-title":"Management Science"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"5","author":"F. Glover","year":"1986","unstructured":"Glover, F.: Future paths for integer programming and links to artificial intelligence. Computers and Ops. Res.\u00a05, 533\u2013549 (1986)","journal-title":"Computers and Ops. Res."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02078647","volume":"41","author":"F. Glover","year":"1993","unstructured":"Glover, F., Taillard, E., de Werra, D.: A user\u2019s guide to tabu search. Ann. Oper. Res.\u00a041, 3\u201328 (1993)","journal-title":"Ann. Oper. Res."},{"key":"5_CR7","unstructured":"Glover, F., Laguna, M.: Modern Heuristic Techniques for Combinatorial Problems, ch.\u00a03, pp. 70\u2013147. Halsted Press, John Wiley & Sons, Inc. (1993)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Glover, F., Laguna, M., Taillard, T., de Werra, D.: Tabu Search. Annals of Operations Research\u00a041 (1993)","DOI":"10.1007\/BF02078647"},{"key":"5_CR9","unstructured":"Hansen, P.: The steepest ascent mildest descent heuristic for combinatorial programming. In: Congress on Numerical Methods in Combinatorial Optimization, Capri, Italy (1986)"},{"key":"5_CR10","first-page":"219","volume-title":"Meta-Heuristics: Theory and Applications","author":"H. Ramalhinho Lourenco","year":"1998","unstructured":"Ramalhinho Lourenco, H., Zwijnenburg, M.: Combining the Large- step Optimization with Tabu-Search: Application to The Job-Shop Scheduling Problem. In: Meta-Heuristics: Theory and Applications, ch.\u00a014, pp. 219\u2013235. Kluwer Academic Publishers, Dordrecht (1998)"},{"issue":"4","key":"5_CR11","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1287\/opre.17.4.701","volume":"17","author":"H. Emmons","year":"1969","unstructured":"Emmons, H.: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness. The Journal of the Operations Research Society of America\u00a017(4), 701\u2013715 (1969)","journal-title":"The Journal of the Operations Research Society of America"},{"issue":"6","key":"5_CR12","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1287\/mnsc.18.6.B301","volume":"18","author":"J. Shwimer","year":"1972","unstructured":"Shwimer, J.: On the N-Job, One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution. Management Science\u00a018(6), 301 (1972)","journal-title":"Management Science"},{"key":"5_CR13","unstructured":"Morton, T.E., Pentico, D.W.: Heuristic Scheduling Systems, with Applications to Production Systems and Project Management. Wiley Series in Engineering and Technology Management (1993)"}],"container-title":["Lecture Notes in Computer Science","MICAI 2000: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10720076_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T07:35:07Z","timestamp":1556004907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10720076_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540673545","9783540455622"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/10720076_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}