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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	International journal of production economics Ročník 101; číslo 1; s. 19 - 29
Hlavní autori:	Ohta, Hiroshi, Nakatani, Toshihiro
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 01.05.2006 Elsevier Elsevier Sequoia S.A
Edícia:	International Journal of Production Economics
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!