Single-machine online scheduling of jobs with non-delayed processing constraint

Wenjie Li () and Jinjiang Yuan
Additional contact information
Wenjie Li: Luoyang Normal University
Jinjiang Yuan: Zhengzhou University

Journal of Combinatorial Optimization, 2021, vol. 41, issue 4, No 4, 830-843

Abstract: Abstract This paper introduces a new environment of online scheduling in which jobs are scheduled under the non-delayed processing (NDP) constraint, where NDP means that the available jobs cannot be delayed for processing when some machine is idle. We study in this paper the single-machine online scheduling to minimize the maximum weighted completion time ( $${\textit{WC}}_{\mathrm{max}}$$ WC max ) or the maximum delivery completion time ( $$L_{\mathrm{max}}$$ L max ) under the NDP constraint. For the first problem, we establish a lower bound 2 and provide an online algorithm which has a competitive ratio of $$(3+\sqrt{5})/2\approx 2.618$$ ( 3 + 5 ) / 2 ≈ 2.618 . We present a 3/2-competitive best possible online algorithm for the second problem.

Keywords: Online scheduling; Weighted completion time; Delivery time; Non-delayed processing (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00722-4 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:41:y:2021:i:4:d:10.1007_s10878-021-00722-4

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

DOI: 10.1007/s10878-021-00722-4

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