Drawing inspiration from manufacturing production processes like chemical and steel manufacturing, the distributed blocking flowshop scheduling problem with preventive maintenance and sequence-dependent setup times (DBFSP/PM/SDST) is studied. First, it is described by a mixed-integer linear programming model with the objective of minimizing the total flowtime. Second, we propose a Q-learning and learning mechanism co-driven approach, integrating it into the discrete grey wolf optimization algorithm (DGWO_Q). In the algorithm, the neighborhood search structure is adjusted using Q-learning based on dynamic feedback from the environment. The balance between exploration and exploitation can be improved by introducing learning mechanisms in the search phase that can guide the grey wolf as it approaches the prey. Furthermore, a differential hunting strategy is designed to prevent the algorithm from falling into local optima. Third, a heuristic that enhances the quality of the initial solution is proposed for the problem characteristics. Finally, the proposed DGWO_Q is compared with four conventional efficient algorithms in numerical experiments on 225 instances of different sizes. Experimental results show that the DGWO_Q algorithm demonstrates excellent performance across test cases of various scales, effectively reducing production cycle time, setup times and the impact of maintenance downtime on production efficiency. It provides an efficient intelligent optimization approach for solving the complex scheduling problem.

This study addresses the minimization of total tardiness in a hybrid flow shop scheduling problem with sequence-dependent setup times and blocking constraints. Each production stage includes multiple machines, and there are no buffers between the stages. The setup time required to process a job depends on the previously processed job. Two mixed-integer linear programming models are developed to formulate the problem. Moreover, an iterative local search algorithm and hybrid genetic algorithms are proposed to have quality solutions with minimal computational efforts. Several computational tests are conducted to tune the heuristic parameters for better performance. Computational experiments are carried out to evaluate the performance of solution methodologies in terms of quality and time. The results indicate that while mixed-integer programming models can solve small-size problem instances, they are not capable of solving large-sized instances. However, the proposed heuristic algorithms find quality solutions for all instances in a very short time.

The hybrid flow shop scheduling problem (HFSP) is an extension of the classic flow shop scheduling problem and widely exists in real industrial production systems. In real production, sequence-dependent setup times (SDST) are very important and cannot be neglected. Therefore, this study focuses HFSP with SDST (HFSP-SDST) to minimize the makespan. To solve this problem, a mixed-integer linear programming (MILP) model to obtain the optimal solutions for small-scale instances is proposed. Given the NP-hard characteristics of HFSP-SDST, an improved artificial bee colony (IABC) algorithm is developed to efficiently solve large-sized instances. In IABC, permutation encoding is used and a hybrid representation that combines forward decoding and backward decoding methods is designed. To search for the solution space that is not included in the encoding and decoding, a problem-specific local search strategy is developed to enlarge the solution space. Experiments are conducted to evaluate the effectiveness of the MILP model and IABC. The results indicate that the proposed MILP model can find the optimal solutions for small-scale instances. The proposed IABC performs much better than the existing algorithms and improves 61 current best solutions of benchmark instances.

The no-wait flow shop scheduling problem (NWFSP) plays a crucial role in the allocation of resources in multitudinous industries, including the steel, pharmaceutical, chemical, plastic, electronic, and food processing industries. The NWFSP consists of n jobs that must be processed in m machines in series, and no job is allowed to wait between consecutive operations. This project deals with NWFSP with sequence-dependent setup times for minimizing earliness and tardiness. From the literature review of the last five years in NWFSP, it is noticeable that only around 1.92% of the researchers have studied that multi-objective function, which could help to improve the productivity of industries where methods such as just in time are considered. Besides, there is no information about previous researchers that have solved this problem with sequence-dependent setup times. Firstly, a MILP model is proposed to solve small instances, and secondly, a genetic algorithm (GA) is developed as a solution method for medium and large instances. Compared with the mathematical model for small instances, the GA obtained the optimal solution in 100% of the cases. For medium and large instances, the GA improves in an average of 31.54%, 38.09%, 44.58%, 47.72%, and 37.33% the MDD, EDDP, ATC, SPT, and LPT dispatching rules, respectively.

In this paper, group scheduling problem in no-wait flexible flowshop is considered by considering two stages with group sequence-dependent setup times and random breakdown of the machines. Genetic algorithm and simulated annealing based heuristics have been proposed to solve the problem. The primary objective of scheduling is to minimize the maximum completion time of the jobs for two classes of small and large scale problems. Computational results show that both GA and SA algorithms perform properly, but SA appeared to provide better results for both small and large scale problems.