Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness

Qijia Liu () and Jinjiang Yuan
Additional contact information
Qijia Liu: Zhengzhou University
Jinjiang Yuan: Zhengzhou University

Journal of Combinatorial Optimization, 2016, vol. 32, issue 2, No 5, 385-395

Abstract: Abstract In this paper, we consider the following single machine online tradeoff scheduling problem. A set of n independent jobs arrive online over time. Each job $$J_{j}$$ J j has a release date $$r_{j}$$ r j , a processing time $$p_{j}$$ p j and a delivery time $$q_{j}$$ q j . The characteristics of a job are unknown until it arrives. The goal is to find a schedule that minimizes the makespan $$C_{\max } = \max _{1 \le j \le n} C_{j}$$ C max = max 1 ≤ j ≤ n C j and the maximum lateness $$L_{\max } = \max _{1 \le j \le n} L_{j}$$ L max = max 1 ≤ j ≤ n L j , where $$L_{j} = C_{j} + q_{j}$$ L j = C j + q j . For the problem, we present a nondominated $$( \rho , 1 + \displaystyle \frac{1}{\rho } )$$ ( ρ , 1 + 1 ρ ) -competitive online algorithm for each $$\rho $$ ρ with $$ 1 \le \rho \le \displaystyle \frac{\sqrt{5} + 1}{2}$$ 1 ≤ ρ ≤ 5 + 1 2 .

Keywords: Single machine scheduling; Online algorithms; Competitive ratio; Bicriteria optimization (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9918-2 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:32:y:2016:i:2:d:10.1007_s10878-015-9918-2

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

DOI: 10.1007/s10878-015-9918-2

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