Competitive Algorithms for Due Date Scheduling

被引:0
|
作者
Nikhil Bansal
Ho-Leung Chan
Kirk Pruhs
机构
[1] IBM T.J. Watson Research,Computer Science Department
[2] Max-Planck-Institut für Informatik,undefined
[3] University of Pittsburgh,undefined
来源
Algorithmica | 2011年 / 59卷
关键词
Online algorithms; Scheduling; Competitive analysis; Due dates; Supply chain;
D O I
暂无
中图分类号
学科分类号
摘要
We consider several online scheduling problems that arise when customers request make-to-order products from a company. At the time of the order, the company must quote a due date to the customer. To satisfy the customer, the company must produce the good by the due date. The company must have an online algorithm with two components: The first component sets the due dates, and the second component schedules the resulting jobs with the goal of meeting the due dates.
引用
收藏
页码:569 / 582
页数:13
相关论文
共 50 条