Clustering and Genetic Algorithm Based Hybrid Flowshop Scheduling with Multiple Operations

被引:4
|
作者
Zhang, Yingfeng [1 ]
Liu, Sichao [1 ]
Sun, Shudong [1 ]
机构
[1] Northwestern Polytech Univ, Key Lab Contemporary Design & Integrated Mfg, Minist Educ, Xian 710072, Peoples R China
基金
国家教育部博士点专项基金资助; 美国国家科学基金会;
关键词
MINIMIZING MAKESPAN; SHOP; OPTIMIZATION; HEURISTICS; MULTISTAGE; MACHINES; BLOCKING;
D O I
10.1155/2014/167073
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This research ismotivated by a flowshop scheduling problemof our collaborativemanufacturing company for aeronautic products. The heat-treatment stage (HTS) and precision forging stage (PFS) of the case are selected as a two-stage hybrid flowshop system. In HTS, there are four parallel machines and eachmachine can process a batch of jobs simultaneously. In PFS, there are twomachines. Each machine can install any module of the four modules for processing the workpeices with different sizes. The problem is characterized bymany constraints, such as batching operation, blocking environment, and setup time and working time limitations of modules, and so forth. In order to deal with the above special characteristics, the clustering and genetic algorithm is used to calculate the good solution for the two-stage hybrid flowshop problem. The clustering is used to group the jobs according to the processing ranges of the different modules of PFS. The genetic algorithm is used to schedule the optimal sequence of the grouped jobs for the HTS and PFS. Finally, a case study is used to demonstrate the efficiency and effectiveness of the designed genetic algorithm.
引用
收藏
页数:8
相关论文
共 50 条
  • [21] A Weight-Based Multiobjective Genetic Algorithm For Flowshop Scheduling
    Fang, Zhimin
    2009 INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND COMPUTATIONAL INTELLIGENCE, VOL I, PROCEEDINGS, 2009, : 373 - 377
  • [22] Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
    Zhang, Yi
    Li, Xiaoping
    Wang, Qian
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 196 (03) : 869 - 876
  • [23] Hybrid branch and bound method with genetic algorithm for flexible flowshop scheduling problem
    Morita, H
    Shio, N
    JSME INTERNATIONAL JOURNAL SERIES C-MECHANICAL SYSTEMS MACHINE ELEMENTS AND MANUFACTURING, 2005, 48 (01) : 46 - 52
  • [24] An improved genetic algorithm for the flowshop scheduling problem
    Rajkumar, R.
    Shahabudeen, P.
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2009, 47 (01) : 233 - 249
  • [25] A Constructive Genetic Algorithm for permutation flowshop scheduling
    Nagano, Marcelo Seido
    Ruiz, Ruben
    Nogueira Lorena, Luiz Antonio
    COMPUTERS & INDUSTRIAL ENGINEERING, 2008, 55 (01) : 195 - 207
  • [26] Flowshop with multiple processors dynamic scheduling problem based on hybrid genetic-particle swarm optimization
    Li, Wang
    Chuanyong, Zhao
    Dawei, Li
    Open Cybernetics and Systemics Journal, 2015, 9 (01): : 1038 - 1044
  • [27] A hybrid genetic based clustering algorithm
    Liu, YG
    Chen, KF
    Li, XM
    PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 1677 - 1682
  • [28] A genetic algorithm based approach for scheduling of jobs containing multiple orders in a three-machine flowshop
    Liu, Cheng-Hsiang
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2010, 48 (15) : 4379 - 4396
  • [29] Solution to earliness and tardiness hybrid flowshop scheduling problem by using adaptive genetic algorithm
    Lu Fei
    Tian Guo-hui
    Proceedings of 2004 Chinese Control and Decision Conference, 2004, : 353 - +
  • [30] Hybrid Flowshop Scheduling using Leaders and Followers: An Implementation with Iterated Greedy and Genetic Algorithm
    Yeh, Tsung-Su
    Chiang, Tsung-Che
    2021 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI 2021), 2021,