Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan

We consider a single-machine scheduling problem in which the processing time of each job is a simple linear deteriorating function of its waiting time. The machine is subject to an availability constraint. Jobs interrupted by machine unavailability can resume their processing. The objective is to mi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & industrial engineering Jg. 59; H. 4; S. 794 - 798
Hauptverfasser: Ji, Min, Cheng, T.C.E.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Elsevier Ltd 01.11.2010
Pergamon Press Inc
Schlagworte:
0–1 integer programming
Approximation
Availability
Availability constraint
Computational complexity
Deterioration
FPTAS
Industrial engineering
Integer programming
Job shops
Mathematical analysis
Optimization
Polynomials
Production scheduling
Scheduling
Studies
Time management
Availability constraint
Scheduling
FPTAS
Computational complexity
0–1 integer programming
ISSN:0360-8352, 1879-0550
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider a single-machine scheduling problem in which the processing time of each job is a simple linear deteriorating function of its waiting time. The machine is subject to an availability constraint. Jobs interrupted by machine unavailability can resume their processing. The objective is to minimize the makespan. We first show that the problem can be solved optimally by 0–1 integer programming. We then prove that the problem is NP-hard in the ordinary sense and there exists a fully polynomial time approximation scheme for it.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0360-8352
1879-0550
DOI:10.1016/j.cie.2010.08.005