Exact Sampling in Machine Scheduling Problems.
Sung-woo ChoAshish GoelPublished in: RANDOM-APPROX (2001)
Keyphrases
- scheduling problem
- flowshop
- parallel machines
- parallel machine scheduling problem
- minimizing makespan
- sequence dependent setup times
- unrelated parallel machines
- processing times
- setup times
- single machine
- strongly np hard
- job shop scheduling
- tabu search
- np hard
- identical machines
- job shop scheduling problem
- sampled data
- precedence constraints
- completion times
- maximum lateness
- bicriteria
- monte carlo
- job shop
- sampling methods
- random sampling
- neural network
- list scheduling
- preventive maintenance
- brute force
- parameter space
- sampling algorithm
- markov chain monte carlo
- sampling strategies
- sample size
- np complete
- greedy heuristics
- special case