Abstract
We consider an assembly/disassembly production network with finite buffers, unreliable machines, and a number of skilled operators and repairmen. Each machine is capable of performing a single, assembly and/or disassembly operation. We assume that the processing and repair times at each machine are exponentially distributed and their rates depend on the number of operators and repairmen assigned to that machine. The problem is to allocate work force 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 and discrete-event simulation for performance evaluation and gradient estimation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
