Multi-objective meta-heuristics to solve three-stage assembly flow shop scheduling problem with machine availability constraints

Abstract

In this paper, a three-stage assembly flow shop scheduling problem with machine availability constraints is taken into account. Two objectives of minimising total weighted completion times (flow time) and minimising sum of weighted tardiness and earliness are simultaneously considered. To describe this problem, a mathematical model is presented. The problem is generalisation of three-machine flow shop scheduling problem and two-stage assembly flow shop scheduling problem. Since these problems are known to be NP-hard, the considered problem is also strongly NP-hard. Therefore, two multi-objective meta-heuristics are presented to efficiently solve this problem in a reasonable amount of time. Comprehensive computational experiments are performed to illustrate the performance of the presented algorithms.