Scheduling Multiple Orders per Job with Multiple Constraints on Identical Parallel Machines

被引:0
|
作者
王腾 [1 ]
周炳海 [1 ]
机构
[1] School of Mechanical Engineering,Tongji University
关键词
multiple product types; past-sequence-dependent(p-s-d) setup times; deterioration effects; identical parallel machines; scheduling; immune genetic algorithm(IGA);
D O I
10.19884/j.1672-5220.2013.06.003
中图分类号
TB497 [技术管理]; TP18 [人工智能理论];
学科分类号
08 ; 081104 ; 0812 ; 0835 ; 1405 ;
摘要
With a comprehensive consideration of multiple product types,past-sequence-dependent(p-s-d) setup times,and deterioration effects constraints in processes of wafer fabrication systems,a novel scheduling model of multiple orders per job(MOJ)on identical parallel machines was developed and an immune genetic algorithm(IGA) was applied to solving the scheduling problem.A scheduling problem domain was described.A non-linear mathematical programming model was also set up with an objective function of minimizing total weighted earliness-tardiness penalties of the system.On the basis of the mathematical model,IGA was put forward.Based on the genetic algorithm(GA),the proposed algorithm(IGA) can generate feasible solutions and ensure the diversity of antibodies.In the process of immunization programming,to guarantee the algorithm’s convergence performance,the modified rule of apparent tardiness cost with setups(ATCS) was presented.Finally,simulation experiments were designed,and the results indicated that the algorithm had good adaptability when the values of the constraints’ characteristic parameters were changed and it verified the validity of the algorithm.
引用
收藏
页码:466 / 471
页数:6
相关论文
共 50 条
  • [1] Scheduling multiple orders per job with multiple constraints on identical parallel machines
    Wang, Teng
    Zhou, Bing-Hai
    [J]. Journal of Donghua University (English Edition), 2013, 30 (06) : 466 - 471
  • [2] Scheduling multiple orders per job with various constraints
    Zhou, Bing-Hai
    Wang, Teng
    Fang, Teng
    [J]. Dongbei Daxue Xuebao/Journal of Northeastern University, 2015, 36 (10): : 1506 - 1510
  • [3] Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines
    Jia, Jun
    Mason, Scott J.
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2009, 47 (10) : 2565 - 2585
  • [4] Scheduling with Testing on Multiple Identical Parallel Machines
    Albers, Susanne
    Eckl, Alexander
    [J]. ALGORITHMS AND DATA STRUCTURES, WADS 2021, 2021, 12808 : 29 - 42
  • [5] Multiple orders per job compatible batch scheduling
    Erramilli, Vishnu
    Mason, Scott J.
    [J]. IEEE TRANSACTIONS ON ELECTRONICS PACKAGING MANUFACTURING, 2006, 29 (04): : 285 - 296
  • [6] Multiple orders per job batch scheduling with incompatible jobs
    Erramilli, Vishnu
    Mason, Scott J.
    [J]. ANNALS OF OPERATIONS RESEARCH, 2008, 159 (01) : 245 - 260
  • [7] Multiple orders per job batch scheduling with incompatible jobs
    Vishnu Erramilli
    Scott J. Mason
    [J]. Annals of Operations Research, 2008, 159 : 245 - 260
  • [8] SCHEDULING JOB FAMILIES ON NON-IDENTICAL PARALLEL MACHINES WITH TIME CONSTRAINTS
    Obeid, Ali
    Dauzere-Peres, Stephane
    Yugma, Claude
    [J]. PROCEEDINGS OF THE 2011 WINTER SIMULATION CONFERENCE (WSC), 2011, : 1994 - 2005
  • [9] Scheduling job families on non-identical parallel machines with time constraints
    Ali Obeid
    Stéphane Dauzère-Pérès
    Claude Yugma
    [J]. Annals of Operations Research, 2014, 213 : 221 - 234
  • [10] Scheduling job families on non-identical parallel machines with time constraints
    Obeid, Ali
    Dauzere-Peres, Stephane
    Yugma, Claude
    [J]. ANNALS OF OPERATIONS RESEARCH, 2014, 213 (01) : 221 - 234