Solution of the Job-Shop Scheduling Problem through the Traveling Salesman Problem.

被引：7
|
作者：
Anaya Fuentes, G. E. [1 ]
Hernandez Gress, E. S. [1 ]
Tuoh Mora, J. C. Seek [1 ]
Medina Marin, J. [1 ]
机构：
[1] Univ Autonoma Estado Hidalgo, Area Acad Ingn, Carboneras 42183, Mineral De La R, Mexico
来源：
REVISTA IBEROAMERICANA DE AUTOMATICA E INFORMATICA INDUSTRIAL | 2016年 / 13卷 / 04期
关键词：
Efficient algorithms; industrial production systems; optimization problem; traveling salesman problem;
D O I：
10.1016/j.riai.2016.07.003
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper we proposed a solution to the Job-Shop Scheduling Problem using the Traveling Salesman Problem solved by Genetic Algorithms. We proposed a genetic algorithm where we compare two types of selection: tournament and roulette. Different tests are performed to solve the Traveling Salesman Problem with the two types of selection under different parameters: number of individuals, number of iterations, crossover probability and mutation probability. Then the best type of selection and the best parameters are used to solve the Job-Shop Scheduling Problem with Genetic Algorithms for the Traveling Salesman Problem. The proposal is presented solving different examples of Job Sequencing Problem and compare them with the results obtained in the literature.
引用
收藏
页码：430 / 437
页数：8
相关论文
共 50 条
  • [41] Job-shop scheduling problem with fuzzy processing times
    Lin, FT
    [J]. COMPUTATIONAL SCIENCE -- ICCS 2001, PROCEEDINGS PT 2, 2001, 2074 : 409 - 418
  • [42] Problem difficulty for tabu search in job-shop scheduling
    Watson, JP
    Beck, JC
    Howe, AE
    Whitley, LD
    [J]. ARTIFICIAL INTELLIGENCE, 2003, 143 (02) : 189 - 217
  • [43] Improved genetic algorithm for the job-shop scheduling problem
    Liu, TK
    Tsai, JT
    Chou, JH
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2006, 27 (9-10): : 1021 - 1029
  • [44] An Improved Genetic Algorithm for the Job-Shop Scheduling Problem
    Hong, Hui
    Li, Tianying
    Wang, Hongtao
    [J]. DCABES 2008 PROCEEDINGS, VOLS I AND II, 2008, : 621 - +
  • [45] A Hybrid Genetic Algorithm for Job-Shop Scheduling Problem
    Wang Lihong
    Ten Haikun
    Yu Guanghua
    [J]. 2015 IEEE 28TH CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING (CCECE), 2015, : 271 - 274
  • [46] JOB-SHOP SCHEDULING USING AUTOMATED REASONING: A CASE STUDY OF THE CAR-SEQUENCING PROBLEM.
    Parrello, Bruce D.
    Kabat, Waldo C.
    Wos, L.
    [J]. Journal of Automated Reasoning, 1986, 2 (01) : 1 - 42
  • [47] The solution of the concurrent layout scheduling problem in the job-shop environment through a local neighborhood search algorithm
    Selene Hernandez-Gress, Eva
    Carlos Seck-Tuoh-Mora, Juan
    Hernandez-Romero, Norberto
    Medina-Marin, Joselito
    Lagos-Eulogio, Pedro
    Ortiz-Perea, Javier
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2020, 144
  • [48] STATISTICAL APPROACH TO THE TRAVELING SALESMAN PROBLEM.
    Kovacs, W.J.
    Goodin, D.T.
    [J]. Transportation Research, Part B: Methodological, 1985, 19 B (03): : 239 - 252
  • [49] New scheduling type applied to solving job-shop scheduling problem
    Zhang, Chaoyong
    Guan, Zailin
    Liu, Qiong
    Shao, Xinyu
    Li, Peigen
    [J]. Jixie Gongcheng Xuebao/Chinese Journal of Mechanical Engineering, 2008, 44 (10): : 24 - 31
  • [50] INSERTION TECHNIQUES FOR THE HEURISTIC SOLUTION OF THE JOB-SHOP PROBLEM
    WERNER, F
    WINKLER, A
    [J]. DISCRETE APPLIED MATHEMATICS, 1995, 58 (02) : 191 - 211
12345