A Flexible On-line Scheduling Algorithm for Batch Machine with Infinite Capacity

Chung Poon () and Wenci Yu ()

Annals of Operations Research, 2005, vol. 133, issue 1, 175-181

Abstract: We study on-line scheduling on a batch machine with infinite capacity. We present a flexible on-line scheduling algorithm that aims at minimizing the makespan and achieves the optimal competitive ratio of $(1+\sqrt{5})/2$ . Copyright Springer Science + Business Media, Inc. 2005

Keywords: scheduling; batch; makespan; on-line; unbounded capacity (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-004-5031-0 (text/html)
Access to full text is restricted to subscribers.

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:spr:annopr:v:133:y:2005:i:1:p:175-181:10.1007/s10479-004-5031-0

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-004-5031-0

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().