Heuristic algorithms for job‐shop scheduling problemswith stochastic precedence constraints.
Klaus NeumannWelf G. SchneiderPublished in: Ann. Oper. Res. (1999)
Keyphrases
- job shop scheduling
- precedence constraints
- scheduling problem
- job shop scheduling problem
- precedence relations
- single machine
- flowshop
- vertex cover
- parallel machines
- np hard
- release dates
- tabu search
- processing times
- branch and bound algorithm
- single machine scheduling problem
- approximation algorithms
- unit length
- partially ordered sets
- lower bound
- partially ordered
- partial order
- simulated annealing
- dynamic programming
- objective function