MAKESPAN DISTRIBUTIONS IN FLOW SHOPS WITH MULTIPLE PROCESSORS

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.

Keywords:

• Scheduling
• Flow shop
• Makespan
• Distribution
• Heuristic