A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date.
Ching-Jong LiaoChe-Ching ChengPublished in: Comput. Ind. Eng. (2007)
Keyphrases
- single machine
- variable neighborhood search
- completion times
- single machine scheduling problem
- total weighted tardiness
- weighted number of tardy jobs
- scheduling problem
- processing times
- release dates
- sequence dependent setup times
- tabu search
- dynamic programming
- routing problem
- metaheuristic
- heuristic methods
- minimum spanning tree
- shortest processing time
- hybrid method
- parallel machines
- search procedure
- flowshop
- branch and bound algorithm
- traveling salesman problem
- lagrangian relaxation
- hybrid algorithm
- job shop
- np hard