INCREMENTAL METHOD BY CONSTANT TIME FOR SOLVING JOB SHOP SCHEDULING PROBLEMS

被引：0
|
作者：
Nishikori, Akimine [1 ]
机构：
[1] Prefectural Univ Hiroshima Hiroshima, Fac Management & Informat Syst, Hiroshima 7348558, Japan
来源：
ICIM 2010: PROCEEDINGS OF THE TENTH INTERNATIONAL CONFERENCE ON INDUSTRIAL MANAGEMENT | 2010年
关键词：
Job Shop Scheduling; Incremental Method; Several Precedence Relations;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
Job shop scheduling in manufacturing systems is planned by a dispatching rule. In general, incremental time in a simulation method for job shop scheduling problems is not constant but variable. In an incremental method by constant time, every occurring event is processed according to clock time changed by unity. This paper presents an incremental method by constant time for solving job shop scheduling problems. Also the proposed method is applicable to the modified job shop scheduling problem in which preceding relations are altered, i.e., there are a few preceding processing operations although only one preceding processing operation generally exists.
引用
收藏
页码：38 / 42
页数：5
相关论文
共 50 条
  • [1] A hybrid method for solving stochastic job shop scheduling problems
    Tavakkoli-Moghaddam, R
    Jolai, F
    Vaziri, F
    Ahmed, PK
    Azaron, A
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2005, 170 (01) : 185 - 206
  • [2] A heuristic combination method for solving job-shop scheduling problems
    Hart, E
    Ross, P
    [J]. PARALLEL PROBLEM SOLVING FROM NATURE - PPSN V, 1998, 1498 : 845 - 854
  • [3] Research on the Model and Solving of Job Shop Scheduling Problems
    Chen Tao
    Gao Liqun
    [J]. MEMS, NANO AND SMART SYSTEMS, PTS 1-6, 2012, 403-408 : 2654 - 2658
  • [4] Solving the job shop scheduling problems by an immune algorithm
    Zuo, XQ
    Fan, YS
    [J]. PROCEEDINGS OF 2005 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-9, 2005, : 3282 - 3287
  • [5] An analogue genetic algorithm for solving job shop scheduling problems
    Al-Hakim, L
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2001, 39 (07) : 1537 - 1548
  • [6] TABU SEARCH STRATEGIES FOR SOLVING JOB SHOP SCHEDULING PROBLEMS
    Eswaramurthy, V. P.
    Tamilarasi, A.
    [J]. JOURNAL OF ADVANCED MANUFACTURING SYSTEMS, 2007, 6 (01) : 59 - 75
  • [7] Memetic algorithms for solving job-shop scheduling problems
    Hasan S.M.K.
    Sarker R.
    Essam D.
    Cornforth D.
    [J]. Memetic Computing, 2009, 1 (1) : 69 - 83
  • [8] Hybrid Genetic Algorithm for Solving Job Shop Scheduling Problems
    Piroozfard, Hamed
    Hassan, Adnan
    Moghadam, Ali Mokhtari
    Asl, Ali Derakhshan
    [J]. MATERIALS, INDUSTRIAL, AND MANUFACTURING ENGINEERING RESEARCH ADVANCES 1.1, 2014, 845 : 559 - 563
  • [9] Solving Permutation Flow Shop Scheduling Problems with Job Idle Time in between Two Machines
    Baskar, A.
    Xavior, Anthony M.
    [J]. MATERIALS SCIENCE AND NANOTECHNOLOGY I, 2013, 531-532 : 699 - 702
  • [10] Solving flexible job shop scheduling problems with transportation time based on improved genetic algorithm
    Zhang, Guohui
    Sun, Jinghe
    Liu, Xing
    Wang, Guodong
    Yang, Yangyang
    [J]. MATHEMATICAL BIOSCIENCES AND ENGINEERING, 2019, 16 (03) : 1334 - 1347
12345