Stability of a schedule minimising the makespan for processing jobs on identical machines.
Yuri N. SotskovPublished in: Int. J. Prod. Res. (2023)
Keyphrases
- identical machines
- scheduling problem
- processing times
- single machine
- flowshop
- job scheduling
- single machine scheduling problem
- scheduling jobs
- precedence constraints
- release dates
- setup times
- np hard
- batch processing
- permutation flowshop
- open shop
- sequence dependent setup times
- job shop
- tabu search
- minimizing makespan
- unrelated parallel machines
- completion times
- parallel machines
- parallel machine scheduling problem
- scheduling decisions
- deteriorating jobs
- resource consumption
- dynamic programming
- lower bound