INTERNATIONAL JOURNAL OF FLEXIBLE MANUFACTURING SYSTEMS, vol.18, no.1, pp.55-73, 2006 (Journal Indexed in SCI)
Article / Article
Title of Journal :
INTERNATIONAL JOURNAL OF FLEXIBLE MANUFACTURING SYSTEMS
In this study, we address a job sequencing and tool switching problem arising in flexible manufacturing systems. We consider the single machine problem of minimizing total flow time. We prove that the problem is NP-hard in the strong sense and show that the tool switching problem is polynomially solvable for a given sequence.