Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan

Xing Chai and Wenhua Li ()
Additional contact information
Xing Chai: Zhengzhou University
Wenhua Li: Zhengzhou University

Journal of Combinatorial Optimization, 2018, vol. 36, issue 2, No 9, 472-492

Abstract: Abstract We study the online scheduling problem on m identical parallel machines to minimize makespan, i.e., the maximum completion time of the jobs, where m is given in advance and the jobs arrive online over time. We assume that the jobs, which arrive at some nonnegative real times, are of equal-length and are restricted by chain precedence constraints. Moreover, the jobs arriving at distinct times are independent, and so, only the jobs arriving at a common time are restricted by the chain precedence constraints. In the literature, a best possible online algorithm of a competitive ratio 1.3028 is given for the case $$m=2$$ m = 2 . But the problem is unaddressed for $$m\ge 3$$ m ≥ 3 . In this paper, we present a best possible online algorithm for the problem with $$m\ge 3$$ m ≥ 3 , where the algorithm has a competitive ratio of 1.3028 for $$3\le m\le 5$$ 3 ≤ m ≤ 5 and 1.3146 for $$m\ge 6$$ m ≥ 6 .

Keywords: Online algorithm; Makespan; Chain precedence constraints; Competitive ratio (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0309-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:jcomop:v:36:y:2018:i:2:d:10.1007_s10878-018-0309-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0309-3

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().