Convex resource allocation for minimizing the makespan in a single machine with job release dates.
Moshe KaspiDvir ShabtayPublished in: Comput. Oper. Res. (2004)
Keyphrases
- resource allocation
- release dates
- single machine
- scheduling problem
- maximum lateness
- processing times
- single machine scheduling problem
- release times
- minimize total
- resource consumption
- scheduling jobs
- sequence dependent setup times
- total weighted tardiness
- earliness tardiness
- identical parallel machines
- job processing times
- dynamic programming
- setup times
- flowshop
- completion times
- competitive ratio
- identical machines
- parallel machines
- precedence constraints
- job shop
- lagrangian relaxation
- combinatorial auctions