A Differential Evolution Algorithm for the Permutation Flowshop Scheduling Problem with Total Flow Time Criterion
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 161-170
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measureAdvances in Engineering Software, 2013
- New VNS heuristic for total flowtime flowshop scheduling problemExpert Systems with Applications, 2012
- Experimental evaluation of pheromone models in ACOPlanAnnals of Mathematics and Artificial Intelligence, 2011
- Geometric crossover for the permutation representationIntelligenza Artificiale, 2011
- An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimizationExpert Systems with Applications, 2010
- A review of metrics on permutations for search landscape analysisComputers & Operations Research, 2007
- Flowshop scheduling research after five decadesEuropean Journal of Operational Research, 2006
- Constructive and composite heuristic solutions to the P//∑Ci scheduling problemEuropean Journal of Operational Research, 2001
- Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous SpacesJournal of Global Optimization, 1997
- Genetic algorithms for flowshop scheduling problemsComputers & Industrial Engineering, 1996