A study on improving scheduling quality: A case study of a sightseeing factory of metal product

被引：0
|
作者：
Huang Y.-C. [1 ]
Ding Y.-A. [1 ]
Chang X.-Y. [1 ]
机构：
[1] Department of Industrial Management, National Pingtung University of Science and Technology
来源：
Journal of Quality | 2019年 / 26卷 / 04期
关键词：
Batch production; Dispatching rule; Multi-performance indicator; Random number algorithm; Scheduling;
D O I：
10.6220/joq.201908_26(4).0003
中图分类号：
学科分类号：
摘要：
This study takes a metal product sightseeing factory as an example, and develops a set of intelligent scheduling system; the purposes of this study are decreasing the number of delay orders and minimizing the total production time and so on. This study uses the dispatching rules such as the methods of shortest processing time, first-in/first-out, and early due date as its initial solutions. Then, this study uses random number algorithm (RNA) to optimize the scheduling solutions. Meanwhile, this study also considers the factors of production batch, delivery deadline, set-up time, and the tardiness cost. The decision makers can choose one scheduling performance indicator according to their needs. For instance, the minimum of total completion time, the shortest of total tardiness, the least number of total delay orders, and the smallest of total punishment cost. This study conducts a study of multi-order and multi-product to optimize the production schedule and improve the scheduling performance. The results confirm that the production scheduling system developed by this study has a user interface, and it can get the near optimal solution within 17 minutes or less. Also, the new production route of new products can be added, and the optimal scheduling results would be presented in the form of Gantt chart. In this study, it meets the practical needs and has a good execution performance. © 2019, Chinese Society for Quality. All rights reserved.
引用
收藏
页码：252 / 272
页数：20
相关论文
共 14 条
  • [1] Asadzadeh L., A local search genetic algorithm for the job shop scheduling problem with intelligent agents, Computers & Industrial Engineering, 85, pp. 376-383, (2015)
  • [2] Gomez-Martin C., Vega-Rodriguez M.A., Gonzalez-Sanchez J.-L., Fattened backfilling: An improved strategy for job scheduling in parallel systems, Journal of Parallel and Distributed Computing, 97, pp. 69-77, (2016)
  • [3] Kundakci N., Kulak O., Hybrid genetic algorithms for minimizing makespan in dynamic job shop scheduling problem, Computers & Industrial Engineering, 96, pp. 31-51, (2016)
  • [4] Kurdi M., An effective new island model genetic algorithm for job shop scheduling problem, Computers & Operations Research, 67, pp. 132-142, (2016)
  • [5] Lei D., Simplified multi-objective genetic algorithms for stochastic job shop scheduling, Applied Soft Computing, 11, 8, pp. 4991-4996, (2015)
  • [6] Liu Z., Zhang Y., Yu M., Zhou X., Heuristic algorithm for ready-mixed concrete plant scheduling with multiple mixers, Automation in Construction, 84, pp. 1-13, (2017)
  • [7] Nguyen V., Bao H.P., An efficient solution to the mixed shop scheduling problem using a modified genetic algorithm, Procedia Computer Science, 95, pp. 475-482, (2016)
  • [8] Qing-Dao-er-ji R., Wang Y., A new hybrid genetic algorithm for job shop scheduling problem, Computers & Operations Research, 39, 10, pp. 2291-2299, (2012)
  • [9] Roychowdhury S., Allen T.T., Allen N.B., A genetic algorithm with an earliest due date encoding for scheduling automotive stamping operations, Computers & Industrial Engineering, 105, pp. 201-209, (2017)
  • [10] Tang D., Dai M., Salido M.A., Giret A., Energy-efficient dynamic scheduling for a flexible flow shop using an improved particle swarm optimization, Computers in Industry, 81, pp. 82-95, (2016)
12