Comparing meta-heuristic approaches for parallel machine scheduling problems
Authors:
- Alexandre S. MendesAMAlexandre S. Mendes
- Felipe M. MüllerFMFelipe M. Müller
- Paulo M. FrançaPFPaulo M. França
- Pablo MoscatoPMPablo Moscato
- 1 January 2002
- journal article
- Published by Taylor & Francis in Production Planning & Control
- Vol. 13 (2) , 143-154
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A memetic algorithm for the total tardiness single machine scheduling problemEuropean Journal of Operational Research, 2001
- Tabu Search1997
- A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup timesInternational Journal of Production Economics, 1996
- New Insertion and Postoptimization Procedures for the Traveling Salesman ProblemOperations Research, 1992
- Scheduling parallel processors: An integer linear programming based heuristic for minimizing setup timeInternational Journal of Production Research, 1987
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- Approximation Algorithms for Some Routing ProblemsSIAM Journal on Computing, 1978