Showing 1 - 6 of 6
In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We...
Persistent link: https://www.econbiz.de/10013470830
Persistent link: https://www.econbiz.de/10014368568
Persistent link: https://www.econbiz.de/10011388362
In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We...
Persistent link: https://www.econbiz.de/10012164656
Persistent link: https://www.econbiz.de/10014295147
Persistent link: https://www.econbiz.de/10015422938