Minimum Makespan Workflow Scheduling for Malleable Jobs with Precedence Constraints and Lifetime Resource Demands.
Chen ChenXiaodi KeTimothy ZeylKaixiang DuSam SanjabiShane BergsmaReza PournaghiChong ChenPublished in: ICDCS (2019)
Keyphrases
- precedence constraints
- scheduling problem
- release dates
- unit length
- flowshop
- parallel machines
- unrelated parallel machines
- precedence relations
- maximum lateness
- processing times
- branch and bound algorithm
- single machine scheduling problem
- sequence dependent setup times
- identical parallel machines
- setup times
- batch processing machines
- single machine
- scheduling jobs
- identical machines
- job processing times
- parallel processors
- vertex cover
- np hard
- approximation algorithms
- strongly np hard
- resource consumption
- tabu search
- series parallel
- total tardiness
- makespan minimization
- release times
- resource allocation
- open shop
- total weighted tardiness
- deteriorating jobs
- global constraints
- job shop
- job shop scheduling problem
- lower bound
- optimal solution
- message passing
- completion times
- parallel computing
- resource constraints