A discrete differential evolution algorithm for the permutation flowshop scheduling problem
- 30 November 2008
- journal article
- Published by Elsevier BV in Computers & Industrial Engineering
- Vol. 55 (4), 795-816
- https://doi.org/10.1016/j.cie.2008.03.003
Abstract
No abstract availableKeywords
This publication has 55 references indexed in Scilit:
- Differential evolution for sequencing and scheduling optimizationJournal of Heuristics, 2006
- Comparison of heuristics for flowtime minimisation in permutation flowshopsComputers & Operations Research, 2005
- An efficient constructive heuristic for flowtime minimisation in permutation flow shopsOmega, 2003
- New heuristics for no-wait flowshops to minimize makespanComputers & Operations Research, 2003
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisationEuropean Journal of Operational Research, 2002
- New heuristics to minimize total completion time in m-machine flowshopsInternational Journal of Production Economics, 2002
- An application of genetic algorithms for flow shop problemsEuropean Journal of Operational Research, 1995
- Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flowshop—A Branch and Bound ApproachA I I E Transactions, 1977
- An Evaluation of Flow Shop Sequencing HeuristicsManagement Science, 1977
- A Heuristic Algorithm for the n Job, m Machine Sequencing ProblemManagement Science, 1970