Optimal Layout Selection Using Petri Net in an Automated Assembling Shop

Abstract

In today's competitive manufacturing systems, it is crucial to respond quickly to the demand of customers and to decrease total cost of production. To achieve higher performance of automated assembling shop, it is needed to utilize methods to minimize production cycle time (makespan) and work-in-process (WIP) in buffers. This paper intends to focus on the selection of optimal layout based on allocation of machines to different locations as they can perform similar operations with different processing times. The time Petri net (TPN) has been used to illustrate the applications of proposed model in case study.