The buffer allocation problem is an NP-hard combinatorial optimization problem, and it is an important design problem in manufacturing systems. The research proposed in this paper concerns a product line consisting of n unreliable machines with n − 1 buffers and a preventive maintenance policy. The focus of the research is to obtain a better trade-off between the buffer level ...

In this paper, we study an unreliable multi-product production/inventory system consisting of N production machines and an assembly machine. The final products are assembled-to-order whereas components are built at N separate production machines on a make-to-stock routine. The objective of our study is to develop an integrated optimal control policy that minimizes the total long-run average cos...

In this paper, we consider a buffer allocation problem in manufacturing flow lines with series-parallel network structure where nodes correspond to buffers of finite capacity, and arcs the machines. The machines are supposed be unreliable, their time failure repair assumed exponentially distributed. Different may have different production rates all deterministic. is determine capacities respect...

Engineers designing a continuous flow production line consisting of machines and buffers in series, have to determine the optimal sizes of the intermediate buffers. When the machines operating on the product are unreliable, this dimensioning decision becomes even more difficult. This paper aims to provide some insight into the optimal sizes of intermediate buffers in a continuous flow transfer ...

Buffer capacity allocation problems for flow-line manufacturing systems with unreliable machines are studied. These problems arise in a wide range of manufacturing systems and concern determining buffer capacities with respect to a given optimality criterion which can depend on the average production rate of the line, buffer cost, inventory cost, etc. Here, this problem is proven to be NP-hard ...

The availability of the machine is one of the most important assumptions on many scheduling problems under any situation. However, in most actual life manufacturing settings a machine can be unavailable for many reasons, such as unforeseen scheduled preventive. In this paper, we study scheduling flowshops problem under ’condition based’ maintenance constraints to minimize the expected makespan ...

cell formation problem mainly address how machines should be grouped and parts be processed in cells. in dynamic environments, product mix and demand change in each period of the planning horizon. incorporating such assumption in the model increases flexibility of the system to meet customer’s requirements. in this model, to ensure the reliability of the system in presence of unreliable machine...