TY - JOUR
T1 - Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system
AU - Zhang, Sicheng
AU - Li, Xiang
AU - Zhang, Bowen
AU - Wang, Shouyang
N1 - Publisher Copyright:
© 2019 Elsevier B.V.
PY - 2020/6/1
Y1 - 2020/6/1
N2 - This paper studies the production scheduling problem in a flexible manufacturing system with two adjacent working areas, whose products are incorporated with flexible non-linear process plans and assembling operations. The basic parts are produced in one area before they are transported to the other area for assembly. The assembling structures of products are either flat or multi-levelled. Sequence-dependent setup times of operations and transition times of jobs between machines are considered separately from processing times. Lot streaming is considered beforehand such that each job represents a basic part instead of a batch of identical parts. Identical subassemblies are shared by all possible assembling operations, instead of being pre-associated with any product. Makespan, total tardiness and total workload are taken as objectives to be optimised. We propose a distributed ant colony system to solve the problem and explore the Pareto front. The approach is first compared with other methods, using several sets of hypothetical test cases with different sizes and complexities; then, it is applied to solve a ball valve production scheduling problem under different scenarios. We show that the proposed approach outperforms most of the other methods for the tested problems, especially for large-scale instances, making it a valuable and competitive approach for solving practical production scheduling problems.
AB - This paper studies the production scheduling problem in a flexible manufacturing system with two adjacent working areas, whose products are incorporated with flexible non-linear process plans and assembling operations. The basic parts are produced in one area before they are transported to the other area for assembly. The assembling structures of products are either flat or multi-levelled. Sequence-dependent setup times of operations and transition times of jobs between machines are considered separately from processing times. Lot streaming is considered beforehand such that each job represents a basic part instead of a batch of identical parts. Identical subassemblies are shared by all possible assembling operations, instead of being pre-associated with any product. Makespan, total tardiness and total workload are taken as objectives to be optimised. We propose a distributed ant colony system to solve the problem and explore the Pareto front. The approach is first compared with other methods, using several sets of hypothetical test cases with different sizes and complexities; then, it is applied to solve a ball valve production scheduling problem under different scenarios. We show that the proposed approach outperforms most of the other methods for the tested problems, especially for large-scale instances, making it a valuable and competitive approach for solving practical production scheduling problems.
KW - Ant colony optimisation
KW - Flexible assembly job shop scheduling
KW - Meta-heuristics
KW - Multi-objective optimisation
KW - Scheduling
UR - https://www.scopus.com/pages/publications/85076543901
U2 - 10.1016/j.ejor.2019.11.016
DO - 10.1016/j.ejor.2019.11.016
M3 - Article
AN - SCOPUS:85076543901
SN - 0377-2217
VL - 283
SP - 441
EP - 460
JO - European Journal of Operational Research
JF - European Journal of Operational Research
IS - 2
ER -