Scheduling jobs with values exponentially deteriorating over time
In this paper we study a new type of single machine scheduling problem, where the critical scheduling parameter, that is job value, deteriorates exponentially over time. A heuristic algorithm for finding a sub-optimal solution of the problem and the computer program created for testing the algorithm...
Gespeichert in:
Veröffentlicht in: | International journal of production economics 2002-10, Vol.79 (3), p.163-169 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this paper we study a new type of single machine scheduling problem, where the critical scheduling parameter, that is job value, deteriorates exponentially over time. A heuristic algorithm for finding a sub-optimal solution of the problem and the computer program created for testing the algorithm are presented. The algorithm has been tested in a case of remanufacturing of PCs and it has been shown that it yields near optimal schedules. |
---|---|
ISSN: | 0925-5273 1873-7579 |
DOI: | 10.1016/S0925-5273(02)00110-X |