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