Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem.
Yi TanTorsten HildebrandtBernd Scholz-ReiterPublished in: J. Sched. (2016)
Keyphrases
- job shop
- total weighted tardiness
- scheduling problem
- single machine
- job shop scheduling
- job shop scheduling problem
- flowshop
- tabu search
- production scheduling
- np hard
- processing times
- setup times
- resource constrained
- sequence dependent setup times
- parallel machines
- precedence constraints
- search procedure
- neural network
- release dates
- objective function