A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times.
Christophe RapineNadia BraunerPublished in: Discret. Optim. (2013)
Keyphrases
- polynomial time approximation
- worst case
- makespan minimization
- dynamic programming
- optimal solution
- objective function
- computational complexity
- special case
- simulated annealing
- multi objective
- cost function
- scheduling problem
- upper bound
- mathematical model
- knapsack problem
- solution quality
- flowshop
- parallel machines