{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T14:26:12Z","timestamp":1784125572625,"version":"3.55.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,6,1]],"date-time":"2004-06-01T00:00:00Z","timestamp":1086048000000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,6]]},"DOI":"10.1016\/s0377-2217(02)00908-6","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T14:55:35Z","timestamp":1048604135000},"page":"426-438","source":"Crossref","is-referenced-by-count":354,"title":["Ant-colony algorithms for permutation flowshop scheduling to minimize makespan\/total flowtime of jobs"],"prefix":"10.1016","volume":"155","author":[{"given":"Chandrasekharan","family":"Rajendran","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hans","family":"Ziegler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00908-6_BIB1","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/S0377-2217(97)00136-7","article-title":"A tabu search approach for the flow shop scheduling problem","volume":"109","author":"Ben-Daya","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB2","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\/S0377-2217(02)00908-6_BIB3","unstructured":"Dorigo, M., 1992. Optimization, learning and natural algorithms (in Italian). PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","article-title":"The ant system: Optimization by a colony of cooperating agents","volume":"26","author":"Dorigo","year":"1996","journal-title":"IEEE Transactions on Systems, Man and Cybernetics\u2013\u2013Part B"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB5","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1080\/00207547808930015","article-title":"Four simple heuristics for scheduling a flow-shop","volume":"16","author":"Gelders","year":"1978","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB6","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/0377-2217(93)E0353-Y","article-title":"Flowshop sequencing with mean flow time objective","volume":"81","author":"Ho","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB7","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1287\/opre.13.3.400","article-title":"Application of the branch-and-bound technique to some flowshop scheduling problems","volume":"13","author":"Ignall","year":"1965","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB8","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/0377-2217(93)E0235-P","article-title":"Modified simulated annealing algorithms for the flow shop sequencing problems","volume":"81","author":"Ishibuchi","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two- and three-stage production schedules","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB10","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/S0377-2217(00)00137-5","article-title":"Constructive and composite heuristic solutions to the P\u2225\u03a3Ci scheduling problem","volume":"132","author":"Liu","year":"2001","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB11","series-title":"Proceedings of the EvoWorkshops 2000","first-page":"287","article-title":"An ant algorithm with a new pheromone evaluation rule for total tardiness problems","volume":"vol. 1803","author":"Merkle","year":"2000"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB12","doi-asserted-by":"crossref","first-page":"118","DOI":"10.15807\/jorsj.23.118","article-title":"Analysis for minimizing weighted mean flowtime in flowshop scheduling","volume":"23","author":"Miyazaki","year":"1980","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.15807\/jorsj.21.287","article-title":"An adjacent pairwise approach to the mean flowtime scheduling problem","volume":"21","author":"Miyazaki","year":"1978","journal-title":"Journal of Operations Research Society of Japan"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB14","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","article-title":"A heuristic algorithm for the m-machine, n-job flowshop sequencing problem","volume":"11","author":"Nawaz","year":"1983","journal-title":"OMEGA"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB15","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","article-title":"A fast tabu search algorithm for the permutation flow-shop problem","volume":"91","author":"Nowicki","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB16","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1057\/jors.1992.126","article-title":"Two-machine flowshop scheduling problem with bicriteria","volume":"43","author":"Rajendran","year":"1992","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB17","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0925-5273(93)90024-F","article-title":"Heuristic algorithm for scheduling in a flowshop to minimize total flowtime","volume":"29","author":"Rajendran","year":"1993","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB18","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1016\/0377-2217(93)E0212-G","article-title":"Heuristics for scheduling in flowshop with multiple objectives","volume":"82","author":"Rajendran","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB19","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1080\/095372897234902","article-title":"Heuristics for scheduling in a flowshop with setup, processing and removal times separated","volume":"8","author":"Rajendran","year":"1997","journal-title":"Production Planning and Control"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB20","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0377-2217(96)00273-1","article-title":"An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs","volume":"103","author":"Rajendran","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB21","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/S0360-8352(00)00003-6","article-title":"Heuristics for scheduling in flowshops and flowline-based manufacturing cells to minimize the sum of weighted flowtime and weighted tardiness of jobs","volume":"37","author":"Rajendran","year":"1999","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB22","series-title":"Proceedings of the 6th European Congress on Intelligent Techniques and Soft Computing (EUFIT \u201998), vol. 3","first-page":"1560","article-title":"An ant approach for the flow shop problem","author":"Stuetzle","year":"1998"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB23","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","article-title":"Max\u2013min ant system","volume":"16","author":"Stuetzle","year":"2000","journal-title":"Future Generation Computer Systems"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB24","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\/S0377-2217(02)00908-6_BIB25","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1016\/0377-2217(95)00347-9","article-title":"Heuristic approaches for n\/m\/F\/\u03a3Ci scheduling problems","volume":"96","author":"Wang","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB26","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0377-2217(89)90383-4","article-title":"A new heuristic method for the flowshop sequencing problem","volume":"41","author":"Widmer","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00908-6_BIB27","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0305-0548(97)00050-6","article-title":"A heuristic algorithm for mean flowtime objective in flowshop scheduling","volume":"25","author":"Woo","year":"1998","journal-title":"Computers and Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702009086?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702009086?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T17:52:57Z","timestamp":1553449977000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702009086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,6]]}},"alternative-id":["S0377221702009086"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00908-6","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,6]]}}}