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

Full description

Saved in:
Bibliographic Details
Published inInternational journal of production economics Vol. 101; no. 1; pp. 19 - 29
Main Authors Ohta, Hiroshi, Nakatani, Toshihiro
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.05.2006
Elsevier
Elsevier Sequoia S.A
SeriesInternational Journal of Production Economics
Subjects
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
Online AccessGet full text
ISSN0925-5273
1873-7579
DOI10.1016/j.ijpe.2005.05.004

Cover

More Information
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0925-5273
1873-7579
DOI:10.1016/j.ijpe.2005.05.004