Parallel Genetic Algorithm for Job Shop Heterogeneous Multi-Objectives Scheduling Problem

被引:0
|
作者
Wang, Changjun [1 ]
Jia, YongJi [1 ]
Wang, Bing [2 ]
机构
[1] Donghua Univ, Sch Management, Shanghai, Peoples R China
[2] Shandong Univ, Sch Informat Engn, Weihai, Shandong, Peoples R China
关键词
Job shop scheduling; Game theory; Nash Equilibrium; Genetic algorithm;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Consider a special group of job shop scheduling problems, where both customers and manufacturer have independent and different objectives. It is specified as a two-layer optimization model based on Noncooperative Game. Nash Equilibrium (NE) schedule for heterogeneous customers is defined. A Parallel Genetic Algorithm (PGA) based solving method is designed. Each customer is assigned a subpopulation and evolves synchronously to achieve a set of competitive equilibrium, ie., NE schedule. The manufacturer chooses the best schedule according to its system objective to influence customer's strategic behaviors. Tests indicate that the proposed algorithm can well coordinate the requirements of the customers and manufacturer.
引用
收藏
页码:295 / +
页数:2
相关论文
共 50 条
  • [1] Job-shop Scheduling with Multi-objectives Based on Genetic Algorithms
    周亚勤
    李蓓智
    陈革
    [J]. Journal of Donghua University(English Edition), 2003, (03) : 57 - 62
  • [2] A Parallel Genetic Algorithm for the Job Shop Scheduling Problem
    Nguyen Huu Mui
    Vu Dinh Hoa
    Luc Tri Tuyen
    [J]. 2012 IEEE INTERNATIONAL SYMPOSIUM ON SIGNAL PROCESSING AND INFORMATION TECHNOLOGY (ISSPIT), 2012, : 19 - 24
  • [3] Solving the dynamic energy aware job shop scheduling problem with the heterogeneous parallel genetic algorithm
    Luo, Jia
    El Baz, Didier
    Xue, Rui
    Hu, Jinglu
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2020, 108 : 119 - 134
  • [4] Multi-population genetic algorithm for job shop scheduling problem
    Cai, Liang-Wei
    Zhang, Ji-Hong
    Li, Xia
    [J]. Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2005, 33 (06): : 991 - 994
  • [5] Multi-Objectives Optimization Model for Flexible Job Shop Scheduling Problem (FJS']JSSP) with Machines' Workload Balancing
    Shuib, Adibah
    Gran, Shirley Sinatra Anak
    [J]. PROCEEDING OF THE 25TH NATIONAL SYMPOSIUM ON MATHEMATICAL SCIENCES (SKSM25): MATHEMATICAL SCIENCES AS THE CORE OF INTELLECTUAL EXCELLENCE, 2018, 1974
  • [6] An efficient genetic algorithm for job shop scheduling with tardiness objectives
    Mattfeld, DC
    Bierwirth, C
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 155 (03) : 616 - 630
  • [7] A new hybrid parallel genetic algorithm for the job-shop scheduling problem
    Spanos, Athanasios C.
    Ponis, Stavros T.
    Tatsiopoulos, Ilias P.
    Christou, Ioannis T.
    Rokou, Elena
    [J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2014, 21 (03) : 479 - 499
  • [8] A hybrid genetic algorithm for the job shop scheduling problem
    Gonçalves, JF
    Mendes, JJDM
    Resende, MGC
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 167 (01) : 77 - 95
  • [9] Genetic algorithm application on the job shop scheduling problem
    Wu, CG
    Xing, XL
    Lee, HP
    Zhou, CG
    Liang, YC
    [J]. PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 2102 - 2106
  • [10] An Orthogonal Genetic Algorithm for Job Shop Scheduling Problems with Multiple Objectives
    Feng, Ming-Yue
    Yi, Xian-Qing
    Li, Guo-Hui
    Tang, Shao-Xun
    He, Jun
    [J]. ICNC 2008: FOURTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 1, PROCEEDINGS, 2008, : 546 - 550