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

Full description

Saved in:

Bibliographic Details
Published in:	International journal of advanced manufacturing technology Vol. 42; no. 9-10; pp. 963 - 973
Main Authors:	Choi, Hyun-Seon, Kim, Hyung-Won, Lee, Dong-Ho, Yoon, Junggee, Yun, Chang Yeon, Chae, Kevin B.
Format:	Journal Article
Language:	English
Published:	London Springer-Verlag 01.06.2009 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!