A new lower bounding scheme for the total weighted tardiness problem.
M. Selim AkturkMehmet Bayram YildirimPublished in: Comput. Oper. Res. (1998)
Keyphrases
- lower bounding
- total weighted tardiness
- lagrangian relaxation
- branch and bound algorithm
- single machine
- lower bound
- lower and upper bounds
- dynamic time warping
- multi step
- scheduling problem
- single machine scheduling problem
- mathematical programming
- sequence dependent setup times
- upper bound
- processing times
- similarity search
- euclidean distance
- job shop
- optimal solution
- flowshop
- branch and bound
- tabu search
- linear programming
- reinforcement learning