The shifting bottleneck procedure for job shop scheduling
Management Science
The two-machine flowshop scheduling problem with total tardiness
Computers and Operations Research
A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops
Computers and Operations Research
A performance comparison of heuristics for the total weighted tardiness problem
Computers and Industrial Engineering - Special issue: new advances in analysis of manufacturing systems
Computers and Industrial Engineering
Tabu search for total tardiness minimization in flowshop scheduling problems
Computers and Operations Research
Minimizing tardiness in a two-machine flow-shop
Computers and Operations Research
Note on minimizing total tardiness in a two-machine flowshop
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Design and Analysis of Experiments
Design and Analysis of Experiments
A decomposition algorithm for the single machine total tardiness problem
Operations Research Letters
Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness
Computers and Operations Research
Expert Systems with Applications: An International Journal
The distributed permutation flowshop scheduling problem
Computers and Operations Research
Late work minimization in flow shops by a genetic algorithm
Computers and Industrial Engineering
Modeling and scheduling a case of flexible flowshops: Total weighted tardiness minimization
Computers and Industrial Engineering
Effective Hybrid Stochastic Local Search Algorithms for Biobjective Permutation Flowshop Scheduling
HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
Elite guided steady-state genetic algorithm for minimizing total tardiness in flowshops
Computers and Industrial Engineering
Information Sciences: an International Journal
A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
Computers and Operations Research
Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems
Computers and Operations Research
A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop
Computers and Operations Research
Computational results for the flowshop tardiness problem
Computers and Industrial Engineering
Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
Computers and Operations Research
| Hi-index | 0.01 |
In this work, a review and comprehensive evaluation of heuristics and metaheuristics for the m-machine flowshop scheduling problem with the objective of minimising total tardiness is presented. Published reviews about this objective usually deal with a single machine or parallel machines and no recent methods are compared. Moreover, the existing reviews do not use the same benchmark of instances and the results are difficult to reproduce and generalise. We have implemented a total of 40 different heuristics and metaheuristics and we have analysed their performance under the same benchmark of instances in order to make a global and fair comparison. In this comparison, we study from the classical priority rules to the most recent tabu search, simulated annealing and genetic algorithms. In the evaluations we use the experimental design approach and careful statistical analyses to validate the effectiveness of the different methods tested. The results allow us to clearly identify the state-of-the-art methods.