Decentralized Online Scheduling of Malleable NP-hard Jobs.
Peter SandersDominik SchreiberPublished in: Euro-Par (2022)
Keyphrases
- scheduling problem
- np hard
- parallel machines
- identical parallel machines
- flowshop
- unrelated parallel machines
- precedence constraints
- single machine
- processing times
- identical machines
- job scheduling
- minimize total
- release dates
- optimal scheduling
- scheduling jobs
- online learning
- setup times
- branch and bound algorithm
- release times
- optimal solution
- weighted tardiness
- maximum lateness
- batch processing
- precedence relations
- limited capacity
- sequence dependent setup times
- deteriorating jobs
- strongly np hard
- single machine scheduling problem
- computational grids
- approximation algorithms
- special case
- cooperative
- scheduling algorithm
- distributed systems
- linear programming
- wafer fabrication
- lower bound
- scheduling decisions
- scheduling strategy
- job shop
- scheduling policies
- upper bound
- worst case
- round robin
- job shop scheduling problem
- communication delays
- real time
- peer to peer
- fixed number