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 in:	International journal of production economics Vol. 101; no. 1; pp. 19 - 29
Main Authors:	Ohta, Hiroshi, Nakatani, Toshihiro
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.05.2006 Elsevier Elsevier Sequoia S.A
Series:	International 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
ISSN:	0925-5273, 1873-7579
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!