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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computers & industrial engineering Ročník 59; číslo 4; s. 794 - 798
Hlavní autori:	Ji, Min, Cheng, T.C.E.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Elsevier Ltd 01.11.2010 Pergamon Press Inc
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!