PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Robustness of schedules for project scheduling problem with cash flow optimisation

Treść / Zawartość
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
The paper presents the resource-constrained project scheduling with cash flow optimisation. New project models with bonuspenalty system and payoff in stages have been proposed. For the models presented, the application of proactive scheduling is analysed, as designed to improve project execution under uncertainty. Next, schedule robustness is discussed and measures of robustness are proposed.
Rocznik
Strony
1005--1015
Opis fizyczny
Bibliogr. 29 poz., rys., tab.
Twórcy
autor
  • Institute of Informatics Pope John Paul II State School of Higher Education, 95-97 Sidorska St., 21-500 Biała Podlaska, Poland
  • AGH University of Science and Technology, Department of Operations Research and Information Technology, 10 Gramatyka St., 30-067 Krakow, Poland
Bibliografia
  • [1] M. Klimek, “Predictive-reactive production scheduling with resource availability constraints”, PhD Thesis, AGH University of Science and Technology, Krakow, 2010, (in Polish).
  • [2] W. Herroelen, B.D. Reyck, and E. Demeulemeester, “Project network models with discounted cash flows: A guided tour through recent developments”, Eur. J. Operational Research 100, 97-121 (1997).
  • [3] A.H. Russell, “Cash flows in networks”, Management Science 16, 357-373 (1970).
  • [4] M. Mika, G. Waligora, and J. Węglarz, “Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models”, Eur. J. Operational Research 164 (3), 639-668 (2005).
  • [5] M. Vanhoucke, E. Demeulemeester, and W. Herroelen, “Maximizing the net present value of a project with linear timedependent cash flows”, Int. J. Production Research 39 (14), 3159-3181 (2001).
  • [6] G. Waligora, “Discrete-continuous project scheduling with discounted cash flows a tabu search approach”, Computers & Operations Research 35 (7), 2141-2153 (2008).
  • [7] N. Dayanand and R. Padman, “On modelling payments in projects”, J. Operational Research Society 48, 906-918 (1997).
  • [8] G. Ulusoy, F. Sivrikaya-Serifoglu, and S. Sahin, “Four payment models for the multi-mode resource constrained project scheduling problem with discounted cash flows”, Annals Operations Research 102, 237-261 (2001).
  • [9] N. Dayanand and R. Padman, “Project contracts and payment schedules: the client’s problem”, Management Science 47, 1654-1667 (2001).
  • [10] G. Ulusoy and S. Cebelli, “An equitable approach to the payment scheduling problem in project management”, Eur. J. Operational Research 127 (2), 262-278 (2000).
  • [11] D.E. Smith-Daniels, R. Padman, and V.L. Smith-Daniels, “Heuristic scheduling of capital constrained projects”, J. Operations Management 14 (3), 241-254 (1996).
  • [12] Z.W. He and Y. Xu, “Multi-mode project payment scheduling problems with bonus penalty structure”, Eur. J. Operational Research 189, 1191-1207 (2008).
  • [13] W. Wiesemann, D. Kuhn, and B. Rustem, “Maximizing the net present value of a project under uncertainty”, Eur. J. Operational Research 202, 356-367 (2010).
  • [14] S. Benati, “An optimization model for stochastic project networks with cash flows”, Comput. Management Science 3 (4), 271-284 (2006).
  • [15] V. Tilson, M.J. Sobel, and J.G. Szmerekovsky, “Scheduling projects with stochastic activity duration to maximize EPV”, Technical Memorandum 812, CD-ROM (2006).
  • [16] A. Maravas and J.-P. Pantouvakis, “Project cash flow analysis in the presence of uncertainty in activity duration and cost”, Int. J. Project Management 30 (3), 374-384 (2012).
  • [17] M.Y. Cheng and A.F.V. Roy, “Evolutionary fuzzy decision model for cash flow prediction using time dependent support vector machines” Int. J. Project Management 29 (1), 56-65 (2011).
  • [18] S. Hartmann and D. Briskorn, “A Survey of Variants and lengthenings of the Resource-Constrained Project Scheduling Problem”, Eur. J. Operational Research 207 (1), 1-14 (2012).
  • [19] E. Demeulemeester and W. Herroelen, “Robust project scheduling, Foundations and Trends in Technology”, Information and Operations Management, 3 (3-4), 201-376 (2010).
  • [20] W. Herroelen and R. Leus, “Project scheduling under uncertainty: Survey and research potentials”, Eur. J. Operational Research 165, 289-306 (2005).
  • [21] J. Jozefowska and J. Węglarz, Perspectives in Modern Project Scheduling, Springer, Berlin, 2006.
  • [22] E.M. Goldratt, Critical Chain, Great Barrington: the North River Press, New York, 1997.
  • [23] F. Deblaere, E. Demeulemeester, W. Herroelen, and S. Van De Vonder, “Proactive resource allocation heuristics for robust project scheduling”, in Research Report KBI 0608, K.U., Leuven, 2006.
  • [24] M. Klimek and P. Łebkowski, “Resource allocation for robust project scheduling”, Bull. Pol. Ac.: Tech. 59 (1), 51-55 (2011).
  • [25] P. Kobylański and D. Kuchta, “A note on the paper by M.A. Al-Fawzan and M. Haouari about a bi-objective problem for robust resource-constrained project scheduling”, Int. J. Production Economics 107, 496-501 (2007).
  • [26] M. Al-Fawzan and M. Haouari, “A bi-objective problem for robust resource-constrained project scheduling”, Int. J. Production Economics 96, 175-187 (2005).
  • [27] J. Błażewicz, J. Lenstra, and A.R. Kan, “Scheduling subject to resource constraints - classification and complexity”, Discrete Appl. Mathematics 5, 11-24 (1983).
  • [28] S. Hartmann and R. Kolisch, “Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem”, Eur. J. Operational Research 127, 394-407 (2000).
  • [29] R. Kolisch and S. Hartmann, “Experimental investigation of heuristics for resource-constrained project scheduling: An update”, Eur. J. Operational Research 174, 23-37 (2006).
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-a6ef14b8-43ba-42db-a0c6-fb1f00432955
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.