Ant Colony Algorithm Based Scheduling with Lot-Sizing for Printed Circuit Board Assembly Shop

This paper investigates a multi-stage hybrid flow shop scheduling problem in a real-world printed circuit board (PCB) assembly shop. Some distinct characteristics such as calendar constraints, sequence-dependent setup times, unrelated parallel machines and stage skipping are taken into account. Besides, lot-sizing is introduced to split an order of PCBs into a number of smaller sub-lots to improve the utilization of the assembly lines. This article develops an effective hierarchical approach to reduce the complexity of such a complicated PCB scheduling problem by decomposing it into two highly coupled sub-problems of job sequencing and batch scheduling with lot-sizing. A two-stage ant colony algorithm with lot-sizing is proposed to evolve best results for makespan criterion. Extensive computational experiments have been conducted to compare the performance with two other algorithms. The results demonstrate that the proposed two-stage ant colony algorithm with lot-sizing is competitive in terms of computational result, computational time and stability.

[1]  Hany Seidgar,et al.  Scheduling of assembly flow shop problem and machines with random breakdowns , 2017 .

[2]  M. T. Sze,et al.  A genetic algorithm of determining cycle time for printed circuit board assembly lines , 2001, Eur. J. Oper. Res..

[3]  Rong-Hwa Huang,et al.  An effective ant colony optimization algorithm for multi-objective job-shop scheduling with equal-size lot-splitting , 2017, Appl. Soft Comput..

[4]  M. Gholami,et al.  Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns , 2009 .

[5]  Timo Knuutila,et al.  Machine configuration and workload balancing of modular placement machines in multi-product PCB assembly , 2018, Int. J. Comput. Integr. Manuf..

[6]  Yaochu Jin,et al.  Evolutionary Multiobjective Blocking Lot-Streaming Flow Shop Scheduling With Machine Breakdowns , 2019, IEEE Transactions on Cybernetics.

[7]  Abdelhakim Artiba,et al.  Scheduling two-stage hybrid flow shop with availability constraints , 2006, Comput. Oper. Res..

[8]  William G. Truscott.  Production scheduling with capacity-constrained transportation activities , 1986 .

[9]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[10]  Shasha Wang,et al.  Two-stage hybrid flow shop batching and lot streaming with variable sublots and sequence-dependent setups , 2019, Int. J. Prod. Res..

[11]  Andrei Tchernykh,et al.  Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers , 2009, Comput. Ind. Eng..

[12]  Ali Fuat Alkaya,et al.  Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly , 2015, Discret. Appl. Math..

[13]  Ghaith Rabadi,et al.  A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times , 2010, J. Intell. Manuf..