Algorithms for single machine scheduling problem with release dates and submodular penalties

Xiaofei Liu, Man Xiao, Weidong Li, Yaoyu Zhu and Lei Ma ()
Additional contact information
Xiaofei Liu: Yunnan University
Man Xiao: Yunnan University
Weidong Li: Yunnan University
Yaoyu Zhu: Peking University
Lei Ma: Beijing Academy of Artificial Intelligence

Journal of Combinatorial Optimization, 2023, vol. 45, issue 4, No 10, 18 pages

Abstract: Abstract In this paper, we consider the single machine scheduling problem with release dates and submodular penalties, in which each job can be either assigned to the machine or rejected. The objective is to minimize the sum of the makespan of the processed jobs and the penalty of the rejected jobs which is determined by a submodular function. First, we present a simple algorithm for the off-line problem. Second, for the on-line problem, we prove that there is no on-line algorithm with a constant competitive ratio if the penalty submodular function is not monotone, and present an on-line algorithm with a competitive ratio of 3 if the penalty submodular function is monotone. Finally, we consider a special case of the on-line problem in which all jobs have the same release date. We prove that there is no on-line algorithm with a competitive ratio of $$\frac{\sqrt{5}+1}{2}\approx 1.618$$ 5 + 1 2 ≈ 1.618 , and the competitive ratio of the on-line algorithm we presented is 2.

Keywords: Scheduling problem; Submodular penalties; On-line algorithms; Competitive ratio (search for similar items in EconPapers)
Date: 2023
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-023-01032-7 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:45:y:2023:i:4:d:10.1007_s10878-023-01032-7

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

DOI: 10.1007/s10878-023-01032-7

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