Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints.
Yumei HuoHairong ZhaoPublished in: Theor. Comput. Sci. (2011)
Keyphrases
- bicriteria
- flowshop
- scheduling problem
- completion times
- job processing times
- manufacturing cell
- unrelated parallel machines
- single machine
- maximum tardiness
- processing times
- precedence constraints
- single machine scheduling problem
- setup times
- parallel machines
- weighted sum
- special case
- efficient solutions
- release dates
- tabu search
- integer linear programming
- knapsack problem
- scheduling jobs
- minimizing makespan
- np hard
- shortest path problem
- global constraints
- approximation algorithms
- dynamic programming