Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem

Name: Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
Author: Haouari, Mohamed, Kooli, A., Neron, E.

İsim	Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
Yazar	Haouari, Mohamed, Kooli, A., Neron, E.
Basım Tarihi:	2012-05
Basım Yeri	- Elsevier
Konu	Resource constrained project scheduling problem, Lower bounds, Energetic reasoning, Dual feasible functions
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	0305-0548
Kayıt Numarası	8b111cbf-8edf-4b52-ba27-52b151365650
Lokasyon	Industrial Engineering
Tarih	2012-05
Notlar	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Örnek Metin	We present new and effective lower bounds for the resource constrained project scheduling problem. This problem is widely known to be notoriously difficult to solve due to the lack of lower bounds that are both tight and fast. In this paper, we propose several new lower bounds that are based on the concept of energetic reasoning. A major contribution of this work is to investigate several enhanced new feasibility tests that prove useful for deriving new lower bounds that consistently outperform the classical energetic reasoning-based lower bound. In particular, we present the results of a comprehensive computational study, carried out on 1560 benchmark instances, that provides strong evidence that a deceptively simple dual feasible function-based lower bound is highly competitive with a state-of-the-art lower bound while being extremely fast. Furthermore, we found that an effective shaving procedure enables to derive an excellent lower bound that often outperforms the best bound from the literature while being significantly simpler.
DOI	10.1016/j.cor.2011.05.022
Cilt	39

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem

Yazar Haouari, Mohamed, Kooli, A., Neron, E.

Basım Tarihi 2012-05

Basım Yeri - Elsevier

Konu Resource constrained project scheduling problem, Lower bounds, Energetic reasoning, Dual feasible functions

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 0305-0548

Kayıt Numarası 8b111cbf-8edf-4b52-ba27-52b151365650

Lokasyon Industrial Engineering

Tarih 2012-05

Notlar Due to copyright restrictions, the access to the full text of this article is only available via subscription.

Örnek Metin We present new and effective lower bounds for the resource constrained project scheduling problem. This problem is widely known to be notoriously difficult to solve due to the lack of lower bounds that are both tight and fast. In this paper, we propose several new lower bounds that are based on the concept of energetic reasoning. A major contribution of this work is to investigate several enhanced new feasibility tests that prove useful for deriving new lower bounds that consistently outperform the classical energetic reasoning-based lower bound. In particular, we present the results of a comprehensive computational study, carried out on 1560 benchmark instances, that provides strong evidence that a deceptively simple dual feasible function-based lower bound is highly competitive with a state-of-the-art lower bound while being extremely fast. Furthermore, we found that an effective shaving procedure enables to derive an excellent lower bound that often outperforms the best bound from the literature while being significantly simpler.

DOI 10.1016/j.cor.2011.05.022

Cilt 39