S. M. Mousavia, M. Zandiehb
Intelligent Automation & Soft Computing, Vol.24, No.1, pp. 9-16, 2018, DOI:10.1080/10798587.2016.1261956
Abstract This paper considers the problem of scheduling n independent jobs in g-stage hybrid flow shop
environment. To address the realistic assumptions of the proposed problem, two additional traits
were added to the scheduling problem. These include setup times, and the consideration of maximum
completion time together with total tardiness as objective function. The problem is to determine
a schedule that minimizes a convex combination of objectives. A procedure based on hybrid the
simulated annealing; genetic algorithm and local search so-called HSA-GA-LS are proposed to handle
this problem approximately. The performance of the proposed algorithm is More >
Login
Register
