Optimal rate allocation in unreliable, assembly/disassembly production networks with blocking

Author

Kouikoglou, Vassilis S.

Author_Institution

Dept. of Production Eng. & Manage., Tech. Univ. of Crete, Chania, Greece

Volume

16

Issue

4

fYear

2000

fDate

8/1/2000 12:00:00 AM

Firstpage

429

Lastpage

434

Abstract

We consider finite-buffered production networks, in which each machine is capable of performing a single assembly and/or disassembly operation and it is subject of operation-dependent failures. We address the problem of allocating processing and repair rates to each machine so as to maximize the throughput of the system. This problem is shown to be equivalent to a convex minimization problem. The optimal allocation is found using a steepest-descent algorithm that employs discrete-event simulation for performance evaluation and gradient estimation

Keywords

assembling; convex programming; directed graphs; minimisation; production control; reliability theory; blocking; convex minimization; discrete-event simulation; finite-buffered production networks; gradient estimation; operation-dependent failures; optimal rate allocation; performance evaluation; processing rate allocation; repair rate allocation; steepest-descent algorithm; throughput maximization; unreliable assembly/disassembly production networks; Assembly systems; Computational modeling; Costs; Discrete event simulation; Intelligent networks; Manufacturing systems; Optimization methods; Production systems; Resource management; Throughput;

fLanguage

English

Journal_Title

Robotics and Automation, IEEE Transactions on

Publisher

ieee

ISSN

1042-296X

Type

jour

DOI

10.1109/70.864238

Filename

864238