Scheduling identical jobs with chain precedence constraints on two uniform machines.
Peter BruckerJohann L. HurinkWieslaw KubiakPublished in: Math. Methods Oper. Res. (1999)
Keyphrases
- precedence constraints
- identical machines
- parallel machines
- scheduling problem
- identical parallel machines
- release dates
- flowshop
- partially ordered sets
- precedence relations
- parallel processors
- branch and bound algorithm
- sequence dependent setup times
- single machine to minimize
- maximum lateness
- vertex cover
- setup times
- single machine scheduling problem
- series parallel
- total tardiness
- partial order
- processing times
- scheduling jobs
- lower bound
- single machine
- approximation algorithms
- global constraints
- partially ordered
- unit length
- np hard
- parallel computing
- makespan minimization
- total weighted tardiness
- single server
- job shop
- metaheuristic
- scheduling decisions
- upper bound