Optimal due date determination and sequencing of n jobs on a single machine using the SLK method
The problem of scheduling n jobs with deterministic processing times on a single machine is considered. An algorithm, by means of which the set of all optimal sequences is obtained using the SLK due date assignment method, is provided. The optimization criteria used is the minimization of the total...
Gespeichert in:
Veröffentlicht in: | Computers in industry 1993-04, Vol.21 (3), p.335-339 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The problem of scheduling n jobs with deterministic processing times on a single machine is considered. An algorithm, by means of which the set of all optimal sequences is obtained using the SLK due date assignment method, is provided. The optimization criteria used is the minimization of the total earliness and tardiness penalty. It is proven that this set can be determined without making use of the Complementary Pair and Exchange Principle concepts. |
---|---|
ISSN: | 0166-3615 1872-6194 |
DOI: | 10.1016/0166-3615(93)90030-5 |