A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem

Abstract

This article addresses the distributed two-stage assembly flow-shop scheduling problem (DTSAFSP) with makespan minimisation criterion. A mixed integer linear programming model is presented, and a competitive memetic algorithm (CMA) is proposed. When designing the CMA, a simple encoding scheme is proposed to represent the factory assignment and the job processing sequence; and a ring-based neighbourhood structure is designed for competition and information sharing. Moreover, some knowledge-based local search operators are developed to enhance the exploitation ability. The influence of parameter setting on the CMA is investigated using the analysis of variance method. Extensive computational tests and comparisons are carried out, which demonstrate the effectiveness of the proposed CMA in solving the DTSAFSP.

Two-Stage Assembly Scheduling with Batch Setup Times, Time-Dependent Deterioration, and Preventive Maintenance Activities Using Meta-Heuristic Algorithms

“…Let solution vectors for PAS ← 0 Begin (1) If this algorithm is SHS (2) Randomly generate an initial solution for the first iteration based on three single-dimensional arrays (3) End If (4) If this algorithm is HHS (5) Randomly generate an initial solution for the first iteration based on single-dimensional arrays (6) End If (7) Repeat (8) If this algorithm is SGA (9) Calculate the objective value through and, CMS and PPMA generated by actual sequence (10) End If (11) If this algorithm is HGA (12) Calculate the objective value through CMS and PPMA derived by MBR and (13) End If (14) Until (15) Rank by the objective value (16) Repeat (17) Repeat (18) If random probability ≤ ℎ (19) Let harmony consideration operation (20) End If (21) If random probability ≤ (22) Let pitch adjustment operation (23) End If (24) Until the size of (25)…”

“…Yan et al [9] proposed a hybrid variable neighborhood search (VNS) algorithm to minimize the weighed sum of the maximum makespan, earliness, and lateness on parallel-manufacturing machines and a single assembly machine in TSASP. Komaki et al [10] proposed an artificial immune system algorithm (AIS) to solve a two-stage hybrid flow shop followed by a single assembly machine to minimize the makespan and Deng et al [11] proposed a competitive memetic algorithm (CMA) to minimize the makespan in a parallel-manufacturing machine and a single assembly machine in TSASP. Komaki and Kayvanfar [12] proposed a grey wolf optimizer algorithm to solve the TSASP with release time in a parallel-manufacturing machine and a single assembly machine.…”

“…The constraints in (11) and (12) define the number of manufactured components at each ∈ and the cumulated number of required components, respectively.…”

An Improved Migrating Birds Optimization Algorithm for a Hybrid Flow Shop Scheduling within Steel Plants

“…Firstly, the proposed IMBO is compared with the Cplex solver and original migrating bird's optimization algorithm (MBO). To further evaluate the performance of the proposed IMBO, several other well-known algorithms are selected for comparison, including genetic algorithm (GA) [38], hybrid genetic algorithm in Tseng and Lin (GA R ) [39], memetic algorithm (MA) [40], particle swarm optimization (PSO) [41], simulated annealing (SA) [42], discrete teaching learning based optimization algorithm (DTLBO) [43], and discrete artificial bee colony algorithm (DABC) [26]. The implemented algorithms are presented in Table 4.…”

Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures

“…• Makespan: This objective was first addressed by Deng et al (2016), proposing an MILP model for the problem and a metaheuristic (Memetic algorithm).…”