minimizing the operational costs in a flexible flow shop scheduling problem with unrelated parallel machines

This paper investigates a flexible flow shop scheduling problem with the aim of minimizing the operational costs as a new objective function. in this production system, there are some unrelated parallel machines with different performances and different technology levels in the first stage and each other stage consists of a single machine. setup times are assumed as sequencedependent and are need when a machine starts to process a new job. some of the parallel machines in the first stage are multifunctional and can do several processes on jobs. so, the jobs that are assigned to these machines do not need to be processed in some next stages. this problem is described with an example, and its parameters and decision variables are defined. then a mathematical model based on mixedinteger linear programming (mip) is developed to solve the problem in smallsized scales. as this problem is discussed in an nphard environment, the genetic algorithm (ga) is applied to solve the considered problem on practicalsized scales. due to the result, the operational costs conflict with makespan as a common objective function in scheduling problems. therefore, the supplementary analysis has been presented considering a restriction on the makespan.