科研之友
微信
新浪微博
Facebook
分享链接
摘要
A manufacturer has to process jobs released on-line and deliver them to customers. Preemption is allowed. Jobs are grouped into batches for delivery. The sum of the total flow time and the total delivery cost is minimized. Deliveries to different customers cannot be combined. We present an on-line algorithm with the competitive ratio bounded by 3 + alpha, where alpha is the ratio of the largest processing time to the smallest processing time.
- 出版日期2013-11
