Solving the Job Sequencing and Tool Switching Problem as a nonlinear least cost Hamiltonian cycle problem

In the Job Sequencing and Tool Switching Problem, a number of part types, each requiring a set of tools, are to be manufactured on a single flexible machine with a capacitated tool magazine. The SSP aims at determining the processing sequence as well as the tools present in the magazine for each part, to minimize the total number of tools switches. In this article, we cast the SSP as a nonlinear least cost Hamiltonian cycle problem. A branch-and-cut algorithm is proposed and compared with previous exact procedures. Computational results indicate that the algorithm is able to solve much larger instances than those reported in the literature. © 2010 Wiley Periodicals, Inc. NETWORKS, 2010

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

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

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

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

[5]  Giovanni Rinaldi,et al.  Facet identification for the symmetric traveling salesman polytope , 1990, Math. Program..

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

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

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

[9]  Timo Knuutila,et al.  Grouping of PCB assembly jobs in the case of flexible feeder units , 2005 .

[10]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem , 1997, Oper. Res..

[11]  G. Laporte,et al.  Heuristics for minimizing tool switches when scheduling part types on a flexible machine , 1998 .

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

[13]  GILBERT LAPORTE,et al.  Exact algorithms for the job sequencing and tool switching problem , 2002 .

[14]  Gerd Finke,et al.  k-server problems with bulk requests: an application to tool switching in manufacturing , 2000, Ann. Oper. Res..

[15]  Frits C. R. Spieksma,et al.  The tool switching problem revisited , 2007, Eur. J. Oper. Res..