Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times

Ming Liu (), Chengbin Chu (), Yinfeng Xu () and Feifeng Zheng ()
Additional contact information
Ming Liu: Xi’an Jiaotong University
Chengbin Chu: Xi’an Jiaotong University
Yinfeng Xu: Xi’an Jiaotong University
Feifeng Zheng: Xi’an Jiaotong University

Journal of Combinatorial Optimization, 2011, vol. 21, issue 1, No 9, 138-149

Abstract: Abstract We study the problem of semi-online scheduling on 2 machines under a grade of service (GoS). GoS means that some jobs have to be processed by some machines to be guaranteed a high quality. The problem is online in the sense that jobs are presented one by one, and each job shall be assigned to a time slot on its arrival. Assume that the processing time p i of every job J i is bounded by an interval [a,α a], where a>0 and α>1 are two constant numbers. By knowing the bound of jobs’ processing times, we denote it by semi-online problem. We deal with two semi-online problems. The first one concerns about bounded processing time constraint. First, we show that a lower bound of competitive ratio is: (1) $\frac{1+\alpha}{2}$ in the case where 1

Keywords: Online scheduling; Makespan; Competitive analysis; Grade of service; Bounded processing times; Total processing time (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-009-9231-z 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:21:y:2011:i:1:d:10.1007_s10878-009-9231-z

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

DOI: 10.1007/s10878-009-9231-z

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 ().