Modelling and solving a practical flexible job-shop scheduling problem with blocking constraints

被引：33
|
作者：
Mati, Yazid [2 ]
Lahlou, Chams [1 ]
Dauzere-Peres, Stephane [3 ]
机构：
[1] Ecole Mines Nantes, IRCCyN, CNRS, UMR 6597, 4 Rue A Kastler,BP 20722, F-44307 Nantes 3, France
[2] Al Qassim Univ, Coll Business & Econ, Almelaida, Saudi Arabia
[3] Ecole Mines St Etienne, Ctr Microelect Provence, F-13541 Gardanne, France
来源：
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | 2011年 / 49卷 / 08期
关键词：
job-shop scheduling; genetic algorithm; flexible; blocking; design; TABOO SEARCH; PETRI NETS; FLOW LINES; ALGORITHM; COMPLEXITY; MAKESPAN;
D O I：
10.1080/00207541003733775
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
This paper presents a study of a practical job-shop scheduling problem modelled and solved when helping a company to design a new production workshop. The main characteristics of the problem are that some resources are flexible, and blocking constraints have to be taken into account. The problem and the motivation for solving it are detailed. The modelling of the problem and the proposed resolution approach, a genetic algorithm, are described. Numerical experiments using real data are presented and analysed. We also show how these results were used to support choices in the design of the workshop.
引用
收藏
页码：2169 / 2182
页数：14
相关论文
共 50 条
  • [1] Flexible job-shop scheduling problem under resource constraints
    Chan, F. T. S.
    Wong, T. C.
    Chan, L. Y.
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2006, 44 (11) : 2071 - 2089
  • [2] Flexible job-shop scheduling problem with resource recovery constraints
    Vallikavungal Devassia, Jobish
    Angelica Salazar-Aguilar, M.
    Boyer, Vincent
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2018, 56 (09) : 3326 - 3343
  • [3] A new neighborhood structure for solving the flexible job-shop scheduling problem
    Huang X.
    Chen S.
    Zhou T.
    Sun Y.
    Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2021, 41 (09): : 2367 - 2378
  • [4] A novel initialization method for solving flexible job-shop scheduling problem
    Shi Yang
    Zhang Guohui
    Gao Liang
    Yuan Kun
    CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 68 - +
  • [5] Survey on genetic algorithms for solving flexible job-shop scheduling problem
    Huang X.
    Chen S.
    Zhou T.
    Sun Y.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2022, 28 (02): : 536 - 551
  • [6] Job-shop scheduling with blocking and no-wait constraints
    Mascis, A
    Pacciarelli, D
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 143 (03) : 498 - 517
  • [7] A Study of Flexible Job-Shop Scheduling with Dual Constraints
    Gao, Zhenhua
    Qiao, Hengyun
    PROCESSES, 2024, 12 (12)
  • [8] Flexible job-shop scheduling problems with 'AND'/'OR' precedence constraints
    Lee, Sanghyup
    Moon, Ilkyeong
    Bae, Hyerim
    Kim, Jion
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2012, 50 (07) : 1979 - 2001
  • [9] Solving dual flexible job-shop scheduling problem using a Bat Algorithm
    Xu, H.
    Bao, Z. R.
    Zhang, T.
    ADVANCES IN PRODUCTION ENGINEERING & MANAGEMENT, 2017, 12 (01): : 5 - 16
  • [10] Solving the Flexible Job-shop Scheduling Problem with Quantum-inspired Algorithm
    Wu, Xiuli
    PROCEEDINGS OF THE 10TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA 2012), 2012, : 538 - 543
12345