Multi-Objective Hybrid Flow-Shop Scheduling in Parallel Sequential Mode While Considering Handling Time and Setup Time

Abstract

Hybrid flow-shop scheduling based on the parallel sequential movement mode (HFSP-PSMM) is an extended application of hybrid flow-shop scheduling that ensures that the equipment works continuously during the processing cycle. However, current research has only investigated the flow-shop scheduling of single-equipment processing, and ignores the effect of auxiliary time. Therefore, this paper investigates a multi-equipment hybrid flow-shop scheduling problem based on the parallel sequential movement mode and considers the setup time and handling time. The mathematical model of the HFSP-PSMM was developed with the handling and makespan numbers as the optimization objectives. The NSGA-II-V based on the NSGA-II was designed by combining the problem characteristics. New crossover, mutation, and selection strategies were proposed and variable neighborhood search operations were implemented for the optimal set of Pareto solutions. Finally, through an algorithm comparison, performance testing, and an example simulation, the effectiveness of the NSGA-II-V for solving the HFSP-PSMM was verified.

Research on Flexible Job Shop Scheduling Problem with Handling and Setup Time Based on Improved Discrete Particle Swarm Algorithm

“…Figure 1 is a schematic diagram of multi-equipment work centers; each manufacturing work center contains at least one piece of equipment, and each processing equipment work center can complete at least different processes for any workpiece in the MTO. Multiple pieces of equipment in the processing equipment work center can be completely related (that is, they complete all processes of the same work piece) or unrelated (that is, the work piece is not necessarily completed by the current multi-equipment work center) [14]. The workpiece needs to be transferred between different processing equipment work centers by means of the equipment of the handling work center, which can include vehicles, handling robots, etc., and the number of workpieces to be transported by handling equipment is greater than or equal to 1.…”

“…Li and Lei [13] consider the energy-efficient flexible job shop scheduling problem with transportation and sequence-dependent setup times, and an imperialist competitive algorithm with feedback (FICA) is developed to minimize makespan, total tardiness, and total energy consumption simultaneously. On the basis of considering factors such as adjustment time and handling time, Feng and Kong [14] proposed an NSGA-II-V algorithm to solve the multi-equipment work center scheduling problem with the optimization objective of minimizing the maximum completion time and handling times. In addition, in the swarm intelligence (SI) field, the results of algorithm research and improvement are more outstanding.…”

Research on Multi-Objective Flexible Job Shop Scheduling Problem with Setup and Handling Based on an Improved Shuffled Frog Leaping Algorithm

“…(9) When the same machine successively processes two different types of jobs that are different, it needs to have a setup time before processing. (10) The handling capacity of each handling equipment is not limited, and the number of handling equipment is not limited.…”

“…The multi-agent system approach has also been found to converge faster than the comparison algorithms. On the basis of considering the adjustment time and processing time, Feng and Kong [10] proposed a scheduling problem of multi-equipment work centers with the goal of minimizing the makespan.…”

Batch Scheduling for Work Centers with Multiple Manufacturing Machines under the Parallel-Sequence-transfer Mode

“…Moreover, the term of work center is a very significant concept in ERP system [4,5]. Hence, there are a large number of research achievements on the scheduling of work center [6,7]. The research achievements in the aspects of scheduling are as follows: Huo and Zhao [8] addressed a preemptive bi-criteria scheduling problem for m parallel machines with the objective of minimizing the total completing time subjecting to the makespan constraint.…”