Bus Manufacturing Workshop Scheduling Method with Routing Buffer
Zhonghua Han, Jingyuan Zhang, Xiaoting Dong, Yuanwei Qi

TL;DR
This paper introduces a mathematical programming model and a new moving approach to optimize bus scheduling in manufacturing workshops with routing buffers, reducing setup times and improving overall efficiency.
Contribution
It presents a novel routing buffer scheduling model and an optimized moving method that outperforms traditional approaches in minimizing setup costs and total completion time.
Findings
The proposed method reduces total setup time compared to traditional methods.
It achieves better scheduling optimization with minimized maximum total completion time.
The approach effectively guides bus movement in routing buffers for improved efficiency.
Abstract
Aiming at solving the problem that the moving route is complicated and the scheduling is difficult in the routing buffer of the bus in the manufacturing workshop, a routing buffer mathematical programming model for bus manufacturing workshop is proposed. We design a moving approach for minimizing the total setup cost for moving in routing buffer. The framework and the solution ofthe optimization problem of such a bus manufacturing workshop scheduling with routing buffer arepresented. The evaluation results show that, comparing with the irregularly guided moving method, the proposed method can better guide the bus movement in routing buffer by reducing the total setup time of all buses processed at the next stage, and obtaining a better scheduling optimization solution with minimize maximum total completion time.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Optimization Algorithms · Advanced Manufacturing and Logistics Optimization · Optimization and Packing Problems
