Scheduling tree-shaped task graphs to minimize memory and makespan
Loris MarchalOliver SinnenFrédéric VivienPublished in: CoRR (2012)
Keyphrases
- tree shaped
- scheduling problem
- completion times
- release dates
- job processing times
- single machine
- minimize total
- scheduling jobs
- batch processing
- processing times
- flowshop
- unrelated parallel machines
- single machine scheduling problem
- parallel machines
- series parallel
- precedence constraints
- deteriorating jobs
- scheduling algorithm
- graph representation
- batch processing machines
- setup times
- resource consumption
- weighted sum
- graph matching
- sequence dependent setup times
- graph model
- identical parallel machines
- memory usage
- tabu search
- np hard
- job shop
- maximum lateness
- open shop
- lower bound
- memory requirements
- graph databases
- memory space
- directed graph
- resource constraints
- pruning power
- minimizing makespan
- graph theory
- bipartite graph
- objective function
- production scheduling
- response time
- associative memory
- graph structure
- graph mining
- undirected graph
- queue length
- job shop scheduling problem
- graph theoretic
- bicriteria