Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints.
Hussein M. Abdel-WahabTiko KamedaPublished in: Oper. Res. (1978)
Keyphrases
- precedence constraints
- series parallel
- scheduling problem
- branch and bound algorithm
- redundancy allocation
- precedence relations
- parallel machines
- release dates
- single machine scheduling problem
- sequence dependent setup times
- parallel processors
- approximation algorithms
- global constraints
- partial order
- partially ordered
- maximum lateness
- unit length
- completion times
- single machine
- np hard
- lower bound
- total cost
- branch and bound
- optimal solution
- objective function
- multistage
- tabu search
- upper bound