Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints.
Rodrigo A. CarrascoGarud IyengarCliff SteinPublished in: Oper. Res. Lett. (2013)
Keyphrases
- dynamic programming
- precedence constraints
- single machine scheduling problem
- maximum lateness
- scheduling problem
- release dates
- branch and bound algorithm
- flowshop
- single machine
- approximation algorithms
- sequence dependent setup times
- processing times
- parallel machines
- precedence relations
- partially ordered
- identical machines
- deteriorating jobs
- parallel processors
- series parallel
- vertex cover
- global constraints
- partial order
- release times
- setup times
- np hard
- scheduling jobs
- completion times
- partially ordered sets
- total cost
- tabu search
- expected cost
- search algorithm
- unit length
- optimal solution