A study on the method of allotment maximum processing time for scheduling flow shop problems with no in-process waiting (Part 1)

A study on the method of allotment maximum processing time for scheduling flow shop problems with no in-process waiting (Part 1)

0.00 Avg rating0 Votes
Article ID: iaor1995117
Country: Japan
Volume: 44
Issue: 3
Start Page Number: 236
End Page Number: 241
Publication Date: Aug 1993
Journal: Journal of Japan Industrial Management Association
Authors: , , ,
Keywords: planning, numerical analysis
Abstract:

According to the diversification of customer demand, the type of production system is changed from a single production line to a mixed production line. From this point of view, the rule and significance of flow-shop scheduling is greater than before. For a company like this, the development and utilization of effective scheduling are desired. In this paper, a new priority rule for the flow-shop problem of three machines with no in-process waiting, is proposed. Moreover, this method is compared with other methods for maximum flow time, utilization, idling time and blocking time. The effectiveness of this research is examined by the simulation. [In Japanese.]

Reviews

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