Title: The tool switching problem revisited
Authors: Crama, Y
Moonen, Linda
Spieksma, Frederik
Talloen, E
Issue Date: 2005
Publisher: K.U.Leuven - Departement toegepaste economische wetenschappen
Series Title: DTEW Research Report 0552
Abstract: In this note we study the complexity of the tool switching problem with non-uniform tool sizes. More speci cally, we consider the problem where the job sequence is given as part of the input. We show that the resulting tooling problem is strongly NP-complete, even in case of unit loading and unloading costs. However, we show that if the capacity of the tool magazine is also given as part of the input, the problem is solvable in polynomial time.
Publication status: published
KU Leuven publication type: IR
Appears in Collections:Research Center for Operations Research and Business Statistics (ORSTAT), Leuven

Files in This Item:
File Description Status SizeFormat
0552.pdf Published 117KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.