Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem☆
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- A survey of scheduling problems with setup times or costsEuropean Journal of Operational Research, 2008
- Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristicsComputers & Operations Research, 2008
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problemEuropean Journal of Operational Research, 2007
- No-wait flowshop with separate setup times to minimize maximum latenessThe International Journal of Advanced Manufacturing Technology, 2006
- A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problemsEuropean Journal of Operational Research, 2006
- Scheduling flow shops using differential evolution algorithmEuropean Journal of Operational Research, 2006
- Some aspects of scatter search in the flow-shop problemEuropean Journal of Operational Research, 2006
- Combining path relinking and genetic algorithms for the multiple-level warehouse layout problemEuropean Journal of Operational Research, 2006
- Note on minimizing total tardiness in a two-machine flowshopComputers & Operations Research, 2005
- A comprehensive review and evaluation of permutation flowshop heuristicsEuropean Journal of Operational Research, 2005