Hybrid flow shop with multiprocessor task scheduling based on earliness and tardiness penalties

Abstract

Purpose Hybrid flow shop with multiprocessor task (HFSMT) has received considerable attention in recent years. The purpose of this paper is to consider an HFSMT scheduling under the environment of a common time window. The window size and location are considered to be given parameters. The research deals with the criterion of total penalty cost minimization incurred by earliness and tardiness of jobs. In this research, a new memetic algorithm in which a global search algorithm is accompanied with the local search mechanism is developed to solve the HFSMT with jobs having a common time window. The operating parameters of memetic algorithm have an important role on the quality of solution. In this paper, a full factorial experimental design is used to determining the best parameters of memetic algorithm for each problem type. Memetic algorithm is tested using HFSMT problems. Design/methodology/approach First, hybrid flow shop scheduling system and hybrid flow shop scheduling with multiprocessor task are defined. The applications of the hybrid flow shop system are explained. Also the background of hybrid flow shop with multiprocessor is given in the introduction. The features of the proposed memetic algorithm are described in Section 2. The experiment results are presented in Section 3. Findings Computational experiments show that the proposed new memetic algorithm is an effective and efficient approach for solving the HFSMT under the environment of a common time window. Originality/value There is only one study about HFSMT scheduling with time window. This is the first study which added the windows to the jobs in HFSMT problems.