Online tradeoff scheduling on a single machine to minimize makespan and total weighted completion time

Ran Ma and Jinjiang Yuan

International Journal of Production Economics, 2014, vol. 158, issue C, 114-119

Abstract: In this paper we introduce the concept of online tradeoff scheduling to minimize two objective functions f1 and f2 simultaneously. An online algorithm A is called (ρ1,ρ2)-competitive for minimizing f1 and f2 if A is ρ1-competitive for minimizing f1 and ρ2-competitive for minimizing f2. A (ρ1,ρ2)-competitive online algorithm A is called nondominated if there is no other (ρ1′,ρ2′)-competitive online algorithm A′ such that (ρ1′,ρ2′)≤(ρ1,ρ2) and either ρ1′<ρ1 or ρ2′<ρ2.

Keywords: Scheduling; Online algorithms; Tradeoff; Makespan; Total weighted completion time (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925527314002448
Full text for ScienceDirect subscribers only

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:eee:proeco:v:158:y:2014:i:c:p:114-119

DOI: 10.1016/j.ijpe.2014.07.027

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().