Application of a Cutting/Packing Method for Solving a Job Scheduling Problem in a Line of Machines

被引:0
|
作者
Tlili, Mounira [1 ]
Moalla, Mohamed [1 ]
Baptiste, Pierre [2 ]
机构
[1] Fac Sci Tunis, Campus Univ, Tunis 2092 2, Tunisia
[2] Ecole Polytech Montreal, Montreal, PQ H3C 3A7, Canada
关键词
Scheduling; Makespan; Cutting/Packing problems; Branch and Bound;
D O I
10.3166/JDS.17.387-401
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider an industrial scheduling problem for which we define a resolution method inspired from those used in the Cutting/Packing domain. The mathematical problem specification is given as an integer non-linear programming model. The overview of resolution approaches of the Cutting/Packing problems allows us to justify the choice of a heuristic for calculating the upper bound as well as a specific evaluation function to have an optimized resolution by an exact algorithm of the branch and bound type. The heuristic and the branch and bound algorithm are evaluated by experimental tests.
引用
收藏
页码:387 / 401
页数:15
相关论文
共 50 条
  • [1] Solving nonstandard job-shop scheduling problem by loading balance of machines scheduling algorithm
    Wang, FR
    Wang, ZQ
    Yang, SW
    Chen, DX
    [J]. PROCEEDINGS OF THE 4TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-4, 2002, : 2338 - 2341
  • [2] Solving Cutting Scheduling Problem by Simulated Annealing Search Method
    Tung, Kuan-Ting
    Chen, Chih-Yu
    Hung, Yi-Feng
    [J]. 2016 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2016, : 907 - 911
  • [3] Job scheduling problem and machines accommodation
    Reyna-Amador, Mary-Carmen
    Hernandez-Gress, Eva-Selene
    Barragan-Vite, Irving
    Rivera-Gomez, Hector
    [J]. DYNA, 2017, 92 (06): : 614 - 614
  • [4] Solving a job shop scheduling problem
    Kumar, K. R. Anil
    Dhas, J. Edwin Raja
    [J]. JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS, 2023, 46 (04) : 315 - 330
  • [5] Deep reinforcement learning for solving the joint scheduling problem of machines and AGVs in job shop
    基于深度强化学习求解作业车间机器与AGV联合调度问题
    [J]. Lei, Qi (leiqi@cqu.edu.cn), 1600, Northeast University (39):
  • [6] An Artificial Intelligence Software Application for Solving Job Shop Scheduling Problem
    Toader, Florentina Alina
    [J]. PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON VIRTUAL LEARNING, 2014, : 439 - 443
  • [7] Solving the Scheduling Problem of Machines with Auxiliary Tools
    Yang, Ya-Chu
    Lin, Yu-Ting
    Hung, Yi-Feng
    [J]. 2016 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2016, : 903 - 906
  • [8] Solving a Real Job Shop Scheduling Problem
    Avila Rondon, R. L.
    Carvalho, A. S.
    [J]. IECON: 2009 35TH ANNUAL CONFERENCE OF IEEE INDUSTRIAL ELECTRONICS, VOLS 1-6, 2009, : 2352 - +
  • [9] A novel initialization method for solving flexible job-shop scheduling problem
    Shi Yang
    Zhang Guohui
    Gao Liang
    Yuan Kun
    [J]. CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 68 - +
  • [10] Hybrid Quantum Annealing Heuristic Method for Solving Job Shop Scheduling Problem
    Kurowski, Krzysztof
    Weglarz, Jan
    Subocz, Marek
    Rozycki, Rafal
    Waligora, Grzegorz
    [J]. COMPUTATIONAL SCIENCE - ICCS 2020, PT VI, 2020, 12142 : 502 - 515