Linear programming based algorithms for preemptive and non-preemptive RCPSP

European Journal of Operational Research

Volumn 182, Issue 3, 2007, Pages 1012-1022

  Damay, Jean ^a   Quilliot, Alain ^a   Sanlaville, Eric ^a  

^a UNIVERSITÉ BLAISE PASCAL   (France)

Author keywords

Column generation; Linear programming; Preemption; Resource constrained project; Scheduling

Indexed keywords

ALGORITHMS; CONSTRAINED OPTIMIZATION; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING;

COLUMN GENERATION; LINEAR PROGRAMMING MODEL; PREEMPTION; RESOURCE CONSTRAINED PROJECTS; SIMPLEX METHOD;

SCHEDULING;

EID: 34248214093     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.09.052     Document Type: Article

References (12)

1. Baptiste P., and Demassey S. Tight LP bounds for resource constrained project scheduling. OR Spectrum 26 (2004) 251-262
2. Bendali F., and Quilliot A. Representation of ordered families of intervals, and applications. RAIRO, Recherche Opérationnelle/Operations Research 31 1 (1997) 73-101
3. Brucker P., and Knust S. A linear programming and constraint propagation-based lower bound for the RCPSP. European Journal of Operational Research 127 (2000) 355-362
4. Demassey S., Artigues C., and Michelon P. Constraint propagation based cutting planes: An application to the resource-constrained project scheduling problem. INFORMS Journal on Computing 17 1 (2005) 52-65
5. Demeulemeester E., and Herroelen W. An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem. European Journal of Operational Research 90 (1996) 334-348
6. Kolisch R., and Sprecher A. PSPLIB - a project scheduling library. European Journal of Operational Research (1996) 205-216
7. Mingozzi A., Maniezzo V., Ricciardelli S., and Bianco L. An exact algorithm for the resource-constrained project scheduling based on a new mathematical formulation. Management Science 44 (1998) 714-729
8. Möhring R.H., Schulz A.S., Stork F., and Uetz M. Solving project scheduling problems by minimum cut computations. INFORMS Management Science 49 3 (2003) 330-350
9. Moukrim A., and Quilliot A. A relation between multiprocessor scheduling and linear programming. Order 14 (1998) 269-278
10. Moukrim A., and Quilliot A. Optimal preemptive scheduling on a fixed number of identical machines. Operations Research Letters 33 (2005) 143-150
11. Le Pape C., and Baptiste Ph. Resource constraints for preemptive job-shop scheduling. Constraints 3 4 (1998) 263-287
12. Schoo A., Thiele O., Brucker P., and Knust S. A branch and bound algorithm for the resource-constrained project scheduling problem. European Journal of Operational Research 107 (1998) 272-288