{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:47:10Z","timestamp":1725497230323},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729594"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72960-0_6","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T15:25:48Z","timestamp":1196954748000},"page":"111-136","source":"Crossref","is-referenced-by-count":5,"title":["An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions"],"prefix":"10.1007","author":[{"given":"Alberto V.","family":"Donati","sequence":"first","affiliation":[]},{"given":"Vince","family":"Darley","sequence":"additional","affiliation":[]},{"given":"Bala","family":"Ramachandran","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0167-6377(94)90026-4","volume":"16","author":"C.Y. Lee","year":"1994","unstructured":"C. Y. Lee, G. Vairaktarakis (1994) Minimizing makespan in hybrid flowshops. Operations Research Letters 16:149\u2013158","journal-title":"Operations Research Letters"},{"issue":"4","key":"6_CR2","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1080\/00207540310001602946","volume":"42","author":"A. Babayan","year":"2004","unstructured":"A. Babayan, D. He (2004) Solving the n-job 3-stage flexible flowshop scheduling problem using an agent-based approach. International Journal of Production Research 42(4):777\u2013799","journal-title":"International Journal of Production Research"},{"issue":"6-7","key":"6_CR3","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1016\/0098-1354(95)00184-0","volume":"20","author":"M.H. Bassett","year":"1996","unstructured":"M. H. Bassett, P.\u00a0Dave, F.J.\u00a0Doyle, G.K. Kudva, J.F. Pekny,\u00a0G.V. Reklaitis, S. \u00a0Subrahmanyam, D. L. Miller,\u00a0M.G. Zentner (1996) Perspectives on model based integration of process operations. Computers and Chemical Engineering 20(6-7):821","journal-title":"Computers and Chemical Engineering"},{"issue":"11","key":"6_CR4","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1016\/j.compchemeng.2004.05.002","volume":"28","author":"C.A. Floudas","year":"2004","unstructured":"C. A. Floudas, X. Lin (2004) Continuous time versus discrete time approaches for scheduling of chemical processes \u2013 a review. Computers and Chemical Engineering 28(11):2109\u20132129","journal-title":"Computers and Chemical Engineering"},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0377-2217(99)00236-2","volume":"122","author":"C. Charalambous","year":"2000","unstructured":"C. Charalambous, T. Tahmassebi, K. Hindi (2000) Modeling multi-stage manufacturing systems for efficient scheduling. European Journal of Operational Research 122(2):329","journal-title":"European Journal of Operational Research"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","volume":"91","author":"E. Nowicki","year":"1996","unstructured":"E. Nowicki, C. Smutnicki (1996) A fast tabu search algorithm for the permutation flow-shop problem. European Journal of Operational Research 91:160\u2013175","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1016\/S0305-0548(02)00068-0","volume":"30","author":"T. Aldowaisan","year":"2003","unstructured":"T. Aldowaisan, A. Allahverdi (2003) New heuristics for no-wait flowshops to minimize makespan. Computers and Operations Research 30(8):1219\u20131231","journal-title":"Computers and Operations Research"},{"key":"6_CR8","first-page":"91","volume":"11","author":"M. Nawaz","year":"1983","unstructured":"M. Nawaz, E.E. Enscore Jr, I. Ham (1983) A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. The International Journal of Management Sciences 11:91\u201395","journal-title":"The International Journal of Management Sciences"},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"N.G. Hall","year":"1996","unstructured":"N. G. Hall, C. Sriskandarajah (1996) A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 44(3):510\u2013525","journal-title":"Operations Research"},{"key":"6_CR10","unstructured":"V. Darley (1999) Towards a Theory of Autonomous, Optimizing Agents. PhD Thesis, Harvard"},{"key":"6_CR11","unstructured":"J. C. Beck, W. K. Jackson 1997, Constrainedness and the phase transition in job shop scheduling. Technical report TR 97-21, School of Computing Science, Simon Fraser University"},{"issue":"15","key":"6_CR12","doi-asserted-by":"publisher","first-page":"158701","DOI":"10.1103\/PhysRevLett.90.158701","volume":"90","author":"H. Bauke","year":"2003","unstructured":"H. Bauke, S. Mertens, A. Engel (2003) Phase transition in multiprocessor scheduling. Physical Review Letters 90(15):158701\u2013158704","journal-title":"Physical Review Letters"},{"key":"6_CR13","unstructured":"B. Ramachandran (1998) Automatic scheduling in plant design and operations. Internal Report, Unilever Research, Port Sunlight Laboratory"},{"issue":"2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M. Dorigo","year":"1999","unstructured":"M. Dorigo, G. Di Caro, L. M. Gambardella (1999) Ant algorithms for discrete optimization. Artificial Life 5(2):137\u2013172","journal-title":"Artificial Life"},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"M. Dorigo, V. Maniezzo, A. Colorni (1996) The ant system: optimization by a colony of cooperating agent. IEEE Transactions on Systems, Man and Cybernetics part B 26(1):29\u201341","journal-title":"IEEE Transactions on Systems, Man and Cybernetics part B"},{"key":"6_CR16","unstructured":"L. M. Gambardella, M. Dorigo (1995) AntQ: A reinforcement learning approach to the traveling salesman problem. Proceedings of the Twelfth International Conference on Machine Learning ML95 252\u2013260"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1057\/palgrave.jors.2600676","volume":"50","author":"L.M. Gambardella","year":"1999","unstructured":"L. M. Gambardella, E. D. Taillard, M. Dorigo (1999) Ant colonies for the quadratic assignment problem. Journal of the Operational Research Society 50:167\u2013176","journal-title":"Journal of the Operational Research Society"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1057\/palgrave.jors.2600357","volume":"48","author":"D. Costa","year":"1997","unstructured":"D. Costa, A. Hertz (1997) Ants can colour graphs. Journal of the Operational Research Society 48:295\u2013305","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"6_CR19","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1287\/ijoc.12.3.237.12636","volume":"12","author":"L.M. Gambardella","year":"2000","unstructured":"L. M. Gambardella, M. Dorigo (2000) An ant colony system hybridized with a new local search for the sequential ordering problem. INFORMS Journal on Computing, 12(3):237\u2013255","journal-title":"INFORMS Journal on Computing"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/S0377-2217(02)00908-6","volume":"155","author":"C. Rajendran","year":"2004","unstructured":"C. Rajendran, H. Ziegler (2004) Ant-colony algorithms for permutation flowshop scheduling to minimize makespan\/totalflowtime of jobs. European Journal of Operation Research 155:426\u2013438","journal-title":"European Journal of Operation Research"},{"key":"6_CR21","first-page":"39","volume":"34","author":"A. Colorni","year":"1994","unstructured":"A. Colorni, M. Dorigo, V. Maniezzo, M. Trubian (1994) Ant system for job-shop scheduling. Belgian Journal of Operations Research, Statistics and Computer Science 34:39\u201353","journal-title":"Belgian Journal of Operations Research, Statistics and Computer Science"},{"key":"6_CR22","first-page":"1560","volume":"3","author":"T. Stuetzle","year":"1998","unstructured":"T. Stuetzle (1998) An ant approach for the flow shop problem. Proceedings of the 6th European Congress on Intelligent Techniques and Soft Computing (EUFIT 98), Vol. 3:1560\u20131564","journal-title":"Proceedings of the 6th European Congress on Intelligent Techniques and Soft Computing (EUFIT 98), Vol."},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"E. Taillard (1993) Benchmarks for basic scheduling problems. European Journal of Operational Research 64:278\u2013285","journal-title":"European Journal of Operational Research"},{"key":"6_CR24","unstructured":"L. M. Gambardella, E. Taillard, G. Agazzi (1999) MACS-VRPTW: vehicle routing problem with time windows. In: M. Dorigo and F. Glover (eds) New Ideas in Optimization. Corne, McGraw-Hill, London"},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C. Blum","year":"2003","unstructured":"C. Blum, A. Roli (2003) Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys 35:268\u2013308","journal-title":"ACM Computing Surveys"}],"container-title":["Natural Computing Series","Advances in Metaheuristics for Hard Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72960-0_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:52:22Z","timestamp":1619517142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72960-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540729594"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72960-0_6","relation":{},"subject":[]}}