Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines.
Hanna FurmanczykMarek KubalePublished in: CoRR (2016)
Keyphrases
- unit length
- precedence constraints
- identical machines
- parallel machines
- scheduling problem
- identical parallel machines
- graph model
- flowshop
- release dates
- bipartite graph
- processing times
- unrelated parallel machines
- precedence relations
- graph partitioning
- scheduling jobs
- undirected graph
- sequence dependent setup times
- approximation algorithms
- branch and bound algorithm
- parallel processors
- parallel machine scheduling problem
- single machine scheduling problem
- setup times
- wafer fabrication
- job scheduling
- fixed number
- minimize total
- maximum lateness
- single machine
- np hard
- single server
- parallel computing
- shared memory
- scheduling decisions
- partial order
- strongly np hard
- vertex set
- partially ordered
- job shop
- special case