Approximation algorithms for inventory constrained scheduling on a single machine.
Ehab MorsyErwin PeschPublished in: J. Sched. (2015)
Keyphrases
- approximation algorithms
- single machine
- scheduling problem
- np hard
- release dates
- precedence constraints
- minimize total
- maximum lateness
- release times
- scheduling jobs
- sequence dependent setup times
- weighted tardiness
- processing times
- deteriorating jobs
- special case
- setup times
- identical machines
- minimum cost
- production scheduling
- parallel machines
- worst case
- lower bound
- job shop
- supply chain
- single machine scheduling problem
- lot sizing
- flowshop
- completion times
- combinatorial auctions
- approximation ratio
- job shop scheduling
- constant factor
- tabu search
- single item
- branch and bound algorithm
- approximation guarantees
- strongly np hard
- computational complexity
- job shop scheduling problem
- lead time
- knapsack problem
- competitive ratio
- multi item
- polynomial time approximation
- integer programming
- optimal solution
- lagrangian relaxation
- infinite horizon
- dynamic programming