A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan.
Mario C. Vélez-GallegoJairo MayaJairo R. Montoya-TorresPublished in: Comput. Oper. Res. (2016)
Keyphrases
- release dates
- sequence dependent setup times
- single machine
- scheduling jobs
- scheduling problem
- minimize total
- total weighted tardiness
- maximum lateness
- processing times
- single machine scheduling problem
- dynamic programming
- strongly np hard
- parallel machines
- tabu search
- precedence constraints
- setup times
- job shop scheduling problem
- branch and bound
- search algorithm
- identical parallel machines
- optimal solution
- flowshop
- combinatorial optimization
- genetic algorithm
- hybrid algorithm
- constraint satisfaction