The project scheduling problem with production and consumption of resources: A list-scheduling based algorithm

Discrete Applied Mathematics

Volumn 157, Issue 17, 2009, Pages 3631-3642

  Carlier, Jacques ^a   Moukrim, Aziz ^a   Xu, Huang ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

Author keywords

Linear order; List scheduling; Polynomial algorithms; Project scheduling problem

Indexed keywords

LINEAR ORDER; LIST SCHEDULING; MAKESPAN; NP COMPLETE; POLYNOMIAL ALGORITHMS; POLYNOMIAL-TIME; PROJECT SCHEDULING PROBLEM; TIME SEQUENCES;

POLYNOMIALS;

SCHEDULING ALGORITHMS;

EID: 70350053537     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2009.02.012     Document Type: Article

References (24)

1. H. Abdel-wahab, Scheduling with applications to register allocation and deadlock problems, Ph.D. Thesis, University of Waterloo, Ontario, 1976
2. Abdel-wahab H.M., and Kameda T. Scheduling to minimize maximum cumulative cost subject to series-parallel precedence constraints. Operations Research 26 1 (1978) 141-158
3. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network flows. In: Nemhauser G.L., Rinnooy Kan A.H.G., and Todd M.J. (Eds). Handbooks in Operations Research and Management Science (1989), Elsevier, Amsterdam 258-263
4. Bartusch M., Möhring R.H., and Radermacher F.J. Scheduling project network with resource constraints and time windows. Annals of Operations Research 16 (1988) 201-240
5. Beck J.C. Heuristics for constraint-directed scheduling with inventory. Journal of Scheduling 5 (2002) 45-69
6. H. Bouly, J. Carlier, A. Moukrim, M. Russo, Solving rcpsp with resources production possibility by tasks, in: MHOSI'2005, 24-26 Avril 2005, Hammamet, Tunisie, 2005
7. Brucker P., Drexl A., Möhring R., Neumann K., and Pesch E. Resource-constrained project scheduling: Notation, classification, models and methods. European Journal of Operational Research 112 (1999) 3-41
8. J. Carlier, Problèmes d'ordonnancements à contraintes de ressources: Algorithmes et complexité, doctorat d'état, 1984
9. Cesta A., Oddi A., and Smith S.F. A constraint-based method for project scheduling with time windows. Journal of Heuristics 8 1 (2002) 109-136
10. Johannes B. On the complexity of scheduling unit-time jobs with or-precedence constraints. Operations Research Letters 33 (2005) 587-596
11. Johnson S.M. Optimal two and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 (1954) 61-68
12. Kaplan E.H., and Amir A. A fast feasibility test for relocation problems. European Journal of Operational Research 35 (1988) 201-205
13. Kolisch R., and Padman R. An integrated survey of deterministic project scheduling. Omega 49 3 (2001) 249-272
14. Laborie P. Algorithms for propagating resource constraints in ai planning and scheduling: Existing approaches and new results. Artificial Intelligence 143 (2003) 151-188
15. Lin B.M.T., and Cheng T.C.E. Relocation problems to minimize the maximum tardiness and the number of tardy jobs. European Journal of Operational Research 116 (1999) 183-193
16. Neumann K., and Schwindt C. Project scheduling with inventory constraints. Mathematical Methods of Operations Research 56 (2002) 513-533
17. Neumann K., Schwindt C., and Trautmann N. Scheduling of continuous and discontinuous material flows with intermediate storage restrictions. European Journal of Operational Research 165 (2005) 495-509
18. Neumann K., Schwindt C., and Zimmermann J. Resource-constrained project scheduling with time windows: Recent developments and new applications. In: Jozefowska J., and Weglarz J. (Eds). Perspectives in Modern Project Scheduling (2006), Kluwer, Boston 375-407
19. Neumann K., Schwindt C., and Zimmermann J. Project Scheduling with Time Windows and Scarce Resources (2003), Springer, Berlin
20. Neumann K., and Zhan J. Heuristics for the minimum project-duration problem with minimal and maximal time lags under fixed resource constraints. Journal of Intelligent Manufacturing 19 (1997) 205-217
21. Sethi R. Complete register allocation problems. SIAM Journal on Computing 4 3 (1975) 226-248
22. Sourd F., and Rogerie J. Continuous filling and emptying of storage systems in constraint-based scheduling. European Journal of Operational Research 165 (2005) 510-524
23. Tarjan R. Depth-first search and linear graph algorithms. SIAM Journal on Computing 1 2 (1972) 146-160
24. Valdes J., Tarjan R.E., and Lawler E.L. The recognition of series parallel digraphs. SIAM Journal on Computing 11 2 (1982) 298-313