Genetic algorithms to solve a single machine multiple orders per job scheduling problem.
Oleh SobeykoLars MönchPublished in: WSC (2010)
Keyphrases
- single machine
- scheduling problem
- maximum lateness
- processing times
- release dates
- release times
- flowshop
- scheduling jobs
- genetic algorithm
- single machine scheduling problem
- earliness tardiness
- total weighted tardiness
- sequence dependent setup times
- minimize total
- completion times
- weighted number of tardy jobs
- tabu search
- total tardiness
- setup times
- high multiplicity
- np hard
- identical machines
- identical parallel machines
- deteriorating jobs
- weighted tardiness
- parallel machines
- production scheduling
- job shop
- learning effect
- precedence constraints
- job processing times
- shortest processing time
- evolutionary algorithm
- job shop scheduling problem
- strongly np hard
- number of late jobs
- makespan minimization
- dynamic programming
- minimizing makespan
- simulated annealing
- dispatching rule
- competitive ratio
- partial order
- feasible solution
- particle swarm optimization
- lower bound