Applying ant colony system algorithm in the navigation process for plastic injection mould manufacturing scheduling optimisation

Under the computer-aided design (CAD) software architecture, this study aims to develop navigation processes for plastic injection mould manufacturing scheduling optimisation. Mould manufacturing is a job-shop scheduling problem, with components processing sequence under limited conditions. This study uses the search capabilities of the ant colony system (ACS) to determine a set of optimal schedules, under the condition of not violating the processing sequences, in order to minimise the total processing time and realise makespan minimisation. As the test results suggest, it can save up to 52% of manufacturing time, and also substantially shorten the processing time of the production plan. This study completes the algorithm steps and manufacturing process time estimation by operations on the navigation interface, and uses mould manufacturing scheduling to make optimised arrangements of finished components. The method can comply with the on-site manufacturing processes, improve scheduling prediction accuracy and consistently and efficiently integrate the optimisation scheduling system and mould manufacturing system. Visualised information of the scheduling results can be provided, thus allowing production management personnel to ensure smooth scheduling.

[1]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[2]  M. Zandieh,et al.  Due window scheduling with sequence-dependent setup on parallel machines using three hybrid metaheuristic algorithms , 2009 .

[3]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[4]  Tzu-Chun Lin,et al.  Integration of mold design and mold manufacturing , 2009 .

[5]  Ruhul A. Sarker,et al.  Genetic algorithm for job-shop scheduling with machine unavailability and breakdowns , 2011 .

[6]  Voratas Kachitvichyanukul,et al.  Multiple colony ant algorithm for job-shop scheduling problem , 2008 .

[7]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[8]  Rong-Hwa Huang,et al.  Flexible job shop scheduling with due window—a two-pheromone ant colony approach , 2013 .

[9]  Ping-Feng Pai,et al.  Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem , 2008 .

[10]  Haoxun Chen,et al.  Ant colony optimization for solving an industrial layout problem , 2007, Eur. J. Oper. Res..

[11]  Wen-Ren Jong,et al.  A collaborative navigation system for concurrent mold design , 2009 .

[12]  Ching-Jong Liao,et al.  Ant colony optimization combined with taboo search for the job shop scheduling problem , 2008, Comput. Oper. Res..

[13]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[14]  Rong-Hwa Huang,et al.  Multi-objective job-shop scheduling with lot-splitting production , 2010 .

[15]  Kuo-Ching Liu,et al.  Dispatching rules for stochastic finite capacity scheduling , 1998 .