The tool switching problem revisited

Crama, Yves; Moonen, Linda; Spieksma, Frits; Talloen, Ellen

doi:10.1016/j.ejor.2006.07.028

Cited by 24 publications

(11 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Model) and solution approaches for solving the SSP both exactly and heuristically exist. However, since the uniform SSP has already been proven to be NP-hard by Crama et al (2007), solving the SSP becomes inefficient for larger problem instances with more jobs and tools, as well as for complex problem structures. Thus, particular attention was given to meta-heuristics other than exact and classic heuristic strategies because they have been among the most promising techniques for the past three decades.…”

Section: Tool Switching Solution Methodsmentioning

confidence: 99%

The job sequencing and tool switching problem: state-of-the-art literature review, classification, and trends

Calmels

2018

International Journal of Production Research

View full text Add to dashboard Cite

The job sequencing and tool switching problem is a combinatorial optimisation problem that appears in various industries, mainly in the manufacturing sector. Although tool switching is only part of a much larger decision-making process in manufacturing systems, it has a major impact on the overall performance of the system by affecting the total set-up time as well as the machine and tool utilisation. Over the past few decades, various approaches have been applied to tool switching problems. This study provides a comprehensive review of the literature on the job sequencing and tool switching problem. Studies are identified and compared through a structured literature review and classified according to a new framework which allows the identification of problem perspectives and solution methods. The results show that current research does not fully exploit real-world situations and studies are often limited to a single-machine and uniform tool size and set-up time. Finally, this literature review summarises the current research results and provides directions for future research.. comparatively review, in an organised fashion, the existing unclassified tool switching literature with respect to problem formulation development and applied solution methods, . develop a classification scheme that may help to identify aspects of the tool switching problem that have been insufficiently explored and show how far the existing modelling efforts have progressed towards real-world needs, . synthesise the past trends of tool switching studies, and . offer some suggestions and directions for future research.The remainder of this paper is structured as follows. Section 2 introduces the generic tool switching problem, its subproblems, and related optimisation problems. Subsequently, the research approach is described in section 3, and the classification framework is described in section 4. The literature review is presented in section 5. Section 6 outlines the research gaps and implications for future research. Section 7 concludes the paper with a short summary.

show abstract

Section: Tool Switching Solution Methodsmentioning

confidence: 99%

The job sequencing and tool switching problem: state-of-the-art literature review, classification, and trends

Calmels

2018

International Journal of Production Research

View full text Add to dashboard Cite

show abstract

“…, m) and all tool switches share the same cost. Crama et al [6] generalized these results by demonstrating that the KTNS policy is still optimal in case of arbitrary setup costs b k for each tool k(k = 1, . .…”

Section: Introductionmentioning

confidence: 95%

“…Tang and Denardo [8] studied the general case and proved it is NP-Hard for c ≥ 2. Several heuristics have been proposed for the SSP (Bard [4], Tang and Denardo [8], Kiran and Krason [15], Oerlemans [18], Gray et al [12], Crama et al [6], Follonier [11], Sodhi and coworkers [1], Hertz and Widmer [14], Avci and Akturk [3], Hertz et al [13], Knuutila et al [16]). However, to our knowledge, the only exact algorithms are due to Laporte et al [17] if one excludes an Integer Linear Programming (ILP) formulation proposed by Tang and Denardo [8].…”

Section: Introductionmentioning

confidence: 99%

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

2010

View full text Add to dashboard Cite

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.

show abstract

“…In addition, the material-location selection problem deals with multiple consumable materials in which each material consists of multiple items or pallets and can be stored in multiple locations. For more details on of the tool switching problem, refer to surveys by Tang and Denardo (1988), Matzliach and Tzur (2000) and Crama et al, 2007. Finally, refer to Rouwenhorst et al (2000 and Gu et al (2007Gu et al ( , 2010 for comprehensive summaries on the current state-of-the-art for warehouse design and management.…”

Section: Introductionmentioning

confidence: 98%

The two-warehouse material location selection problem

Wutthisirisart

Sir

Noble

2015

International Journal of Production Economics

View full text Add to dashboard Cite

a b s t r a c tCompanies often require additional warehouse space due to increased demand and often the option of building a warehouse is not feasible due to a high investment cost. As a result excess inventory that cannot be stored in owned warehouses is transferred to third-party warehouses for which the company pays rent, as well as incurs labor and transportation costs for storing items and moving items back to the production site. In this situation, the company ends up with two warehouses -owned and rented. This research introduces the material location selection problem that allocates materials to these two warehouses while minimizing the total storage and transportation costs. Four material location models/ policies, each with different decision restrictions, are proposed to solve the problem from different material handling perspectives. The four models are analyzed and contrasted with each other based on data derived from a real industrial scenario. The case results show a cost savings opportunity between 20-40% due to reassigning materials between the rented and owned warehouses.

show abstract

The tool switching problem revisited

Cited by 24 publications

References 18 publications

The job sequencing and tool switching problem: state-of-the-art literature review, classification, and trends

The job sequencing and tool switching problem: state-of-the-art literature review, classification, and trends

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

The two-warehouse material location selection problem

Contact Info

Product

Resources

About