{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T12:00:07Z","timestamp":1725624007363},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642232282"},{"type":"electronic","value":"9783642232299"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-23229-9_4","type":"book-chapter","created":{"date-parts":[[2011,10,21]],"date-time":"2011-10-21T10:26:36Z","timestamp":1319192796000},"page":"79-104","source":"Crossref","is-referenced-by-count":5,"title":["Optimization Technologies for Hard Problems"],"prefix":"10.1007","author":[{"given":"Czes\u0142aw","family":"Smutnicki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","volume-title":"Pattern Recognition and Applications","author":"E.H.L. Aarts","year":"1987","unstructured":"Aarts, E.H.L., van Laarhoven, P.J.M.: Simulated Annealing: a Pedestrian Review of the Theory and Some Applications. In: Deviijver, P.A., Kittler, J. (eds.) Pattern Recognition and Applications. Springer, Heidelberg (1987)"},{"key":"4_CR2","doi-asserted-by":"crossref","DOI":"10.1515\/9780691187563","volume-title":"Local Search in Combinatorial Optimization","author":"E.H.L. Aarts","year":"2003","unstructured":"Aarts, E.H.L., Lenstra, J.K.: Local Search in Combinatorial Optimization. Princeton University Press, Princeton (2003)"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0166-218X(90)90103-J","volume":"26","author":"T.S. Abdul-Razaq","year":"1990","unstructured":"Abdul-Razaq, T.S., Potts, C.N., Van Wassenhove, L.N.: A Survey of Algorithms for the Single Machine Total Weighted Tardiness Scheduling Problem. Discrete Applied Mathematics\u00a026, 235\u2013253 (1990)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L.M. Adleman","year":"1994","unstructured":"Adleman, L.M.: Molecular Computation of Solutions to Combinatorial Problems. Science\u00a0266, 1021\u20131024 (1994)","journal-title":"Science"},{"key":"4_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/0471739383","volume-title":"Parallel Metaheuristics: a New Class of Algorithms","author":"E. Alba","year":"2005","unstructured":"Alba, E.: Parallel Metaheuristics: a New Class of Algorithms. John Wiley & Sons, Chichester (2005)"},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-003-0436-0","volume":"97","author":"S. Albers","year":"2003","unstructured":"Albers, S.: On-Line Algorithms: a Survey. Mathematical Programming\u00a097, 3\u201324 (2003)","journal-title":"Mathematical Programming"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1023\/A:1018954718550","volume":"86","author":"S. Amin","year":"1999","unstructured":"Amin, S.: Simulated Jumping. Annals of Operations Research\u00a086, 23\u201338 (1999)","journal-title":"Annals of Operations Research"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(00)00239-5","volume":"263","author":"E. Angel","year":"2001","unstructured":"Angel, E., Zissimopoulos, V.: On the Landscape Ruggedness of the Quadratic Assignment Problem. Theoretical Computer Science\u00a0263, 159\u2013172 (2001)","journal-title":"Theoretical Computer Science"},{"key":"4_CR9","doi-asserted-by":"publisher","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, 262\u2013275 (1998)","journal-title":"Management Science"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Bartak, R.: On-line guide to Constraint programming\u00a0(2010), http:\/\/ktiml.mff.cuni.cz\/bartak\/constraints\/","DOI":"10.1002\/9780470400531.eorms0382"},{"key":"4_CR11","volume-title":"New Ideas in Optimization","author":"D. Corne","year":"1999","unstructured":"Corne, D., Dorigo, M., Glover, F.: New Ideas in Optimization. McGraw Hill, Cambridge (1999)"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Tansactions on Systems, Man, and Cybernetics: Part B\u00a026, 29\u201341 (1996)","journal-title":"IEEE Tansactions on Systems, Man, and Cybernetics: Part B"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. Bradford Books (2004)","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"4_CR14","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H.Freeman and Co., New York (1979)"},{"key":"4_CR15","volume-title":"Interfaces in Computer Science and Operations Research","author":"F. Glover","year":"1996","unstructured":"Glover, F.: Tabu Search and Adaptive Memory Programing - Advances, Application and Challenges. In: Barr, R.S., Helgason, R.V., Kennington, J.L. (eds.) Interfaces in Computer Science and Operations Research, Kluwer, Dordrecht (1996)"},{"key":"4_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)"},{"key":"4_CR17","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01721162","volume":"11","author":"R. Haupt","year":"1989","unstructured":"Haupt, R.: A Survey of Priority Rule-Based Scheduling. OR Spectrum\u00a011, 3\u201316 (1989)","journal-title":"OR Spectrum"},{"key":"4_CR19","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, MI (1975)"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D. Karaboga","year":"2007","unstructured":"Karaboga, D., Basturk, B.: A Powerful and Efficient Algorithm for Numerical Function Optimization: Artificial Bee Colony (ABC) Algorithm. Journal of Global Optimization\u00a039, 459\u2013471 (2007)","journal-title":"Journal of Global Optimization"},{"key":"4_CR21","first-page":"1942","volume-title":"Proc. IEEE International Conference on Neural Networks","author":"J. Kennedy","year":"1942","unstructured":"Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proc. IEEE International Conference on Neural Networks (Perth, Australia), vol.\u00a0IV, pp. 1942\u20131948. IEEE Service Center, Piscataway (1942)"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing, Science. Science\u00a0220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"4_CR23","volume-title":"New Ideas in Optimization","author":"P. Merz","year":"1999","unstructured":"Merz, P., Freisleben, B.: Fitness Landscapes and Memetic Algorithms Design. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization. McGraw-Hill, New York (1999)"},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A Fast Taboo Search Algorithm for the Job Shop Problem. Management Science\u00a042, 797\u2013813 (1996)","journal-title":"Management Science"},{"key":"4_CR25","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"},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.ejor.2004.08.021","volume":"169","author":"E. Nowicki","year":"2006","unstructured":"Nowicki, E., Smutnicki, C.: Some Aspects of Scatter Search in the Flow-Shop Problem. European Journal of Operational Research\u00a0169, 654\u2013666 (2006)","journal-title":"European Journal of Operational Research"},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/0-387-23667-8_7","volume-title":"Metaheuristic Optimization via Memory and Evolution. Tabu Search and Scatter Search","author":"E. Nowicki","year":"2005","unstructured":"Nowicki, E., Smutnicki, C.: Some New Ideas in TS for Job Shop Scheduling. In: Rego, C., Alidaee, B. (eds.) Metaheuristic Optimization via Memory and Evolution. Tabu Search and Scatter Search, pp. 165\u2013190. Kluwer, Dordrecht (2005)"},{"key":"4_CR28","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1287\/opre.25.1.45","volume":"25","author":"S.S. Panwalker","year":"1977","unstructured":"Panwalker, S.S., Iskander, W.: A Survey of Scheduling Rules. Operations Research\u00a025, 45\u201361 (1977)","journal-title":"Operations Research"},{"key":"4_CR29","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M. Pinedo","year":"2008","unstructured":"Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Springer, Heidelberg (2008)"},{"key":"4_CR30","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1162\/evco.1998.6.1.45","volume":"6","author":"C. Reeves","year":"1998","unstructured":"Reeves, C., Yamada, T.: Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem. Evolutionary Computation\u00a06, 45\u201360 (1998)","journal-title":"Evolutionary Computation"},{"key":"4_CR31","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1109\/TAC.1968.1098903","volume":"13","author":"M. Schumer","year":"1968","unstructured":"Schumer, M., Steiglitz, K.: Adaptive Step Size Random Search. IEEE Transactions on Automatic Control\u00a013, 270\u2013276 (1968)","journal-title":"IEEE Transactions on Automatic Control"},{"key":"4_CR32","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0166-218X(94)90036-1","volume":"55","author":"S.V. Sevast\u2019janov","year":"1994","unstructured":"Sevast\u2019janov, S.V.: On some geometric methods in scheduling theory: a survey. Discrete Applied Mathematics\u00a055, 59\u201382 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR33","unstructured":"Smutnicki, C.: Optimization and Control in JIT Manufacturing Systems. Oficyna Wydawnicza PWr, Wroclaw (1997)"},{"key":"4_CR34","doi-asserted-by":"publisher","first-page":"3003","DOI":"10.1103\/PhysRevLett.82.3003","volume":"82","author":"W. Wenzel","year":"1999","unstructured":"Wenzel, W., Hamacher, K.: A Stochastic Tunneling Approach for Global Minimization of Complex Potential Energy Landscapes. Physical Review Letters\u00a082, 3003 (1999)","journal-title":"Physical Review Letters"},{"key":"4_CR35","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF00202749","volume":"63","author":"E.D. Weinberger","year":"1990","unstructured":"Weinberger, E.D.: Correlated and Uncorrelated Fitness Landscapes and How to Tell the Difference. Biological Cybernetics\u00a063, 325\u2013336 (1990)","journal-title":"Biological Cybernetics"},{"key":"4_CR36","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0166-218X(93)E0127-K","volume":"58","author":"F. Werner","year":"1995","unstructured":"Werner, F., Winkler, A.: Insertion Techniques for the Heuristic Solution of the Job Shop Problem. Discrete Applied Mathematics\u00a058, 191\u2013211 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR37","unstructured":"Wierzchon, S.T.: Artificial Immune Systems. Theory and application. EXIT, Warsaw (2001) (Polish)"},{"key":"4_CR38","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D.H. Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No Free Lunch Theorems for Optimization. IEEE Transactions on Evolutionary Computation\u00a01, 67\u201382 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"4_CR39","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1109\/72.80311","volume":"2","author":"D. Zhou","year":"1991","unstructured":"Zhou, D., Cherkassky, V., Baldwin, T.R., Olson, D.E.: A Neural Network Approach to Job-shop Scheduling. IEEE Transactions on Neural Networks\u00a02, 175\u2013179 (1991)","journal-title":"IEEE Transactions on Neural Networks"}],"container-title":["Studies in Computational Intelligence","Recent Advances in Intelligent Engineering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23229-9_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:12:01Z","timestamp":1606169521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23229-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642232282","9783642232299"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23229-9_4","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2012]]}}}