Mirabi, Mohammad; Fatemi Ghomi, S. M. T.; Jolai, F. - In: Journal of industrial engineering international 10 (2014), pp. 1-9
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...