Approximately optimal algorithms for scheduling a single machine with general convex resource functions.
Xinle LiangHuaping ChenRui XuPublished in: Int. J. Comput. Integr. Manuf. (2015)
Keyphrases
- single machine
- scheduling problem
- approximately optimal
- minimize total
- release dates
- processing times
- maximum lateness
- setup times
- release times
- scheduling jobs
- identical machines
- weighted tardiness
- parallel machines
- total weighted tardiness
- sequence dependent setup times
- production scheduling
- computational complexity
- dynamic programming
- special case
- learning algorithm
- competitive ratio
- single machine scheduling problem
- average case
- incomplete information
- resource allocation
- optimization problems
- earliness tardiness
- rolling horizon