Integrated Production and Transportation Scheduling Method in Hybrid Flow Shop

Abstract

The connection between production scheduling and transportation scheduling is getting closer in smart manufacturing system, and both of those problems are summarized as NP-hard problems. However, only a few studies have considered them simultaneously. This paper solves the integrated production and transportation scheduling problem (IPTSP) in hybrid flow shops, which is an extension of the hybrid flow shop scheduling problem (HFSP). In addition to the production scheduling on machines, the transportation scheduling process on automated guided vehicles (AGVs) is considered as another optimization process. In this problem, the transfer tasks of jobs are performed by a certain number of AGVs. To solve it, we make some preparation (including the establishment of task pool, the new solution representation and the new solution evaluation), which can ensure that satisfactory solutions can be found efficiently while appropriately reducing the scale of search space. Then, an effective genetic tabu search algorithm is used to minimize the makespan. Finally, two groups of instances are designed and three types of experiments are conducted to evaluate the performance of the proposed method. The results show that the proposed method is effective to solve the integrated production and transportation scheduling problem.

Multi-objective optimization of dual resource integrated scheduling problem of production equipment and RGVs considering conflict-free routing

“…Yao [ 9 ] proposed an intelligent AGV management system that maximizes accurate delivery performance and minimizes AGV energy consumption under disturbance by establishing a mixed integer nonlinear programming model supported by IoT production data. Li [ 10 ] proposed a genetic tabu search algorithm to solve the minimum maximum completion time of integrated scheduling of production and transportation, and proved its effectiveness through the results. Yan [ 11 ] analyzed the coupling relationship between the transportation and the processing stage and established the scheduling model under the limited transportation conditions given the constraints of the limited transportation.…”

Research on Production Scheduling Technology in Knitting Workshop Based on Improved Genetic Algorithm

“…More efforts have been made in applying heuristic and metaheuristic algorithms to solve HFSP. The combination and improvement of algorithms to address the search capability and search speed of the algorithm is an effective way to solve the HFSP [33]. However, there is still a shortage of research in the application area of knitting shops, and the efforts of related scholars are still required.…”

A Matheuristic Approach for the No-Wait Flowshop Scheduling Problem with Makespan Criterion

“…, , T T T .Then the evolution process can be seen in Figure 8. The indices of points (1, 2), (3,4), (10,11) in the sequence are respectively recorded as 1 2 3…”

“…Take out the element pointed to by the iterator itRS7, that is (T 1 , T 2 , T 3 ).Then the evolution process can be seen in Figure 8. The indices of points (1, 2), (3,4), (10,11) in the sequence are respectively recorded as T 1 , T 2 , T 3 . In Figure 6, (T…”

“…Production scheduling can meet that need, so it is used in manufacturing systems extensively. Considering the differences in factory conditions and job processing requirements, the scheduling problem has been divided into several kinds, such as flow shop [1,2], hybrid flow shop [3,4], job shop [5,6], open shop [7,8], and so on. The flow shop problem (FSP) claims that each job should be processed in the same order through every stage, and the hybrid flow shop refers to parallel machines at one or more stages.…”