Reference : The tool switching problem revisited
Scientific journals : Article
Business & economic sciences : Quantitative methods in economics & management
http://hdl.handle.net/2268/616
The tool switching problem revisited
English
Crama, Yves mailto [Université de Liège - ULg > HEC - Ecole de gestion de l'ULg > Recherche opérationnelle et gestion de la production >]
Moonen, Linda S [> > > >]
Spieksma, Frits CR [> > > >]
Talloen, Ellen [> > > >]
16-Oct-2007
European Journal of Operational Research
Elsevier Science Bv
182
2
952-957
Yes (verified by ORBi)
International
0377-2217
Amsterdam
[en] complexity theory ; flexible manufacturing systems
[en] In this note we study the tool switching problem with non-uniform tool sizes. More specifically, we consider the problem where the job sequence is given as part of the input. We show that the resulting tooling problem is strongly N P-complete, even in case of unit loading and unloading costs. On the other hand, if the capacity of the tool magazine is also given as part of the input, we show that the problem is solvable in polynomial time. These results settle the complexity of a relevant variant of the tool switching problem. (C) 2006 Elsevier B.V. All rights reserved.
Researchers
http://hdl.handle.net/2268/616
10.1016/j.ejor.2006.07.028

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
EJORsubmission.pdfAuthor postprint106.08 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.