Heuristics for minimizing tool switches when scheduling part types on a flexible machine

This article considers a tool loading problem whose objective is to minimize the number of tool switches over time in order to process several parts on a flexible machine. New heuristics are presented and compared. Some of these are shown to be superior to existing methods.

[1]  Christopher S. Tang,et al.  Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches , 1988, Oper. Res..

[2]  Manbir S. Sodhi,et al.  Multiperiod tool and production assignment in flexible manufacturing systems , 1994 .

[3]  Ali S. Kiran,et al.  Automating tooling in an FMS , 1988 .

[4]  Frits C. R. Spieksma,et al.  Minimizing the number of tool switches on a flexible machine , 1994 .

[5]  M. Selim Akturk,et al.  Tool magazine arrangement and operations sequencing on CNC machines , 1996, Comput. Oper. Res..

[6]  Gilbert Laporte,et al.  New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..

[7]  Kathryn E. Stecke,et al.  A study of FMS part type selection approaches for short-term production planning , 1988 .

[8]  Kathryn E. Stecke,et al.  A synthesis of decision models for tool management in automated manufacturing , 1993 .

[9]  A. G. Oerlemans.  Production planning for flexible manufacturing systems , 1992 .

[10]  J. Bard.  A Heuristic for Minimizing the Number of Tool Switches on a Flexible Machine , 1988 .

[11]  Alain Hertz,et al.  An Improved Tabu Search Approach for Solving the Job Shop Scheduling Problem with Tooling Constraints , 1996, Discret. Appl. Math..

[12]  Kathryn E. Stecke,et al.  A flexible approach to part type selection in flexible flow systems using part mix ratios , 1991 .

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .