Online Scheduling on a Single Machine with Grouped Processing Times

Qijia Liu, Long Wan and Lijun Wei

Discrete Dynamics in Nature and Society, 2015, vol. 2015, 1-7

Abstract:

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 .

Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/DDNS/2015/805294.pdf (application/pdf)
http://downloads.hindawi.com/journals/DDNS/2015/805294.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnddns:805294

DOI: 10.1155/2015/805294

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().