A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints.
Jesper NederlofCéline M. F. SwennenhuisKarol WegrzyckiPublished in: CoRR (2023)
Keyphrases
- precedence constraints
- scheduling problem
- release dates
- parallel machines
- single machine scheduling problem
- np hard
- optimal solution
- branch and bound algorithm
- objective function
- dynamic programming
- worst case
- precedence relations
- search space
- scheduling strategy
- strongly np hard
- parallel processors
- job shop scheduling problem
- approximation algorithms
- flowshop
- linear programming
- simulated annealing
- cost function
- computational complexity
- processing times
- partial order
- particle swarm optimization
- vertex cover
- lower bound
- open shop
- unrelated parallel machines