Task Scheduling Problem of Double-Deep Multi-Tier Shuttle Warehousing Systems

Zhan, Xiangnan; Xu, Liyun; Ling, Xufeng

doi:10.3390/pr9010041

Cited by 8 publications

(3 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the early stage, the constructive approach, widely known as NEH [10], is probably the one mostly refined and modified by other authors [11]. On the other hand, many meta-heuristics and their modified approaches have been applied to solve FSSP, such as particle swarm optimization [12,13], simulated annealing [14], genetic algorithm [13,15,16], ant colony optimization [7], and firefly algorithm [17].…”

Section: Introductionmentioning

confidence: 99%

Optimization of No-Wait Flowshop Scheduling Problem in Bakery Production with Modified PSO, NEH and SA

et al. 2021

View full text Add to dashboard Cite

In bakery production, to perform a processing task there might be multiple alternative machines that have the same functionalities. Finding an efficient production schedule is challenging due to the significant nondeterministic polynomial time (NP)-hardness of the problem when the number of products, processing tasks, and alternative machines are higher. In addition, many tasks are performed manually as small and medium-size bakeries are not fully automated. Therefore, along with machines, the integration of employees in production planning is essential. This paper presents a hybrid no-wait flowshop scheduling model (NWFSSM) comprising the constraints of common practice in bakeries. The schedule of an existing production line is simulated to examine the model and is optimized by performing particle swarm optimization (PSO), modified particle swarm optimization (MPSO), simulated annealing (SA), and Nawaz-Enscore-Ham (NEH) algorithms. The computational results reveal that the performance of PSO is significantly influenced by the weight distribution of exploration and exploitation in a run time. Due to the modification to the acceleration parameter, MPSO outperforms PSO, SA, and NEH in respect to effectively finding an optimized schedule. The best solution to the real case problem obtained by MPSO shows a reduction of the total idle time (TIDT) of the machines by 12% and makespan by 30%. The result of the optimized schedule indicates that for small- and medium-sized bakery industries, the application of the hybrid NWFSSM along with nature-inspired optimization algorithms can be a powerful tool to make the production system efficient.

show abstract

Section: Introductionmentioning

confidence: 99%

Optimization of No-Wait Flowshop Scheduling Problem in Bakery Production with Modified PSO, NEH and SA

et al. 2021

View full text Add to dashboard Cite

show abstract

“…The exponential computational complexity arises from determining optimal job sequences and machine selection for the interdependent transporting and storing subtasks between elevators and four-way shuttles. To address this, this paper draws from well-established research on flow-shop-scheduling problems [33]. The flexible flow-shop-scheduling problem (FFSP), which is challenging to solve using exact algorithms, is an NP-Hard issue, as Wang et al [34] have demonstrated.…”

Section: Literature Reviewmentioning

confidence: 99%

Research on Inbound Jobs’ Scheduling in Four-Way-Shuttle-Based Storage System

Wu,

Zhang,

et al. 2024

Processes

View full text Add to dashboard Cite

The four-way-shuttle-based storage and retrieval system is a recent innovative intelligent vertical warehousing system that has been widely applied in manufacturing and e-commerce environments due to its high flexibility and density. As a complex multi-device cooperative operational system, this system features the parallel operation of multiple elevators and four-way shuttles. During large-scale-batch inbound operations, the quality of scheduling solutions for inbound-operation equipment significantly impacts the system’s efficiency and performance. In this paper, a detailed analysis of the inbound-operation process in the system is conducted, taking into consideration the motion characteristics of both the elevators and four-way shuttles. Furthermore, we establish operational time constraints that account for equipment acceleration and deceleration characteristics and introduce a flexible flow-shop-scheduling model to address the scheduling problem in the system. Additionally, we propose an improved genetic algorithm based on double-layer encoding to solve this problem. Comparative experiments with a traditional genetic algorithm and ant-colony algorithm demonstrate the superior efficiency and accuracy of our approach. Finally, the effectiveness of the proposed algorithm is validated through comparisons with large-scale practical experiments.

show abstract

“…To address the efficiency issues of AGV operations, Dijkstra initially proposed research related to the shortest paths of AGVs [2] . Subsequently, various path algorithms for AGVs have been continuously explored, and domestic researchers have put forward some theoretical viewpoints on path algorithms.…”

Section: Introductionmentioning

confidence: 99%

Research on Shortest Path BFS Strategy in Multi-AGV Scheduling System

Deng,

2024

JERA

View full text Add to dashboard Cite

With the increasing maturity of automated guided vehicles (AGV) technology and the widespread application of flexible manufacturing systems, enhancing the efficiency of AGVs in complex environments has become crucial. This paper analyzes the challenges of path planning and scheduling in multi-AGV systems, introduces a map-based path search algorithm, and proposes the BFS algorithm for shortest path planning. Through optimization using the breadth-first search (BFS) algorithm, efficient scheduling of multiple AGVs in complex environments is achieved. In addition, this paper validated the effectiveness of the proposed method in a production workshop experiment. The experimental results show that the BFS algorithm can quickly search for the shortest path, reduce the running time of AGVs, and significantly improve the performance of multi-AGV scheduling systems.

show abstract

Task Scheduling Problem of Double-Deep Multi-Tier Shuttle Warehousing Systems

Cited by 8 publications

References 36 publications

Optimization of No-Wait Flowshop Scheduling Problem in Bakery Production with Modified PSO, NEH and SA

Optimization of No-Wait Flowshop Scheduling Problem in Bakery Production with Modified PSO, NEH and SA

Research on Inbound Jobs’ Scheduling in Four-Way-Shuttle-Based Storage System

Research on Shortest Path BFS Strategy in Multi-AGV Scheduling System

Contact Info

Product

Resources

About