Metaheuristics for the single machine weighted quadratic tardiness scheduling problem.
Tomás C. GonçalvesJorge M. S. ValenteJeffrey E. SchallerPublished in: Comput. Oper. Res. (2016)
Keyphrases
- single machine
- scheduling problem
- tabu search
- makespan minimization
- completion times
- total weighted tardiness
- processing times
- minimize total
- earliness tardiness
- scheduling jobs
- release dates
- flowshop
- sequence dependent setup times
- total tardiness
- maximum lateness
- single machine scheduling problem
- setup times
- precedence constraints
- release times
- np hard
- number of late jobs
- shortest processing time
- objective function
- metaheuristic
- weighted number of tardy jobs
- production scheduling
- weighted sum
- weighted tardiness
- job shop scheduling problem
- genetic algorithm
- computational complexity
- number of tardy jobs
- competitive ratio
- parallel machines
- feasible solution
- vehicle routing problem
- particle swarm optimization
- polynomially solvable
- optimization problems
- job shop
- minimizing makespan
- deteriorating jobs
- simulated annealing
- evolutionary algorithm
- job processing times
- search procedure
- memetic algorithm