{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:48:48Z","timestamp":1725482928563},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540716143"},{"type":"electronic","value":"9783540716150"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-71615-0_6","type":"book-chapter","created":{"date-parts":[[2007,4,18]],"date-time":"2007-04-18T18:51:34Z","timestamp":1176922294000},"page":"60-71","source":"Crossref","is-referenced-by-count":9,"title":["A GRASP and Branch-and-Bound Metaheuristic for the Job-Shop Scheduling"],"prefix":"10.1007","author":[{"given":"Susana","family":"Fernandes","sequence":"first","affiliation":[]},{"given":"Helena R.","family":"Louren\u00e7o","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J. Adams","year":"1988","unstructured":"Adams, J., Balas, E., Zawack, D.: The Shifting Bottleneck Procedure for Job Shop Scheduling. Management Science\u00a034(3), 391\u2013401 (1988)","journal-title":"Management Science"},{"issue":"4","key":"6_CR2","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0167-8191(03)00014-0","volume":"29","author":"R.M. Aiex","year":"2003","unstructured":"Aiex, R.M., Binato, S., Resende, M.G.C.: Parallel GRASP with path-relinking for job shop scheduling. Parallel Computing\u00a029(4), 393\u2013430 (2003)","journal-title":"Parallel Computing"},{"issue":"2","key":"6_CR3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D. Applegate","year":"1991","unstructured":"Applegate, D., Cook, W.: A Computational Study of the Job-Shop Scheduling Problem. ORSA Journal on Computing\u00a03(2), 149\u2013156 (1991)","journal-title":"ORSA Journal on Computing"},{"issue":"2","key":"6_CR4","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1287\/mnsc.44.2.262","volume":"44","author":"E. Balas","year":"1998","unstructured":"Balas, E., Vazacopoulos, A.: Guided Local Search with Shifting Bottleneck for Job Shop Scheduling. Management Science\u00a044(2), 262\u2013275 (1998)","journal-title":"Management Science"},{"key":"6_CR5","first-page":"59","volume-title":"Essays and surveys on metaheuristics","author":"S. Binato","year":"2001","unstructured":"Binato, S., Hery, W.J., Loewenstern, D.M., Resende, M.G.C.: A GRASP for Job Shop Scheduling. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and surveys on metaheuristics, pp. 59\u201379. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","volume":"11","author":"J. Carlier","year":"1982","unstructured":"Carlier, J.: The one-machine sequencing problem. European Journal of Operational Research\u00a011, 42\u201347 (1982)","journal-title":"European Journal of Operational Research"},{"key":"6_CR7","unstructured":"Caseau, Y., Laburthe, F.: Disjunctive scheduling with task intervals. Technical Report LIENS, 95\u201325, Ecole Normale Superieure Paris (1995)"},{"key":"6_CR8","unstructured":"Chen, S., Talukdar, S., Sadeh, N.: Job-shop-scheduling by a team of asynchronous agentes. In: Proceedings of the IJCAI-93 Workshop on Knowledge-Based Production, Scheduling and Control, Chambery France (1993)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E. Danna","year":"2005","unstructured":"Danna, E., Rothberg, E., Pape, C.L.: Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming, Ser. A. 102, 71\u201390 (2005)","journal-title":"Mathematical Programming, Ser. A"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Dell\u2019Amico, M., Trubian, M.: Applying Tabu-Search to the Job-Shop Scheduling Problem (1993)","DOI":"10.1007\/BF02023076"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Denzinger, J., Offermann, T.: On Cooperation between Evolutionary Algorithms and other Search Paradigms. In: Proceedings of the 1999 Congress on Evolutionary Computational (1999)","DOI":"10.1109\/CEC.1999.785563"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T. Feo","year":"1995","unstructured":"Feo, T., Resende, M.: Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization\u00a06, 109\u2013133 (1995)","journal-title":"Journal of Global Optimization"},{"key":"6_CR13","unstructured":"Fernandes, S., Louren\u00e7o, H.R.: Optimized Search methods. Working paper, Universitat Pompeu Fabra, Barcelona, Spain (2006)"},{"key":"6_CR14","first-page":"225","volume-title":"Industrial Scheduling","author":"H. Fisher","year":"1963","unstructured":"Fisher, H., Thompson, G.L.: Probabilistic learning combinations of local job-shop scheduling rules. In: Muth, J.F., Thompson, G.L. (eds.) Industrial Scheduling, pp. 225\u2013251, Prentice Hall, Englewood Cliffs (1963)"},{"key":"6_CR15","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completenes","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completenes. Freeman, San Francisco (1979)"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","volume":"133","author":"A.S. Jain","year":"1999","unstructured":"Jain, A.S., Meeran, S.: Deterministic job shop scheduling: Past, present and future. European Journal of Operational Research\u00a0133, 390\u2013434 (1999)","journal-title":"European Journal of Operational Research"},{"key":"6_CR17","unstructured":"Lawrence, S.: Resource Constrained Project Scheduling: an Experimental Investigation of Heuristic Scheduling techniques. Graduate School of Industrial Administration, Carnegie-Mellon University (1984)"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0377-2217(95)00012-F","volume":"83","author":"H.R. Louren\u00e7o","year":"1995","unstructured":"Louren\u00e7o, H.R.: Job-shop scheduling: Computational study of local search and large-step optimization methods. European Journal of Operational Research\u00a083, 347\u2013367 (1995)","journal-title":"European Journal of Operational Research"},{"key":"6_CR19","volume-title":"Meta-heuristics: Theory & Applications","author":"H.R. Louren\u00e7o","year":"1996","unstructured":"Louren\u00e7o, H.R., Zwijnenburg, M.: Combining large-step optimization with tabu-search: Application to the job-shop scheduling problem. In: Osman, I.H., Kelly, J.P. (eds.) Meta-heuristics: Theory & Applications, Kluwer Academic Publishers, Dordrecht (1996)"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10951-005-6364-5","volume":"8","author":"E. Nowicki","year":"2005","unstructured":"Nowicki, E., Smutnicki, C.: An Advanced Tabu Search Algorithm for the Job Shop Problem. Journal of Scheduling\u00a08, 145\u2013159 (2005)","journal-title":"Journal of Scheduling"},{"issue":"6","key":"6_CR21","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E., Smutniki, C.: A Fast Taboo Search Algorithm for the Job Shop Problem. Management Science\u00a042(6), 797\u2013813 (1996)","journal-title":"Management Science"},{"key":"6_CR22","unstructured":"Roy, B., Sussman, B.: Les prob\u00e8ms d\u2019ordonnancement avec constraintes disjonctives. Note DS 9 bis, SEMA, Paris (1964)"},{"key":"6_CR23","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1287\/opre.18.2.263","volume":"18","author":"L. Schrage","year":"1970","unstructured":"Schrage, L.: Solving resource-constrained network problems by implicit enumeration: Non pre-emptive case. Operations Research\u00a018, 263\u2013278 (1970)","journal-title":"Operations Research"},{"issue":"10","key":"6_CR24","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","volume":"38","author":"R.H. Storer","year":"1992","unstructured":"Storer, R.H., Wu, S.D., Vaccari, R.: New search spaces for sequencing problems with application to job shop scheduling. Management Science\u00a038(10), 1495\u20131509 (1992)","journal-title":"Management Science"},{"issue":"2","key":"6_CR25","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"\u00c9.D. Taillard","year":"1993","unstructured":"Taillard, \u00c9.D. : Benchmarks for Basic Scheduling Problems. European Journal of Operational Research\u00a064(2), 278\u2013285 (1993)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"6_CR26","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1287\/ijoc.6.2.108","volume":"6","author":"\u00c9.D. Taillard","year":"1994","unstructured":"Taillard, \u00c9.D.: Parallel Taboo Search Techniques for the Job Shop Scheduling Problem. ORSA Journal on Computing\u00a06(2), 108\u2013117 (1994)","journal-title":"ORSA Journal on Computing"},{"key":"6_CR27","doi-asserted-by":"crossref","first-page":"329","DOI":"10.9746\/sicetr1965.30.329","volume":"130","author":"H. Tamura","year":"1994","unstructured":"Tamura, H., Hirahara, A., Hatono, I., Umano, M.: An approximate solution method for combinatorial optimisation. In: Transactions of the Society of Instrument and Control Engineers vol. 130, pp. 329\u2013336 (1994)","journal-title":"Transactions of the Society of Instrument and Control Engineers"},{"key":"6_CR28","first-page":"281","volume-title":"Parallel Problem Solving from Nature","author":"T. Yamada","year":"1992","unstructured":"Yamada, T., Nakano, R.: A genetic algorithm applicable to large-scale job-shop problems. In: Manner, R., Manderick, B. (eds.) Parallel Problem Solving from Nature, vol.\u00a02, pp. 281\u2013290. Elsevier Science, Amsterdam (1992)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71615-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T11:16:36Z","timestamp":1556363796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71615-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540716143","9783540716150"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71615-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}