On-line production order scheduling with preemption penalties

Feifeng Zheng (), Yinfeng Xu () and E. Zhang ()
Additional contact information
Feifeng Zheng: Xi’an JiaoTong University
Yinfeng Xu: Xi’an JiaoTong University
E. Zhang: Shanghai University of Finance and Economics

Journal of Combinatorial Optimization, 2007, vol. 13, issue 2, No 7, 189-204

Abstract: Abstract This paper studies the on-line production order scheduling problem where each preemption causes a penalty, and the objective is to maximize the net profit, i.e., the total weights of completed orders minus the total penalties caused by preemptions. Two greedy strategies are shown to be at best $$O(\Delta^2)$$ and $$(4\Delta+2\Delta\sqrt{4+1/\Delta}+1)$$ -competitive respectively, where Δ is the ratio between the longest and shortest length of order. After that we mainly present an improved strategy, named WAL, which takes advantage of the knowledge of Δ and is proved to be $$\left(3\Delta + o(\Delta)\right)$$ -competitive for Δ > 9. Furthermore, two lower bounds for deterministic strategies, $$(1.366\Delta + 0.366)$$ and 6.33, are given for the cases of nonuniform and uniform length respectively.

Keywords: On-line scheduling; Preemption penalty; Competitive strategy; Competitive ratio (search for similar items in EconPapers)
Date: 2007
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-006-9027-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:13:y:2007:i:2:d:10.1007_s10878-006-9027-3

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

DOI: 10.1007/s10878-006-9027-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 ().