Some Results on Shop Scheduling with S-Precedence Constraints among Job Tasks.
Alessandro AgnetisFabrizio RossiStefano SmriglioPublished in: Algorithms (2019)
Keyphrases
- precedence constraints
- release dates
- scheduling problem
- maximum lateness
- single machine scheduling problem
- branch and bound algorithm
- precedence relations
- identical machines
- parallel machines
- flowshop
- sequence dependent setup times
- processing times
- single machine
- approximation algorithms
- partial order
- vertex cover
- setup times
- series parallel
- identical parallel machines
- parallel processors
- partially ordered
- np hard
- release times
- unit length
- job shop
- global constraints
- scheduling jobs
- optimal solution
- branch and bound
- np complete
- lower bound
- search algorithm
- job shop scheduling problem
- combinatorial optimization
- objective function