Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost.
Yiwei JiangJueliang HuLongcheng LiuYuqing ZhuT. C. E. ChengPublished in: Inf. Sci. (2014)
Keyphrases
- scheduling problem
- scheduling algorithm
- flowshop
- single machine
- scheduling decisions
- competitive ratio
- job processing times
- processing times
- unrelated parallel machines
- parallel machines
- scheduling jobs
- sequence dependent setup times
- online algorithms
- response time
- identical parallel machines
- identical machines
- online learning
- precedence constraints
- total cost
- release dates
- manufacturing cell
- preventive maintenance
- material handling
- priority queue
- objective function
- tabu search
- strongly np hard
- minimize total
- setup times
- real time
- np hard
- real time database systems
- lower bound
- e learning
- learning algorithm
- resource allocation
- high cost