Lagrangian relaxation based heuristic for an integrated production and maintenance planning problem

被引:14
|
作者
Alaoui-Selsouli, M. [2 ]
Mohafid, A. [1 ]
Najid, N. M. [1 ]
机构
[1] Univ Nantes, IUT Nantes, Nantes Atlantique, Carquefou, France
[2] Ecole Mines Nantes, Nantes, France
关键词
production; maintenance; integer programming; time windows; shortage; heuristics; LOT-SIZING PROBLEM; PREVENTIVE MAINTENANCE; PERIODIC REPLACEMENT; MINIMAL REPAIR;
D O I
10.1080/00207543.2012.671586
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper, an approach is developed to solve the joint production planning and maintenance problem. Moreover, some propositions and mathematical properties were suggested and applied in the proposed heuristic to solve this integrated problem. It is based on Lagrangian relaxation (Fisher, M. L., 1981. Lagrangian relaxation method for solving integer programming problem. Management Science, 27 (1), 1-18) of the capacity constraints and sub-gradient optimisation. At every step of the sub-gradient method, a smoothing procedure is applied to the solution of the Lagrangian problem to ensure the feasibility of solution and to improve it. Computational experiments are carried out to show the results obtained by our approaches and are compared to those of a commercial solver.
引用
收藏
页码:3630 / 3642
页数:13
相关论文
共 50 条
  • [1] Dantzig-Wolfe decomposition based Heuristic for an Integrated Production and Maintenance planning Problem
    Alaoui Selsouli, Marouane
    Najid, Najib M.
    Mohafid, Abdelmoula
    PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM'2011): INNOVATIVE APPROACHES AND TECHNOLOGIES FOR NETWORKED MANUFACTURING ENTERPRISES MANAGEMENT, 2011, : 978 - 987
  • [2] A heuristic algorithm based on Lagrangian relaxation for the closest string problem
    Tanaka, Shunji
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (03) : 709 - 717
  • [3] A Lagrangian Relaxation based heuristic for the consolidation problem of airfreight forwarders
    Huang, Kuancheng
    Chi, Wenhou
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2007, 15 (04) : 235 - 245
  • [4] A heuristic algorithm based on Lagrangian relaxation for the closest string problem
    Tanaka, Shunji
    IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC 2010), 2010,
  • [5] A Lagrangian Relaxation Heuristic for a Bi-Objective Multimodal Transportation Planning Problem
    Li, Zhaojin
    Chen, Haoxun
    Liu, Ya
    Jin, Kun
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2023, 24 (01) : 382 - 399
  • [6] A Lagrangian Relaxation based Heuristic Approach for Steel Grade Assignment Problem
    Zheng, Yongyue
    Tang, Lixin
    IEEE/SOLI'2008: PROCEEDINGS OF 2008 IEEE INTERNATIONAL CONFERENCE ON SERVICE OPERATIONS AND LOGISTICS, AND INFORMATICS, VOLS 1 AND 2, 2008, : 2645 - 2650
  • [7] Joint optimization of train scheduling and maintenance planning in a railway network: A heuristic algorithm using Lagrangian relaxation
    Zhang, Chuntian
    Gao, Yuan
    Yang, Lixing
    Gao, Ziyou
    Qi, Jianguo
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2020, 134 (134) : 64 - 92
  • [8] Modeling and Lagrangian Relaxation Based Heuristic for Scheduling Oil Wells in Oilfield Production
    Lang Jin
    Tang Lixin
    2013 32ND CHINESE CONTROL CONFERENCE (CCC), 2013, : 2554 - 2559
  • [9] Evaluation of the Robustness for Integrated Production Scheduling and Maintenance Planning Problem
    Ba, Zhiyong
    Yuan, Yiping
    APPLIED SCIENCES-BASEL, 2023, 13 (04):
  • [10] A Lagrangian heuristic framework for a real-life integrated planning problem of railway transportation resources
    Dauzere-Peres, Stephane
    De Almeida, David
    Guyon, Olivier
    Benhizia, Faten
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2015, 74 : 138 - 150