Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems.
Oleh SobeykoLars MönchPublished in: Ann. Oper. Res. (2015)
Keyphrases
- single machine
- scheduling problem
- processing times
- maximum lateness
- release times
- flowshop
- release dates
- scheduling jobs
- earliness tardiness
- genetic algorithm
- single machine scheduling problem
- total weighted tardiness
- job shop
- deteriorating jobs
- setup times
- tabu search
- identical machines
- weighted number of tardy jobs
- sequence dependent setup times
- minimize total
- total tardiness
- completion times
- high multiplicity
- production scheduling
- weighted tardiness
- job shop scheduling
- parallel machines
- job shop scheduling problem
- competitive ratio
- np hard
- precedence constraints
- shortest processing time
- makespan minimization
- learning effect
- dynamic programming
- identical parallel machines
- strongly np hard
- job processing times
- simulated annealing
- number of late jobs
- evolutionary algorithm
- minimizing makespan
- special case
- tardiness cost
- particle swarm optimization
- reinforcement learning