Genetic algorithms for a single-machine multiple orders per job scheduling problem with a common due date.
Jens RochollLars MönchPublished in: CASE (2017)
Keyphrases
- single machine
- scheduling problem
- maximum lateness
- processing times
- flowshop
- release dates
- tardiness cost
- release times
- scheduling jobs
- tabu search
- total weighted tardiness
- single machine scheduling problem
- earliness tardiness
- weighted number of tardy jobs
- genetic algorithm
- total tardiness
- completion times
- sequence dependent setup times
- setup times
- job shop
- high multiplicity
- np hard
- learning effect
- minimize total
- identical machines
- deteriorating jobs
- competitive ratio
- production scheduling
- minimizing makespan
- job processing times
- precedence constraints
- weighted tardiness
- parallel machines
- makespan minimization
- job shop scheduling problem
- identical parallel machines
- simulated annealing
- metaheuristic
- number of late jobs
- dispatching rule
- dynamic programming
- hybrid algorithm
- asymptotic optimality