The Dynamic Scheduling of Spray Booth Machine in 4S Auto Maintenance Shop

DOI

10.2991/ismems-16.2016.14How to use a DOI?

Keywords

Bottleneck, Spray booth machine, Triplet method, Dispatching rules, Particle swarm optimization algorithm

Abstract

Theory of constraint point out that the bottleneck is a major factor which restricts the system going toward the target. Therefore, the bottleneck is the key of scheduling process in entire system. In fact, due to the factors of long processing time, high cost and few amounts, spray booth machine become the bottleneck in the whole 4S auto maintenance shop. Through reasonable scheduling of spray booth machine, we can improve system's efficiency and customer's satisfaction. First, combining with the real situation, we apply a triplet method to describe the spray booth scheduling problem in 4S maintenance shop. On this basis, a multi-objectives model with multi-constraint is constructed for the scheduling problem. Combining with the real situation, the scheduling model also can be regard as machine in parallel with different speed and machine eligibility restriction and job's characteristic. And then, we design a two-phased heuristic algorithm based on the dispatching rules and particle swarm optimization algorithm to solve it. Finally, we show the experimental results and compares with usual methods to demonstrate the superior performance of the proposed method

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Jinqi Li
AU  - Xiangyang Li
AU  - Qin Yang
PY  - 2016/12
DA  - 2016/12
TI  - The Dynamic Scheduling of Spray Booth Machine in 4S Auto Maintenance Shop
BT  - Proceedings of the International Symposium on Mechanical Engineering and Material Science
PB  - Atlantis Press
SP  - 73
EP  - 80
SN  - 2352-5401
UR  - https://doi.org/10.2991/ismems-16.2016.14
DO  - 10.2991/ismems-16.2016.14
ID  - Li2016/12
ER  -