Meta-heuristics for stable scheduling on a single machine.
Francisco BallestínRoel LeusPublished in: Comput. Oper. Res. (2008)
Keyphrases
- single machine
- metaheuristic
- scheduling problem
- makespan minimization
- release dates
- minimize total
- maximum lateness
- tabu search
- scheduling jobs
- release times
- total weighted tardiness
- sequence dependent setup times
- weighted tardiness
- processing times
- ant colony optimization
- parallel machines
- deteriorating jobs
- simulated annealing
- earliness tardiness
- optimization problems
- search space
- identical machines
- flowshop
- production scheduling
- rolling horizon
- setup times
- optimal solution
- precedence constraints
- job processing times
- genetic algorithm
- job shop
- identical parallel machines
- job shop scheduling
- combinatorial optimization problems
- single machine scheduling problem
- vehicle routing problem
- combinatorial optimization
- np hard
- weighted number of tardy jobs
- path relinking
- benchmark instances
- number of late jobs
- competitive ratio
- job shop scheduling problem
- particle swarm optimization
- variable neighborhood search
- dynamic programming
- completion times
- search procedure
- traveling salesman problem
- evolutionary algorithm
- reinforcement learning