Scheduling Tree-Shaped Task Graphs to Minimize Memory and Makespan.
Loris MarchalOliver SinnenFrédéric VivienPublished in: IPDPS (2013)
Keyphrases
- tree shaped
- scheduling problem
- completion times
- job processing times
- release dates
- single machine
- flowshop
- minimize total
- unrelated parallel machines
- processing times
- scheduling jobs
- batch processing
- deteriorating jobs
- parallel machines
- open shop
- series parallel
- batch processing machines
- graph matching
- memory usage
- precedence constraints
- job shop
- single machine scheduling problem
- setup times
- maximum lateness
- memory requirements
- resource consumption
- tabu search
- np hard
- identical parallel machines
- scheduling algorithm
- graph theory
- graph databases
- round robin
- memory space
- graph theoretic
- bicriteria
- sequence dependent setup times
- np complete
- simulated annealing
- graph structure
- resource allocation
- directed graph
- weighted graph
- job shop scheduling
- graph representation
- graph model