Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval.
Imed KacemPublished in: J. Comb. Optim. (2009)
Keyphrases
- approximation algorithms
- makespan minimization
- single machine
- polynomial time approximation
- total weighted tardiness
- special case
- np hard
- scheduling problem
- processing times
- polynomially solvable
- release dates
- sequence dependent setup times
- flowshop
- worst case
- minimum cost
- parallel machines
- setup times
- np complete
- production scheduling
- integer programming
- job processing times
- job shop scheduling problem
- approximation ratio
- computational complexity
- metaheuristic
- dynamic programming
- constant factor
- combinatorial auctions
- job shop
- knapsack problem
- linear programming
- optimal solution