Hybrid genetic optimization algorithm for multiprocessor task scheduling in flexible flow-shops with transportation

被引:0
|
作者
Xuan H. [1 ]
Wang L. [1 ]
Li B. [1 ]
Wang X. [1 ]
机构
[1] School of Management Engineering, Zhengzhou University, Zhengzhou
基金
中国国家自然科学基金;
关键词
Flexible flow-shops; Genetic algorithm; Iterative greedy procedure; Machine flow for job processing; Multiprocessor task scheduling;
D O I
10.13196/j.cims.2020.03.014
中图分类号
学科分类号
摘要
Multiprocessor task scheduling widely arises in manufacturing industries. To solve multiprocessor task scheduling optimization in realistic flexible flow-shop environments, a Multiprocessor Task Scheduling Problem in multi-stage Flexible Flow-Shops (MTSP-FFS) was studied with transportation time and job release time. This problem was NP-hard. An integer programming model of MTSP-FFS was then formulated with the objective of minimizing maximal completion time. For solving this problem, firstly, the generation procedure of machine flow for job processing and the matrix coding scheme of machine flow for single job processing and lot job processing were proposed. Then, Job Allocation Procedure with Randomly Selecting from Idle Machines (JAP-RSIM) was designed so that the original solutions of JAP-RSIM were obtained. New solutions were filtered based on the minimization of maximal completion time. Further, the new solution updating process of crossover and mutation was presented based on the synchronization of workpiece sequence and processing machine flow, and the Iterative Greedy Procedure (IGP) was applied to complete the adjustment and reconstruction operations. The new scheme was generated to improve the solution quality. Finally, the GA&IGP optimization strategy was formed. Simulation experiments compared the three algorithms of GA, IGP and GA&IGP for the different sized problems which were measured by the deviation percentage of the lower bounds. Testing results showed that the GA&IGP optimization algorithm could obtain better near-optimal solutions. © 2020, Editorial Department of CIMS. All right reserved.
引用
收藏
页码:707 / 717
页数:10
相关论文
共 21 条
  • [1] Lin S.W., Ying K.C., Huang C.Y., Multiprocessor task scheduling in multistage hybrid flowshops: a hybrid artificial bee colony algorithm with bi-directional planning, Computers & Operations Research, 40, 5, pp. 1186-1195, (2013)
  • [2] Guan Y.P., Xiao W.Q., Cheung R.K., Et al., A multiprocessor task scheduling model for berth allocation: heuristic and worse-case analysis, Operations Research Letters, 30, 5, pp. 343-350, (2002)
  • [3] Wang L., Xu Y., Zhou G., Et al., A novel decoding method for the hybrid flow-shop scheduling problem with multiprocessor tasks, International Journal of Advanced Manufacturing Technology, 59, 9-12, pp. 1113-1125, (2012)
  • [4] Oguz C., Zinder Y., Dob V.H., Et al., Hybrid flow-shop scheduling problems with multiprocessor task systems, European Journal of Operations Research, 152, 1, pp. 115-131, (2004)
  • [5] Boveiri H.R., Khayami R., Static homogeneous multiprocessor task graph scheduling using ant colony optimization, KSII Transactions on Internet and Information Systems, 11, 6, pp. 3046-3070, (2017)
  • [6] Boveiri H.R., An incremental ant colony optimization based approach to task assignment to processors for multiprocessor scheduling, Frontiers of Information Technology & Electronic Engineering, 18, 4, pp. 498-510, (2017)
  • [7] Mahmood A., Khan S.A., Albalooshi F., Et al., Energy-aware real-time task scheduling in multiprocessor systems using a hybrid genetic algorithm, Electronics, 6, 2, pp. 40-56, (2017)
  • [8] Sarathambekai S., Umamaheswari K., Intelligent discrete particle swarm optimization for multiprocessor task scheduling problem, Journal of Algorithms & Computational Technology, 11, 1, pp. 58-67, (2017)
  • [9] Kermia O., An efficient approach for the multiprocessor non-preemptive strictly periodic task scheduling problem, Journal of Systems Architecture, 79, pp. 31-44, (2017)
  • [10] Wang M., Xue K., Zhai Y., Et al., Study of multiprocessor task scheduling problem in network parallel computing system, Computer Engineering and Applications, 53, 10, pp. 264-270, (2017)