A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints.
Hegen XiongHuali FanGuozhang JiangGongfa LiPublished in: Eur. J. Oper. Res. (2017)
Keyphrases
- scheduling problem
- job shop scheduling problem
- precedence constraints
- job shop scheduling
- production scheduling
- branch and bound algorithm
- neural network
- simulated annealing
- single machine
- setup times
- total weighted tardiness
- critical path
- release dates
- single machine scheduling problem
- processing times
- benchmark problems
- lower bound
- computational complexity