On Polynomial Solvability of the High Multiplicity Total Weighted Tardiness Problem.
Frieda GranotJadranka Skorin-KapovPublished in: Discret. Appl. Math. (1993)
Keyphrases
- total weighted tardiness
- single machine
- scheduling problem
- processing times
- job shop scheduling problem
- lagrangian relaxation
- job shop
- sequence dependent setup times
- parallel machines
- single machine scheduling problem
- flowshop
- job shop scheduling
- release dates
- dynamic programming
- setup times
- genetic algorithm
- precedence constraints
- linear programming
- np hard
- neural network
- benchmark problems
- branch and bound algorithm
- reinforcement learning