Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes
Xinrong Lu () and
Zhaohui Liu ()
Additional contact information
Xinrong Lu: Department of Mathematics, East China University of Science and Technology, Shanghai 200237, P. R. China
Zhaohui Liu: Department of Mathematics, East China University of Science and Technology, Shanghai 200237, P. R. China
Asia-Pacific Journal of Operational Research (APJOR), 2015, vol. 32, issue 05, 1-31
Abstract:
This paper studies the online hierarchical scheduling problem on two uniform machines with bounded job sizes, where the first machine M1 receives both low and high hierarchy jobs, while the second machine M2 only receives high hierarchy jobs. The machines have a speed ratio of s (s ≥ 1), and M2 runs faster. Jobs are revealed one by one, and before the current job is scheduled, we have no information about next jobs except that the size of any job is in the interval [1, t]. The objective is to minimize the makespan. We present optimal algorithms for all (s, t) pairs.
Keywords: Hierarchical scheduling; uniform machine; online algorithm; competitive ratio (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595915500323
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:wsi:apjorx:v:32:y:2015:i:05:n:s0217595915500323
Ordering information: This journal article can be ordered from
DOI: 10.1142/S0217595915500323
Access Statistics for this article
Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao
More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().