Scheduling in a group technology flow shop with identical processing time on each machine

Scheduling in a group technology flow shop with identical processing time on each machine

0.00 Avg rating—0 Votes
Article ID: iaor2005524
Country: China
Volume: 12
Issue: 2
Start Page Number: 53
End Page Number: 55
Publication Date: Apr 2003
Journal: Operations Research and Management Science
Authors: ,
Keywords: group technology
Abstract:

This paper concerns a scheduling problem in an m-machine flow shop with identical processing times on each machine. The objective function is to minimize total completion time. Ths problem can be solved by a polynomial algorithm.

Reviews

Required fields are marked *. Your email address will not be published.