On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
Eric AngelEvripidis BampisAlexander V. KononovPublished in: Theor. Comput. Sci. (2003)
Keyphrases
- bicriteria
- flowshop
- scheduling problem
- parallel machine scheduling problem
- sequence dependent setup times
- efficient solutions
- release dates
- single machine
- processing times
- integer linear programming
- setup times
- knapsack problem
- parallel machines
- precedence constraints
- special case
- completion times
- single machine scheduling problem
- tabu search
- np hard
- shortest path problem
- metaheuristic