{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T15:19:56Z","timestamp":1770477596300,"version":"3.49.0"},"reference-count":37,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1016\/s0305-0548(03)00038-8","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"791-801","source":"Crossref","is-referenced-by-count":133,"title":["An ant colony system for permutation flow-shop sequencing"],"prefix":"10.1016","volume":"31","author":[{"given":"Kuo-Ching","family":"Ying","sequence":"first","affiliation":[]},{"given":"Ching-Jong","family":"Liao","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(03)00038-8_BIB1","series-title":"Machine scheduling problems","author":"Rinnooy","year":"1967"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB2","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0377-2217(89)90383-4","article-title":"A new heuristic method for the flow shop sequencing problem","volume":"41","author":"Widmer","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB3","series-title":"Scheduling: theory, algorithm, and system","author":"Pinedo","year":"1995"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB4","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","article-title":"Simulated annealing for permutation flow-shop scheduling","volume":"17","author":"Osman","year":"1989","journal-title":"OMEGA, International Journal of Management Science"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB5","doi-asserted-by":"crossref","first-page":"B630","DOI":"10.1287\/mnsc.16.10.B630","article-title":"A heuristic algorithm for the n-job, m-machine sequencing problem","volume":"16","author":"Campbell","year":"1970","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB6","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1287\/mnsc.23.11.1174","article-title":"An evaluation of flowshop sequencing heuristic","volume":"23","author":"Dannenbring","year":"1977","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB7","first-page":"91","article-title":"A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem","volume":"11","author":"Nawaz","year":"1983","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1057\/jors.1965.8","article-title":"Sequencing jobs through a multi-stage process in the minimum total time\u2014a quick method of obtaining a near optimum","volume":"16","author":"Palmer","year":"1965","journal-title":"Operational Research Quarterly"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB9","first-page":"75","article-title":"Comparison of heuristics for flow shop sequencing, OMEGA","volume":"15","author":"Turner","year":"1987","journal-title":"International Journal of Management Science"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB10","series-title":"Genetic algorithms in search, optimization and machine learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB11","series-title":"Adaptation in natural and artificial systems","author":"Holland","year":"1975"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB12","series-title":"Simulated annealing: theory and applications","author":"Van Laarhoven","year":"1987"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB13","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","article-title":"Equation of state calculation by fast computing machine","volume":"21","author":"Metropolis","year":"1953","journal-title":"Journal of Chemical Physics"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB14","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search, part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB15","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search, part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB16","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0377-2217(89)90185-9","article-title":"New approaches for heuristic search","volume":"39","author":"Glover","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB17","series-title":"Modern heuristic techniques for combinatorial problems","author":"Reeves","year":"1993"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB18","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","article-title":"Ant colony system","volume":"1","author":"Dorigo","year":"1997","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB19","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","article-title":"Benchmarks for basic scheduling problems","volume":"64","author":"Taillard","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB20","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1162\/106454699568728","article-title":"Ant algorithms for discrete optimization","volume":"5","author":"Dorigo","year":"1999","journal-title":"Artificial Life"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB21","unstructured":"Dorigo M. Optimization, learning and natural algorithm. Ph.D. thesis, DEI, Politecnico di Milano, Italy, 1992."},{"key":"10.1016\/S0305-0548(03)00038-8_BIB22","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/S0022-5193(05)80686-1","article-title":"Trails and U-turns in the selection of the shortest path by the ant Lasius Niger","volume":"159","author":"Beckers","year":"1992","journal-title":"Journal of Theoretical Biology"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB23","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","article-title":"Ant colonies for the traveling salesman problem","volume":"43","author":"Dorigo","year":"1997","journal-title":"BioSystem"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB24","unstructured":"Gambardella LM, Dorigo M. HAS-SOP: hybrid ant system for the sequential ordering problem. Technical Report IDSIA-11-97, IDSIA, Lugano, Switzerland, 1997."},{"key":"10.1016\/S0305-0548(03)00038-8_BIB25","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1057\/palgrave.jors.2600676","article-title":"Ant colonies for the quadratic assignment problem","volume":"50","author":"Gambardella","year":"1999","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB26","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/69.806935","article-title":"The ant system applied to the quadratic assignment problem","volume":"11","author":"Maniezzo","year":"1999","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB27","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1023\/A:1018940026670","article-title":"An improved ant system algorithm for the vehicle routing problem","volume":"89","author":"Bullnheimer","year":"1999","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB28","series-title":"Meta-heuristics: advances and trends in local search paradigms for optimization","article-title":"Applying the ant system to the vehicle routing problem","author":"Bullnheimer","year":"1999"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB29","first-page":"39","article-title":"Ant system for job-shop scheduling","volume":"34","author":"Colorni","year":"1994","journal-title":"Belgian Journal of Operations Research"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB30","unstructured":"Forsyth P, Wren A. An ant system for bus driver scheduling. Proceedings of the Seventh International Workshop on Computer-Aided Scheduling of Public Transport, Boston, August 1997."},{"key":"10.1016\/S0305-0548(03)00038-8_BIB31","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1057\/palgrave.jors.2600357","article-title":"Ants can colour graphs","volume":"48","author":"Costa","year":"1997","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB32","unstructured":"Kuntz P, Snyers D. Emergent colonization and graph partitioning. Proceedings of the Third International Conference on Simulation of Adaptive Behavior: From Animals to Animates, vol. 3. Cambridge, MA: The MIT Press, 1994."},{"key":"10.1016\/S0305-0548(03)00038-8_BIB33","unstructured":"Kuntz P, Layzell P, Snyers D. A colony of ant-like agents for partitioning in VLSI technology. Proceedings of the Fourth European Conference on Artificial Life. Cambridge, MA: The MIT Press, 1997."},{"key":"10.1016\/S0305-0548(03)00038-8_BIB34","first-page":"63","article-title":"Application of ant colony search algorithms in power system optimization","volume":"18","author":"Song","year":"1998","journal-title":"IEEE Power Engineering Review"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB35","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1177\/105971239700500203","article-title":"Ant-based load balancing in telecommunications networks","volume":"5","author":"Schoonderwoerd","year":"1997","journal-title":"Adaptive Behavior"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB36","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1613\/jair.530","article-title":"AntNet: distributed stigmergetic control for communications networks","volume":"9","author":"Di Caro","year":"1998","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.1016\/S0305-0548(03)00038-8_BIB37","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","article-title":"A genetic algorithm for flowshop sequencing","volume":"22","author":"Colin","year":"1995","journal-title":"Computers and Operations Research"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000388?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000388?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T08:59:29Z","timestamp":1584608369000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803000388"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":37,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["S0305054803000388"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00038-8","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}