Greedy Algorithms for the Multi-capacitated Metric Scheduling Problem.
Amedeo CestaAngelo OddiStephen F. SmithPublished in: ECP (1999)
Keyphrases
- greedy algorithms
- scheduling problem
- greedy algorithm
- np hard
- permutation flowshop
- single machine
- multi source
- knapsack problem
- flowshop
- setup times
- tabu search
- metric space
- precedence constraints
- search algorithm
- single source
- multi item
- minimizing makespan
- special case
- processing times
- worst case
- routing problem
- distance function
- linear programming
- lot sizing
- parallel machines
- integer programming
- approximation algorithms
- data fusion
- similarity search