Showing 1 - 10 of 12
Persistent link: https://www.econbiz.de/10003891482
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/10009775729
Persistent link: https://www.econbiz.de/10010219785
Persistent link: https://www.econbiz.de/10003910893
Persistent link: https://www.econbiz.de/10003689842
Persistent link: https://www.econbiz.de/10003699190
Persistent link: https://www.econbiz.de/10012112293
Persistent link: https://www.econbiz.de/10011747921
Persistent link: https://www.econbiz.de/10012172920