Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines.
Hanna FurmanczykMarek KubalePublished in: Discret. Appl. Math. (2018)
Keyphrases
- unit length
- precedence constraints
- identical machines
- parallel machines
- scheduling problem
- identical parallel machines
- release dates
- flowshop
- processing times
- precedence relations
- branch and bound algorithm
- unrelated parallel machines
- parallel processors
- sequence dependent setup times
- parallel machine scheduling problem
- fixed number
- maximum lateness
- job scheduling
- minimize total
- single machine scheduling problem
- setup times
- single machine
- wafer fabrication
- scheduling jobs
- partially ordered
- np hard
- global constraints
- approximation algorithms
- partial order
- scheduling strategy
- list scheduling
- parallel computing
- lower bound
- computational grids
- competitive ratio
- shared memory
- b spline
- objective function