The two-machine flowshop scheduling problem with total tardiness
Computers and Operations Research
Minimizing total tardiness on one machine is NP-hard
Mathematics of Operations Research
A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops
Computers and Operations Research
Computers and Operations Research
Computers and Industrial Engineering
Tabu search for total tardiness minimization in flowshop scheduling problems
Computers and Operations Research
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Minimizing tardiness in a two-machine flow-shop
Computers and Operations Research
Computers and Operations Research
A steady-state genetic algorithm for multi-product supply chain network design
Computers and Industrial Engineering
Note on minimizing total tardiness in a two-machine flowshop
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
| Hi-index | 0.00 |
In this research, a detailed study of the permutation flowshop scheduling problem with the objective of minimizing total tardiness is presented and a steady-state genetic algorithm solution procedure is developed for such problems. Also, using problem-specific knowledge, a very efficient elite guided solution improvement scheme and an appropriate crossover operator have been developed and integrated into the proposed method. Using benchmark problems, the algorithm has been compared with heuristic algorithms having the best performance in the literature. The performance of the developed algorithm is shown to be superior using a simulation study.