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
相关论文
共 21 条
[1]   An integrated production and preventive maintenance planning model [J].
Aghezzaf, E. H. ;
Jamali, M. A. ;
Ait-Kadi, D. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 181 (02) :679-685
[2]   Integrated production planning and preventive maintenance in deteriorating production systems [J].
Aghezzaf, El-Houssaine ;
Najid, Najib M. .
INFORMATION SCIENCES, 2008, 178 (17) :3382-3392
[3]   The single-item lot-sizing problem with immediate lost sales [J].
Aksen, D ;
Altinkemer, K ;
Chand, S .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 147 (03) :558-566
[4]   OPTIMUM PREVENTIVE MAINTENANCE POLICIES [J].
BARLOW, R ;
HUNTER, L .
OPERATIONS RESEARCH, 1960, 8 (01) :90-100
[5]   Capacitated multi-item lot-sizing problems with time windows [J].
Brahimi, Nadjib ;
Dauzere-Peres, Stephane ;
Najid, Najib M. .
OPERATIONS RESEARCH, 2006, 54 (05) :951-967
[6]   DECOMPOSITION PRINCIPLE FOR LINEAR-PROGRAMS [J].
DANTZIG, GB ;
WOLFE, P .
OPERATIONS RESEARCH, 1960, 8 (01) :101-111
[7]   A new dantzig-wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times [J].
Degraeve, Zeger ;
Jans, Raf .
OPERATIONS RESEARCH, 2007, 55 (05) :909-920
[8]   OPTIMAL PROGRAMMING OF LOT SIZES, INVENTORY AND LABOR ALLOCATIONS [J].
DZIELINSKI, BP ;
GOMORY, RE .
MANAGEMENT SCIENCE, 1965, 11 (09) :874-890
[9]   THE LAGRANGIAN-RELAXATION METHOD FOR SOLVING INTEGER PROGRAMMING-PROBLEMS [J].
FISHER, ML .
MANAGEMENT SCIENCE, 1981, 27 (01) :1-18
[10]   Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches [J].
Jans, Raf ;
Degraeve, Zeger .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 177 (03) :1855-1875