The tool transporter movements problem in flexible manufacturing systems

摘要

We consider a job sequencing and tool transporter movements problem on a single flexible machine with limited tool magazine capacity. A tool transporter having limited capacity is used in transporting the tools between the machine and tool crib area. Our aim is to minimize the number of the tool transporter movements. We present several lower and upper bounds, propose a Branch-and-Bound algorithm and a Beam Search procedure, and report results from a computational experiment. We find that optimal solutions can be quickly obtained for medium-sized instances with 25 jobs and 25 tools. For large-sized problem instances, Beam Search provides high quality solutions very quickly. Finally, we address the problem of minimizing the total flow time.