New VNS heuristic for total flowtime flowshop scheduling problem
- 31 July 2012
- journal article
- Published by Elsevier in Expert Systems with Applications
- Vol. 39 (9) , 8149-8161
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problemsComputers & Operations Research, 2009
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterionComputers & Operations Research, 2009
- A combinatorial particle swarm optimisation for solving permutation flowshop problemsComputers & Industrial Engineering, 2008
- A discrete version of particle swarm optimization for flowshop scheduling problemsComputers & Operations Research, 2007
- An efficient constructive heuristic for flowtime minimisation in permutation flow shopsOmega, 2003
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisationEuropean Journal of Operational Research, 2002
- Constructive and composite heuristic solutions to the P//∑Ci scheduling problemEuropean Journal of Operational Research, 2001
- Variable neighborhood search for the p-medianLocation Science, 1997
- Genetic algorithms for flowshop scheduling problemsComputers & Industrial Engineering, 1996
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979