Single machine scheduling with precedence constraints and positionally dependent processing times.
Alexandre DolguiValery S. GordonVitaly A. StrusevichPublished in: Comput. Oper. Res. (2012)
Keyphrases
- precedence constraints
- processing times
- scheduling problem
- single machine
- precedence relations
- release dates
- setup times
- single machine scheduling problem
- flowshop
- parallel machines
- np hard
- branch and bound algorithm
- maximum lateness
- tabu search
- scheduling jobs
- sequence dependent setup times
- identical machines
- polynomially solvable
- makespan minimization
- total weighted tardiness
- assembly line
- completion times
- worst case performance ratio
- resource consumption
- partial order
- parallel algorithm
- partially ordered
- approximation algorithms
- identical parallel machines
- np complete
- upper bound
- release times
- multi objective