Due window assignment and scheduling on parallel machines: a FPTAS for a bottleneck criterion

Due window assignment and scheduling on parallel machines: a FPTAS for a bottleneck criterion

A fully polynomial time approximation scheme (FPTAS) with run time is developed for a problem which combines common due window assignment and scheduling n jobs on m identical parallel machines. The problem criterion is bottleneck (min-max) such that the maximum cost, which includes job earliness, jo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Bulletin of the Polish Academy of Sciences. Technical sciences 2014-12, Vol.62 (4), p.805-808
Hauptverfasser: Janiak, A., Janiak, W., Kovalyov, M.Y.
Format: Artikel
Sprache:eng
Schlagworte:
Approximation
Cost engineering
Criteria
due window assignment
fully polynomial time approximation scheme
Mathematical analysis
Polynomials
Scheduling
Windows (intervals)
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A fully polynomial time approximation scheme (FPTAS) with run time is developed for a problem which combines common due window assignment and scheduling n jobs on m identical parallel machines. The problem criterion is bottleneck (min-max) such that the maximum cost, which includes job earliness, job tardiness and due window size costs, is minimized.
ISSN:2300-1917
0239-7528
2300-1917
DOI:10.2478/bpasts-2014-0088