Approximation Algorithm for the Single Machine Scheduling Problem with Release Dates and Submodular Rejection Penalty

In this paper, we consider the single machine scheduling problem with release dates and nonmonotone submodular rejection penalty. We are given a single machine and multiple jobs with probably different release dates and processing times. For each job, it is either accepted and processed on the machi...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Mathematics (Basel) Ročník 8; číslo 1; s. 133
Hlavní autori: Liu, Xiaofei, Li, Weidong
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Basel MDPI AG 01.01.2020
Predmet:
Algorithms
Approximation
approximation algorithm
Combinatorial analysis
Design
Fines & penalties
Job shops
Mathematical analysis
Polynomials
Rejection
Release dates
Scheduling
submodular rejection penalty
ISSN:2227-7390, 2227-7390
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, we consider the single machine scheduling problem with release dates and nonmonotone submodular rejection penalty. We are given a single machine and multiple jobs with probably different release dates and processing times. For each job, it is either accepted and processed on the machine or rejected. The objective is to minimize the sum of the makespan of the accepted jobs and the rejection penalty of the rejected jobs which is determined by a nonmonotone submodular function. We design a combinatorial algorithm based on the primal-dual framework to deal with the problem, and study its property under two cases. For the general case where the release dates can be different, the proposed algorithm have an approximation ratio of 2. When all the jobs release at the same time, the proposed algorithm becomes a polynomial-time exact algorithm.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2227-7390
2227-7390
DOI:10.3390/math8010133