Hide/Show Apps

Minimizing total flow time on a single flexible machine

Karakayali, Ibrahim
Azizoğlu, Meral
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.