Online Scheduling with Delivery Time on a Bounded Parallel Batch Machine with Limited Restart

Hailing Liu, Long Wan, Zhigang Yan and Jinjiang Yuan

Mathematical Problems in Engineering, 2015, vol. 2015, 1-8

Abstract:

We consider the online (over time) scheduling of equal length jobs on a bounded parallel batch machine with batch capacity to minimize the time by which all jobs have been delivered with limited restart. Here, “restart” means that a running batch may be interrupted, losing all the work done on it, and jobs in the interrupted batch are then released and become independently unscheduled jobs, called restarted jobs. “Limited restart” means that a running batch which contains some restarted jobs cannot be restarted again. When , we propose a best possible online algorithm with a competitive ratio of , where is the positive solution of . When , we present a best possible online algorithm with a competitive ratio of , where is the positive solution of .

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2015/628254.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2015/628254.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:jnlmpe:628254

DOI: 10.1155/2015/628254

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().