Abstract
ABSTRACT The makespan distributions in a flow shop with multiple processors (FSMP) are investigated in this study. The FSMP problem is characterized as the processing of n job through an m stage flow shop, where there exists one or more processors at each stage. Since it is known that the minimum makespan FSMP problem is computationally explosive, it was necessary to investigate the distribution of makespans in FSMP in order to provide guidance to the FSMP research. Results of this study may help gain a better understanding of the FSMP makespan problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of the Chinese Institute of Industrial Engineers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
