Scheduling algorithms for two-stage reentrant hybrid flow shops: minimizing makespan under the maximum allowable due dates

We consider the scheduling problem in hybrid flow shops that consist of two stages in series, each of which has multiple identical parallel machines. Each job has reentrant flow, i.e., the job visits each production stage several times. The problem is to determine the allocation of jobs to machines...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	International journal of advanced manufacturing technology Ročník 42; číslo 9-10; s. 963 - 973
Hlavní autori:	Choi, Hyun-Seon, Kim, Hyung-Won, Lee, Dong-Ho, Yoon, Junggee, Yun, Chang Yeon, Chae, Kevin B.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London Springer-Verlag 01.06.2009 Springer Nature B.V
Predmet:	Algorithms CAE) and Design Computer-Aided Engineering (CAD Engineering Industrial and Production Engineering Machine shops Mechanical Engineering Media Management Original Article Permutations Production scheduling Schedules Scheduling Reentrant hybrid flow shops Scheduling Branch and bound Heuristics
ISSN:	0268-3768, 1433-3015
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!