Resilient Scheduling Heuristics for Rigid Parallel Jobs.
Anne BenoitValentin Le FèvrePadma RaghavanYves RobertHongyang SunPublished in: Int. J. Netw. Comput. (2021)
Keyphrases
- identical machines
- batch processing machines
- parallel machines
- maximum lateness
- processing times
- list scheduling
- scheduling problem
- single machine
- dominance rules
- job scheduling
- unrelated parallel machines
- minimize total
- precedence constraints
- release dates
- scheduling strategy
- identical parallel machines
- sequence dependent setup times
- shared memory
- weighted tardiness
- setup times
- scheduling algorithm
- scheduling jobs
- three dimensional
- release times
- precedence relations
- parallel computing
- search algorithm
- deteriorating jobs
- np hard
- optimal scheduling
- flowshop
- scheduling policies
- single machine scheduling problem
- distributed memory
- scheduling decisions
- lower bound
- batch processing
- parallel processors
- heuristic search
- single server
- tardiness penalties
- computational grids
- wafer fabrication
- completion times
- polynomial time approximation
- parallel algorithm
- multiprocessor systems