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 条
  • [31] Improved genetic algorithm for the job-shop scheduling problem
    Tung-Kuan Liu
    Jinn-Tsong Tsai
    Jyh-Horng Chou
    [J]. The International Journal of Advanced Manufacturing Technology, 2006, 27 : 1021 - 1029
  • [32] A new heuristic method for job-shop scheduling problem
    Kuang-Ping Liu
    [J]. 2006 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-6, PROCEEDINGS, 2006, : 3708 - 3714
  • [33] A Hybrid Optimization Algorithm for the Job-shop Scheduling Problem
    Zhou, Qiang
    Cui, Xunxue
    Wang, Zhengshan
    Yang, Bin
    [J]. WORLD SUMMIT ON GENETIC AND EVOLUTIONARY COMPUTATION (GEC 09), 2009, : 757 - 763
  • [34] Scheduling of a job-shop problem with limited output buffers
    Zeng, Chengkuan
    Tang, Jiafu
    Fan, Zhi-Ping
    Yan, Chongjun
    [J]. ENGINEERING OPTIMIZATION, 2020, 52 (01) : 53 - 73
  • [35] Improved genetic algorithm for the job-shop scheduling problem
    Liu, Tung-Kuan
    Tsai, Jinn-Tsong
    Chou, Jyh-Horng
    [J]. International Journal of Advanced Manufacturing Technology, 2006, 27 (9-10): : 1021 - 1029
  • [36] Flexible Job-Shop Scheduling Problem by Genetic Algorithm
    Ida, Kenichi
    Oka, Kensaku
    [J]. ELECTRICAL ENGINEERING IN JAPAN, 2011, 177 (03) : 28 - 35
  • [37] Genetic Algorithm for Solving Job-Shop Scheduling Problem
    Li XiaoBo
    [J]. 2011 INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND NEURAL COMPUTING (FSNC 2011), VOL IV, 2011, : 296 - 298
  • [38] A Grafted Genetic Algorithm for the Job-Shop Scheduling Problem
    LI Xiang-jun 1
    [J]. International Journal of Plant Engineering and Management, 2004, (02) : 91 - 96
  • [39] A probabilistic approach to the Stochastic Job-Shop Scheduling problem
    Shoval, Shraga
    Efatmaneshnik, Mahmoud
    [J]. 15TH GLOBAL CONFERENCE ON SUSTAINABLE MANUFACTURING, 2018, 21 : 533 - 540
  • [40] SOLVING THE JOB-SHOP SCHEDULING PROBLEM WITH TABU SEARCH
    BARNES, JW
    CHAMBERS, JB
    [J]. IIE TRANSACTIONS, 1995, 27 (02) : 257 - 263
12345