Showing 1 - 4 of 4
Persistent link: https://www.econbiz.de/10012308871
Persistent link: https://www.econbiz.de/10009259965
Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large...
Persistent link: https://www.econbiz.de/10011556480
Persistent link: https://www.econbiz.de/10009685686