TY - JOUR
ID - 679323
TI - Minimizing the operational costs in a flexible flow shop scheduling problem with unrelated parallel machines
JO - Journal of Optimization in Industrial Engineering
JA - JOIE
LA - en
SN - 2251-9904
AU - Hosseini, Seyed Mohamad Hasan
AU - Hassani, Ali
AU - Behroozi, Foroogh
AD - Department on industrial engineering and management, Shahrood university of technology, Shahrood, Iran.
AD - Department of Engineering, Alzahra University, Tehran, Iran.
Y1 - 2021
PY - 2021
VL - 14
IS - 1
SP - 169
EP - 184
KW - Scheduling
KW - Flexible flow shop
KW - Unrelated parallel machines
KW - Operational costs
DO - 10.22094/joie.2021.1890852.1718
N2 - 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 sequence-dependent 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 mixed-integer linear programming (MIP) is developed to solve the problem in small-sized scales. As this problem is discussed in an Np-hard environment, the Genetic Algorithm (GA) is applied to solve the considered problem on practical-sized 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.
UR - http://www.qjie.ir/article_679323.html
L1 - http://www.qjie.ir/article_679323_098ec7f2233b16a68206cfd656bca4b1.pdf
ER -