Accelerating the calculation of makespan used in scheduling improvement heuristics.
Golshan MadrakiRobert P. JuddPublished in: Comput. Oper. Res. (2021)
Keyphrases
- scheduling problem
- list scheduling
- release dates
- flowshop
- batch processing
- unrelated parallel machines
- scheduling jobs
- single machine
- processing times
- iterative repair
- deteriorating jobs
- batch processing machines
- scheduling algorithm
- parallel machines
- minimizing makespan
- precedence constraints
- flowshop scheduling problems
- round robin
- job shop scheduling
- permutation flowshop
- search algorithm
- heuristic methods
- job shop scheduling problem
- resource allocation
- tabu search
- np hard
- evolutionary algorithm
- setup times
- real time database systems
- calculation method
- maximum lateness
- single machine scheduling problem
- resource constraints
- lower bound