Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time
- 30 November 2004
- journal article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 47 (2-3) , 181-193
- https://doi.org/10.1016/j.cie.2004.06.006
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- A new heuristic and dominance relations for no-wait flowshops with setupsComputers & Operations Research, 2001
- A REVIEW OF FLOWSHOP SCHEDULING RESEARCH WITH SETUP TIMESProduction and Operations Management, 2000
- Ant Algorithms for Discrete OptimizationArtificial Life, 1999
- A review of scheduling research involving setup considerationsOmega, 1999
- An improved Ant System algorithm for theVehicle Routing ProblemAnnals of Operations Research, 1999
- Total flowtime in no-wait flowshops with separated setup timesComputers & Operations Research, 1998
- Ant colony system: a cooperative learning approach to the traveling salesman problemIEEE Transactions on Evolutionary Computation, 1997
- Ant system: optimization by a colony of cooperating agentsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1996
- Heuristics from Nature for Hard Combinatorial Optimization ProblemsInternational Transactions in Operational Research, 1996
- The Delivery Man Problem and Cumulative MatroidsOperations Research, 1993