Semi-online scheduling with known maximum job size on two uniform machines

Qian Cao and Zhaohui Liu ()
Additional contact information
Qian Cao: East China University of Science and Technology
Zhaohui Liu: East China University of Science and Technology

Journal of Combinatorial Optimization, 2010, vol. 20, issue 4, No 4, 369-384

Abstract: Abstract In this paper, we investigate the semi-online scheduling problem with known maximum job size on two uniform machines with the speed ratio s≥1. The objective is to minimize the makespan. Two algorithms are presented, where the first is optimal for $1\leq s\leq\sqrt{2}$ , and the second is optimal for 1.559≤s≤2 and $s\ge \frac{3+\sqrt{17}}{2}$ . In addition, the improvement on lower bounds is made for $2

Keywords: Scheduling; Uniform machines; Semi-online (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-009-9214-0 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:20:y:2010:i:4:d:10.1007_s10878-009-9214-0

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

DOI: 10.1007/s10878-009-9214-0

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