Scheduling computer and manufacturing processes
Scheduling computer and manufacturing processes
A composite heuristic for the single machine early/tardy job scheduling problem
Computers and Operations Research
Early/tardy scheduling with sequence dependent setups on uniform parallel machines
Computers and Operations Research
Heuristics for hybrid flow shops with controllable processing times and assignable due dates
Computers and Operations Research
Parallel machine scheduling with earliness-tardiness penalties and additional resource constraints
Computers and Operations Research
An ant colony system for permutation flow-shop sequencing
Computers and Operations Research
On solving permutation scheduling problems with ant colony optimization
International Journal of Systems Science
Multicriteria Scheduling: Theory, Models and Algorithms
Multicriteria Scheduling: Theory, Models and Algorithms
Dispatching in flowshops with bottleneck machines
Computers and Industrial Engineering
Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
Computers and Operations Research
An improved earliness-tardiness timing algorithm
Computers and Operations Research
Computers and Operations Research
Ant colony optimization for FOP shop scheduling: a case study on different pheromone representations
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Ant colony optimization for multi-objective flow shop scheduling problem
Computers and Industrial Engineering
Dynamic heuristics for the generalized job-shop scheduling problem
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
Multiagent scheduling method with earliness and tardiness objectives in flexible job shops
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 0.01 |
In this paper we address a hybrid flow shop scheduling problem considering the minimization of the sum of the total earliness and tardiness penalties. This problem is proven to be NP-hard, and consequently the development of heuristic and meta-heuristic approaches to solve it is well justified. So, we propose an ant colony optimization method to deal with this problem. Our proposed method has several features, including some heuristics that specifically take into account both earliness and tardiness penalties to compute the heuristic information values. The performance of our algorithm is tested by numerical experiments on a large number of randomly generated problems. A comparison with solutions performance obtained by some constructive heuristics is presented. The results show that the proposed approach performs well for this problem.