Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints.
Alexandra Anna LassotaAlexander LindermayrNicole MegowJens SchlöterPublished in: ICML (2023)
Keyphrases
- precedence constraints
- scheduling problem
- single machine scheduling problem
- release dates
- single machine to minimize
- single machine
- precedence relations
- flowshop
- parallel machines
- branch and bound algorithm
- setup times
- sequence dependent setup times
- processing times
- maximum lateness
- np hard
- vertex cover
- series parallel
- approximation algorithms
- release times
- total tardiness
- parallel processors
- identical machines
- tabu search
- partially ordered
- unit length
- optimal solution
- partially ordered sets
- open shop
- scheduling jobs
- total weighted tardiness
- combinatorial optimization
- partial order
- job shop scheduling problem
- completion times