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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research Jg. 198; H. 3; S. 975 - 978
Hauptverfasser: Zhang, Liqi, Lu, Lingfa, Yuan, Jinjiang
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 01.11.2009
Elsevier
Elsevier Sequoia S.A
Schriftenreihe:European Journal of Operational Research
Schlagworte:
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
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2008.10.006