An iterated-local-search heuristic for the resource-constrained weighted earliness-tardiness project scheduling problem

被引:24
|
作者
Ballestin, Francisco [2 ]
Trautmann, Norbert [1 ]
机构
[1] Univ Bern, Dept Betriebswirtschaftslehre, CH-3012 Bern, Switzerland
[2] Univ Publ Navarra, Dept Estadist & Invest Operat, Pamplona 31007, Spain
关键词
reactive scheduling; just-in-time production; resource-constrained project scheduling; weighted earliness-tardiness cost; iterated-local-search;
D O I
10.1080/00207540701420560
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper deals with the weighted earliness-tardiness resource-constrained project scheduling problem with minimum and maximum time lags (WET-RCPSP/max). The problem consists of scheduling the activities of a project subject to prescribed resource and temporal constraints such that the total weighted deviation of the activities' completion times from prescribed due dates is minimized. Key applications are planning of just-in-time production and reactive scheduling. For the (approximative) solution of the WET-RCPSP/max, we present a population-based iterated-local-search heuristic. We also report the results of an experimental performance analysis where this heuristic outperformed state-of-the-art methods.
引用
收藏
页码:6231 / 6249
页数:19
相关论文
共 50 条