A heuristic job-shop scheduling algorithm to minimize the total holding cost of completed and in-process products subject to no tardy jobs

Meeting due dates is the most important goal of scheduling if the due date of each job has been promised to its customer. This paper considers the job-shop scheduling problem of minimizing the total holding cost of completed and in-process products subject to no tardy jobs. A heuristic algorithm bas...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of production economics Jg. 101; H. 1; S. 19 - 29
Hauptverfasser: Ohta, Hiroshi, Nakatani, Toshihiro
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 01.05.2006
Elsevier
Elsevier Sequoia S.A
Schriftenreihe:International Journal of Production Economics
Schlagworte:
Benchmarks
Due-date constraints
Heuristic
Heuristics
Holding cost
Job shops
Job-shop scheduling
Management science
Production costs
Scheduling
Scheduling algorithms
Shifting bottleneck procedure
Due-date constraints
Shifting bottleneck procedure
Heuristics
Holding cost
Job-shop scheduling
ISSN:0925-5273, 1873-7579
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Meeting due dates is the most important goal of scheduling if the due date of each job has been promised to its customer. This paper considers the job-shop scheduling problem of minimizing the total holding cost of completed and in-process products subject to no tardy jobs. A heuristic algorithm based on the shifting bottleneck procedure is proposed for solving the minimum total holding cost problem subject to no tardy jobs. Several benchmark problems which are commonly used for job-shop scheduling problems of minimizing the makespan are solved by the proposed method and the results are reported.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0925-5273
1873-7579
DOI:10.1016/j.ijpe.2005.05.004