An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem.
Andrea GrossoFederico Della CroceRoberto TadeiPublished in: Oper. Res. Lett. (2004)
Keyphrases
- scheduling problem
- tabu search
- flowshop
- single machine
- np hard
- processing times
- permutation flowshop
- precedence constraints
- earliness tardiness
- minimizing makespan
- total tardiness
- parallel machines
- unrelated parallel machines
- setup times
- metaheuristic
- limited capacity
- neural network
- database
- quay crane
- job shop scheduling problem
- computational complexity
- real world
- databases
- data sets