Using the Zero-one Programming Approach in Project Scheduling
DOI:
https://doi.org/10.15678/ZNUEK.2013.0923.08Keywords:
project scheduling, zero-one programming, schedule optimisation, multiple criteria optimisationAbstract
Because of increasing interest in project management in the subject literature, optimisation techniques are often considered in project planning and scheduling. The main project scheduling techniques are CPM or PERT. Those methods deliver schedules with optimal project finish times and ensure the level of resource usage is controlled. In practical situations, project schedules should be optimised not only because of time but also because of resource usage and cash flows. The above techniques do not meet those requirements. The purpose of this paper is to demonstrate how zero-one programming can be used in project scheduling. Zero-one programming is a special case of integer programming where all the decision variables are integers and can assume values of either zero or one. A zero-one programming formulation has been applied to solve three project scheduling problems, namely the optimisation of project completion time, resource usage and project cash flows.
Downloads
References
Bartusch M., Mohring R., Radermacher F. [1988], Scheduling Project Networks with Resource Constraints and Time Windows, „Annals of Operations Research", vol. 16, nr 1-4. DOI: https://doi.org/10.1007/BF02283745
Bianco L., Dell'Olmo P., Speranza M. [1998], Heuristics for Multimode Scheduling Problem with Dedicated Resources, „European Journal of Operational Research", vol. 107. DOI: https://doi.org/10.1016/S0377-2217(97)00347-0
Brandenburg H. [2002], Zarządzanie projektami, Akademia Ekonomiczna w Katowicach, Katowice.
Doersch R., Patterson J. [1977], Scheduling a Project to Maximize Its Present Value: A Zero-one Programming Approach, „Management Science", vol. 23, nr 8. DOI: https://doi.org/10.1287/mnsc.23.8.882
Icmeli O., Erenguc S. [1996], A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash Flows, „Management Science", vol. 42, nr 10. DOI: https://doi.org/10.1287/mnsc.42.10.1395
Kostrubiec A. [2003], Harmonogramowanie projektów - przegląd modeli [w:] Inżynieria zarządzania przedsięwzięciami, red. L. Zawadzka, Wydawnictwo Politechniki Gdańskiej, Gdańsk.
Norberciak M. [2002], Przegląd metod automatycznego planowania - przykład wykorzystania algorytmu genetycznego w rozwiązaniu prostego problemu planowania, Prace Naukowe Wydziałowego Zakładu Informatyki Politechniki Wrocławskiej, z. 1: Sztuczna inteligencja, Wrocław.
Russell R. [1970], Cash Flows in Networks, „Management Science", vol. 16, nr 5. DOI: https://doi.org/10.1287/mnsc.16.5.357
Shouman M. i in. [2006], Genetic Algorithm Constraint Project Scheduling, „Alexandria Engineering Journal", vol. 45, nr 3.
Talbot T. [1982], Resource-constrained Project Scheduling with Time-resource Tradeoffs: The Non-preemptive, „Management Science", vol. 28, nr 10. DOI: https://doi.org/10.1287/mnsc.28.10.1197
Vanhoucke M., Demeulemeester E., Herroelen W. [2001], On Maximizing the Net Present Value of a Project under Renewable Resource Constraints, „Management Science", vol. 47, nr 8. DOI: https://doi.org/10.1287/mnsc.47.8.1113.10226
Viana A., de Sousa J. [2000], Using Metaheuristic in Multiobjective Resource Constrained Project Scheduling, „European Journal of Operational Research", vol. 120, nr 20. DOI: https://doi.org/10.1016/S0377-2217(99)00163-0
