Specialized Evolutionary Algorithm for Production Scheduling in Complex Correlated Manufacturing System

Abstract:

Job-shop is the problem of allocating the tasks to machine tools with a time table satisfying a set of objectives. Currently researches on Job-shop generally take the independent production processing as the study case. It is still difficult to schedule the production processing with complex correlated features. Taking the shop with m machine tools and n waiting correlated tasks as the study case, this research proposes an evolutionary algorithm-based and correlated constraint-driven optimization method to overcome the above difficulty. First, the tasks are classed as the correlated tasks and independent tasks according to the correlated features and the priority levels, which construct the foundation of modeling for complex correlated constraints. And then, the objective function is built taking the lower production cost and higher equipment capacity factor as optimization objectives. Finally, the optimization model is developed and solved with the specialized evolution algorithm. The simulation with the Matlab demonstrates the feasibility of the novel methodology.

• Periodical: Applied Mechanics and Materials (Volumes 20-23)
• Pages: 226-231
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.20-23.226
• Online since: January 2010
• Authors: Chong Chen, Ya Bo Luo
• Keywords: Genetic Algorithm (GA), Job-Shop Schedule, Minimal Makespan, Production Active Plan

References

[1] Aydin Mehmet E, Metaheuristic agent teams for job shop scheduling problems, Lecture Notes in Computer Science, Holonic and Multi-Agent Systems for Manufacturing - Proceedings of the 3rd International Conference on Industrial Applications of Holonic and Multi-Agent Systems, pp.185-194, (2007).

DOI: 10.1007/978-3-540-74481-8_18

[2] Steiner George and Xue Zhihui, On the connection between a cyclic job shop and a reentrant flow shop scheduling problem, Journal of Scheduling, vol 9, n 4, pp.381-387, (2006).

DOI: 10.1007/s10951-006-7041-z

[3] Rossi Andrea and Xue Zhihui, On the connection between a cyclic job shop and a reentrant flow shop scheduling problem, Journal of Scheduling, vol. 9, n 4, pp.381-387, (2006).

DOI: 10.1007/s10951-006-7041-z

[4] Groflin Heinz , Klinkert Andreas, and Dinh Nguyen Pham, Feasible job insertions in the multi-processor-task job shop, European Journal of Operational Research, vol. 185, n 3, pp.1308-1318, (2008).

DOI: 10.1016/j.ejor.2005.10.077

[5] Kuah. Syhlin and Tay Joc. Ging, Combining simplex with niche-based evolutionary computation for job-shop scheduling, GECCO 2006 - Genetic and Evolutionary Computation Conference., pp.583-590, (2006).

DOI: 10.1145/1143997.1144101

[6] Haq A. Noorul, Balasubramanian K, Sashidharan B, and Karthick R. B , Parallel line job shop scheduling using genetic algorithm., International Journal of Advanced Manufacturing Technology, vol. 35, n 9-10, pp.1047-1052, (2008).

DOI: 10.1007/s00170-007-1164-z

[7] Kim Ikno, Watada Junzo, and Shigaki Ichiro, A comparison of dispatching rules and genetic algorithms for job shop schedules of standard hydraulic cylinders, Soft Computing, vol. 12, n 2, pp.121-128, (2008).

DOI: 10.1007/s00500-007-0222-7