Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
Authors:
- Victor Fernandez-ViagasVFVictor Fernandez-Viagas
- Jose M. Molina-ParienteJMJose M. Molina-Pariente
- Jose M. FraminanJFJose M. Framinan
- 1 May 2020
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 282 (3) , 858-872
Abstract
No abstract availableKeywords
Funding Information
- Ministerio de Ciencia, Innovación y Universidades
This publication has 45 references indexed in Scilit:
- A comparison of metaheuristic procedures to schedule jobs in a permutation flow shop to minimise total earliness and tardinessInternational Journal of Production Research, 2013
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtimeComputers & Operations Research, 2013
- The distributed permutation flowshop scheduling problemComputers & Operations Research, 2010
- Efficient composite heuristics for total flowtime minimization in permutation flow shops☆Omega, 2009
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithmInternational Journal of Production Research, 2008
- Some aspects of scatter search in the flow-shop problemEuropean Journal of Operational Research, 2006
- Flowshop-scheduling problems with makespan criterion: a reviewInternational Journal of Production Research, 2005
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objectiveJournal of the Operational Research Society, 2004
- The permutation flow shop with buffers: A tabu search approachEuropean Journal of Operational Research, 1999
- Designing a Cellular Manufacturing System: A Materials Flow Approach Based on Operation SequencesIIE Transactions, 1990