{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:21:37Z","timestamp":1725538897999},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642044403"},{"type":"electronic","value":"9783642044410"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04441-0_13","type":"book-chapter","created":{"date-parts":[[2009,10,3]],"date-time":"2009-10-03T22:10:51Z","timestamp":1254607851000},"page":"152-162","source":"Crossref","is-referenced-by-count":0,"title":["A New Ant Colony Optimization Algorithm with an Escape Mechanism for Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Tsai-Duan","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuin-Chieh","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Da-Ren","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng-Yung","family":"Chiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"Scheduling: theory, algorithm, and systems","author":"M. Pinedo","year":"2002","unstructured":"Pinedo, M.: Scheduling: theory, algorithm, and systems, 2nd edn. Prentice Hall, Englewood Cliffs (2002)","edition":"2"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1016\/0377-2217(94)00213-4","volume":"88","author":"A.-D. Belarmino","year":"1996","unstructured":"Belarmino, A.-D.: An SA\/TS mixture algorithm for the scheduling tardiness problem. European Journal of Operation Research\u00a088, 516\u2013524 (1996)","journal-title":"European Journal of Operation Research"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/S0377-2217(97)00136-7","volume":"109","author":"M. Ben-Daya","year":"1998","unstructured":"Ben-Daya, M., Al Fawzan, M.: A tabu search approach for the flow shop scheduling problem. European Journal of Operation Research\u00a0109, 88\u201395 (1998)","journal-title":"European Journal of Operation Research"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0305-0548(96)00052-4","volume":"24","author":"R.J.W. James","year":"1997","unstructured":"James, R.J.W.: Using tabu search to solve the common due date early\/tardy machine scheduling problem. Computers and Operations Research\u00a024, 199\u2013208 (1997)","journal-title":"Computers and Operations Research"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0305-0548(98)00056-2","volume":"26","author":"C.-F. Liaw","year":"1999","unstructured":"Liaw, C.-F.: A tabu search algorithm for the open shop scheduling problem. Computer and Operations Research\u00a026, 109\u2013126 (1999)","journal-title":"Computer and Operations Research"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/S0377-2217(99)00168-X","volume":"124","author":"C.-F. Liaw","year":"2000","unstructured":"Liaw, C.-F.: A hybrid genetic algorithm for the open shop scheduling problem. European Journal of Operation Research\u00a0124, 28\u201342 (2000)","journal-title":"European Journal of Operation Research"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/S0360-8352(03)00077-9","volume":"45","author":"B.J. Park","year":"2003","unstructured":"Park, B.J., Choi, H.R., Kim, H.S.: A hybrid genetic algorithm for the job shop scheduling problems. Computer and Industrial Engineering\u00a045, 597\u2013613 (2003)","journal-title":"Computer and Industrial Engineering"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1016\/0360-8352(96)00053-8","volume":"30","author":"M. Tadahiko","year":"1996","unstructured":"Tadahiko, M., Hisao, I., Hideo, T.: Genetic algorithms for flowshop scheduling problems. Computer and Industrial Engineering\u00a030, 1061\u20131071 (1996)","journal-title":"Computer and Industrial Engineering"},{"key":"13_CR9","first-page":"1445","volume-title":"Proceedings of the 1999 Congress on Evolutionary Computation","author":"A. Bauer","year":"1999","unstructured":"Bauer, A., Bullnheimer, B., Hartl, R.F., Strauss, C.: Minimizing total tardiness on a single machine using ant colony optimization. In: Proceedings of the 1999 Congress on Evolutionary Computation, pp. 1445\u20131450. IEEE Press, Los Alamitos (1999)"},{"key":"13_CR10","first-page":"25","volume":"7","author":"B. Bullnheimer","year":"1999","unstructured":"Bullnheimer, B., Hartl, R.F.: A New Rank Based Version of the Ant colony system \u2013 A Computational Study. Central European Journal of Operations Research\u00a07, 25\u201338 (1999)","journal-title":"Central European Journal of Operations Research"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/3-540-45356-3_60","volume-title":"Parallel Problem Solving from Nature-PPSN VI","author":"M. Bensten den","year":"2000","unstructured":"den Bensten, M., St\u00fctzle, T., Dorigo, M.: Ant Colony Optimization for the Total Weighted Tardiness Problem. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol.\u00a01917, pp. 611\u2013620. Springer, Heidelberg (2000)"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1018940026670","volume":"89","author":"B. Bullnheimer","year":"1999","unstructured":"Bullnheimer, B., Hartl, R.F., Strauss, C.: An improved Ant colony system algorithm for the Vehicle Routing Problem. Annals of Operations Research\u00a089, 319\u2013328 (1999)","journal-title":"Annals of Operations Research"},{"key":"13_CR13","first-page":"39","volume":"34","author":"A. Colorni","year":"1994","unstructured":"Colorni, A., Dorigo, M., Maniezzo, V., Trubian, M.: Ant colony system for job shop scheduling. Belgian Journal of Operations Research\u00a034, 39\u201353 (1994)","journal-title":"Belgian Journal of Operations Research"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1057\/palgrave.jors.2600357","volume":"48","author":"D. Costa","year":"1997","unstructured":"Costa, D., Hertz, A.: Ants can color graphs. Journal of the Operational Research Society\u00a048, 295\u2013305 (1997)","journal-title":"Journal of the Operational Research Society"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1057\/palgrave.jors.2600676","volume":"50","author":"L.M. Gambardella","year":"1999","unstructured":"Gambardella, L.M., Taillard, E., Dorigo, M.: Ant colonies for the quadratic assignment problem. Journal of Operational Research Society\u00a050, 167\u2013176 (1999)","journal-title":"Journal of Operational Research Society"},{"key":"13_CR16","unstructured":"Li, Y.-M., Xul: An ant colony optimization heuristic for solving maximum independent set problems. In: Fifth International Conference on Computational Intelligence and Multimedia Applications ICCIMA 2003. Proceedings, September 27-30, pp. 206\u2013211 (2003)"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/69.806935","volume":"11","author":"V. Maniezzo","year":"1999","unstructured":"Maniezzo, V., Colorni, A.: The ant colony system applied to quadratic assignment problem. IEEE Transactions on Knowledge and Data Engineering\u00a011, 769\u2013784 (1999)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"13_CR18","unstructured":"Taillard, E., Gambardella, L.M.: Adaptive Memories for the Quadratic Assignment Problem. Technical Report, IDSIA-87-97, IDSIA, Lugano, Switzerland (1997)"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/S0377-2217(02)00265-5","volume":"142","author":"T. Vincent","year":"2002","unstructured":"Vincent, T., Nicolas, M., Fabrice, T., Daniel, L.: An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem. European Journal of Operation Research\u00a0142, 250\u2013257 (2002)","journal-title":"European Journal of Operation Research"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/S0305-0548(03)00038-8","volume":"31","author":"K.-C. Ying","year":"2004","unstructured":"Ying, K.-C., Liao, C.-J.: An ant colony system for permutation flow-shop sequencing. Computers and Operations Research\u00a031, 791\u2013801 (2004)","journal-title":"Computers and Operations Research"},{"key":"13_CR21","unstructured":"Jiang, M.-P.: Application of Ant Colony System in Job-shop Scheduling Problem. Master Thesis, Graduate Institute of Industrial Engineering, National Taiwan University of Science and Technology (2003)"},{"key":"13_CR22","unstructured":"Hsu, C.-Y.: A Study on Particle Swarm Optimization for Discrete Optimization Problems, Master Thesis, Graduate Institute of Industrial Engineering, National Tsing Hua University (2003)"},{"key":"13_CR23","unstructured":"Chen, L.-S.: Ant Colony System for the Single Machine Total Weighted Tardiness Problem with Sequence-dependent Setups. Master Thesis, Graduate Institute of Industrial Engineering, National Taiwan University of Science and Technology (2002)"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1057\/jors.1965.8","volume":"16","author":"D.S. Palmer","year":"1965","unstructured":"Palmer, D.S.: Sequencing jobs through a multi-stage process in the minimum total time \u2013 a quick method of obtaining a near optimum. Operation Research Quarterly\u00a016, 101\u2013107 (1965)","journal-title":"Operation Research Quarterly"},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1287\/opre.8.4.487","volume":"8","author":"B. Giffler","year":"1960","unstructured":"Giffler, B., Thompson, G.L.: Algorithm for solving production scheduling problems. Operations Research\u00a08, 487\u2013503 (1960)","journal-title":"Operations Research"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operation Research\u00a064, 278\u2013285 (1993)","journal-title":"European Journal of Operation Research"},{"key":"13_CR27","unstructured":"Beasley, J.E.: OR-Library, \n                    \n                      http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html"}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04441-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T22:51:40Z","timestamp":1552171900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04441-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642044403","9783642044410"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04441-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}