Scheduling Stochastic Jobs - Complexity and Approximation Algorithms.
Liangde TaoLin ChenGuochuan ZhangPublished in: ICAPS (2021)
Keyphrases
- approximation algorithms
- precedence constraints
- worst case
- open shop
- np hard
- np hardness
- scheduling problem
- strongly np hard
- special case
- vertex cover
- identical parallel machines
- release dates
- approximation schemes
- job shop
- parallel machines
- sequence dependent setup times
- processing times
- flowshop
- minimum cost
- setup times
- identical machines
- job scheduling
- single machine scheduling problem
- lower bound
- scheduling strategy
- computational complexity
- set cover
- facility location problem
- undirected graph
- constant factor
- randomized algorithms
- polynomial time approximation
- primal dual
- scheduling policies
- wafer fabrication
- computational grids
- combinatorial auctions
- scheduling algorithm
- single machine
- error bounds
- linear programming
- production scheduling
- optimal solution
- disjoint paths
- constant factor approximation