Online heuristic for the preemptive single machine scheduling problem to minimize the total weighted tardiness.
Boris GoldengorinVadim V. RomanukePublished in: Comput. Ind. Eng. (2021)
Keyphrases
- weighted tardiness
- single machine scheduling problem
- single machine
- scheduling problem
- processing times
- tabu search
- combinatorial optimization
- minimize total
- release dates
- lagrangian relaxation
- search procedure
- sequence dependent setup times
- job shop scheduling problem
- setup times
- dynamic programming
- precedence constraints
- branch and bound algorithm
- parallel machines
- lower bound
- simulated annealing
- resource consumption
- metaheuristic
- flowshop
- optimal solution
- feasible solution
- genetic algorithm
- hybrid algorithm
- traveling salesman problem
- search algorithm
- solution quality
- lower and upper bounds
- scheduling algorithm
- linear programming
- upper bound
- np hard