文章基本信息

标题：Online Scheduling on a Single Machine with Grouped Processing Times
本地全文：下载
作者：Qijia Liu ; Long Wan ; Lijun Wei 等
期刊名称：Discrete Dynamics in Nature and Society
印刷版ISSN：1026-0226
电子版ISSN：1607-887X
出版年度：2015
卷号：2015
DOI：10.1155/2015/805294
出版社：Hindawi Publishing Corporation
摘要：We consider the online scheduling problem on a single machine with the assumption that all jobs have their processing times in , where and . All jobs arrive over time, and each job and its processing time become known at its arrival time. The jobs should be first processed on a single machine and then delivered by a vehicle to some customer. When the capacity of the vehicle is infinite, we provide an online algorithm with the best competitive ratio of . When the capacity of the vehicle is finite, that is, the vehicle can deliver at most c jobs at a time, we provide another best possible online algorithm with the competitive ratio of .