An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration
Year of publication: |
2015
|
---|---|
Authors: | Moukrim, Aziz ; Quilliot, Alain ; Toussaint, Hélène |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 244.2015, 2 (16.7.), p. 360-368
|
Subject: | Project scheduling | Interval order | Column generation | Constraint propagation | Antichain | Scheduling-Verfahren | Scheduling problem | Projektmanagement | Project management | Theorie | Theory |
-
Moukrim, Aziz, (2015)
-
Network decomposition-based lower and upper bounds for the discrete time-cost tradeoff problem
Akkan, Can, (2000)
-
Improved timetable edge finder rule for cumulative constraint with profile
Kameugne, Roger, (2024)
- More ...
-
Moukrim, Aziz, (2015)
-
Flow polyhedra and resource constrained project scheduling problems
Quilliot, Alain, (2012)
-
Duhamel, Christophe, (2011)
- More ...