Single machine scheduling with release dates and rejection

In this paper, we consider the single machine scheduling problem with release dates and rejection. A job is either rejected, in which case a rejection penalty has to be paid, or accepted and processed on the machine. The objective is to minimize the sum of the makespan of the accepted jobs and the t...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 198; číslo 3; s. 975 - 978
Hlavní autoři: Zhang, Liqi, Lu, Lingfa, Yuan, Jinjiang
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 01.11.2009
Elsevier
Elsevier Sequoia S.A
Edice:European Journal of Operational Research
Témata:
Algorithms
Applied sciences
Approximation
Exact sciences and technology
Fully polynomial-time approximation scheme
Inventory control, production control. Distribution
Job shops
Operational research and scientific management
Operational research. Management science
Production scheduling
Rejection penalty
Release dates
Scheduling
Scheduling Rejection penalty Fully polynomial-time approximation scheme
Scheduling, sequencing
Studies
Fully polynomial-time approximation scheme
Scheduling
Rejection penalty
Rejection
scheme
Polynomial approximation
NP hard problem
Makespan
Polynomial method
Approximation algorithm
Fully polynomial-time approximation
Single machine
Polynomial time
ISSN:0377-2217, 1872-6860
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we consider the single machine scheduling problem with release dates and rejection. A job is either rejected, in which case a rejection penalty has to be paid, or accepted and processed on the machine. The objective is to minimize the sum of the makespan of the accepted jobs and the total rejection penalty of the rejected jobs. We show that the problem is NP-hard in the ordinary sense. Then we provide two pseudo-polynomial-time algorithms. Consequently, two special cases can be solved in polynomial-time. Finally, a 2-approximation algorithm and a fully polynomial-time approximation scheme are given for the problem.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2008.10.006