Insertion Algorithms to Solve the Resource-Constrained Multi-Stage Project Scheduling Problem With Discounted Cash Flow Maximization

• Autorzy: Marcin Klimek
• Języki publikacji: EN

Abstrakty

EN

The article presents the problem of scheduling a multi-stage project with limited availability of resources with the discounted cash flow maximization criterion from the perspective of a contractor. The contractor's cash outflows are associated with the execution of activities. The client's payments (cash inflows for the contractor) are performed after completing the agreed project's stages. The proposed solution for this problem is the use of insertion algorithms. Schedules are generated using forward and backward schedule generation schemes and modified justification techniques. The effectiveness of the proposed procedures is the subject of the examination with the use of standard test instances with additionally defined financial settlements of a project.(original abstract)

Słowa kluczowe

EN

Project planning; Schedule; Cash flows; Algorithms

PL

Planowanie projektu; Harmonogram; Przepływy pieniężne; Algorytmy

• Czasopismo: Management and Production Engineering Review
• Rocznik: 2018
• Tom: 9
• Numer: nr 4
• Strony: 106--116

Twórcy

autor

Marcin Klimek

• State School of Higher Education of Biała Podlaska

Bibliografia

• Brucker P., Drexl A., Mohring R., Neumann K., Pesch E., Resource-constrained project scheduling: Notation, classification, models, and methods, Eur. J. Oper. Res., 112, 1, 3-41, 1999.
• Hartmann S., Briskorn D., A Survey of Variants and Extensions of the Resource-Constrained Project Scheduling Problem, Eur. J. Oper. Res., 207, 1, 114, 2012.
• Kolisch R., Padman R., An integrated survey of deterministic project scheduling, OMEGA, 29, 249272, 2001.
• Bahrami F., Moslehi G., Study of payment scheduling problem to achieve client-contractor agreement, Int. J. Adv. Manuf. Tech., 64, 1, 497-511, 2013.
• Dayanand N., Padman R., Project contracts and payment schedules: the client's problem, Manag. Sci., 47, 1654-1667, 2001.
• Dayanand N., Padman R., On model ling payments in projects, J. Oper. Res. Soc., 48, 906-918, 1997.
• Leyman P., Vanhoucke M., Payment models and net present value optimization for resource-constrained project scheduling, Comput. Ind. Eng., 91, 139-153, 2016.
• Mika M., Waligóra G., Węglarz J., Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models, Eur. J. Oper. Res., 164, 3, 639-668, 2005.
• Ulusoy G., Sivrikaya-Serifoglu E., Sahin S., Four payment models for the multi-mode resource constrained project scheduling problem with discounted cash flows, Ann. Oper. Res, 102, 237-261, 2001.
• Ulusoy G., Cebelli S., An equitable approach to the payment scheduling problem in project management, Eur. J. Oper. Res., 127, 2, 262-278, 2000.
• Klimek M., Łebkowski P., Robustness of schedules for project scheduling problem with cash flow optimisation, Bull. Pol. Ac.: Tech., 61, 4, 1005-1015, 2013.
• Klimek M., Łebkowski P., Scheduling of a project settled by milestones [in Polish: Harmono-gramowanie projektu rozliczanego etapowo, AGH, Cracow, 2015.
• Klimek M., Łebkowski P., Heuristics for project scheduling with discounted cash flows optimisation, Bull. Pol. Ac.: Tech., 63, 3, 613-622, 2015.
• Klimek M., Łebkowski P., Financial optimisation of the scheduling for the multi-stage project, Bull. Pol. Ac.: Tech., 65, 6, 899-908, 2017.
• Klimek M., Łebkowski P., Cash flow maximization for project scheduling problem under uncertainty [in Polish: Maksymalizacja przepływów pieniężnych dla problemu harmonogramowania projektu w warunkach niepewności], [in:] Innowacje w zarządzaniu i inżynierii produkcji, Vol. 1, Ryszard Knosala [Ed.], PTZP, Opole, pp. 562-577, 2017.
• Ranjbar M., An optimal NPV project scheduling with fixed work content and payment on milestones, Int. J. Ind. Eng. Prod. Res., 22, 3, 181-186, 2011.
• He Z., Xu Y., Multi-mode project payment scheduling problems with bonus penalty structure, 189, 1191-1207, 2008.
• He Z., Wang N., Jia T., Xu Y., Simulated annealing and tabu search for multimode project payment scheduling, Eur. J. Oper. Res., 198, 3, 688-696, 2009.
• Kolisch R., Sprecher A., PSPLIB - a project scheduling library, Eur. J. Oper. Res., 96, 205-216, 1997.
• Błażewicz J., Lenstra J., Kan A.R., Scheduling subject to resource constraints - classification and complexity, Discret. Appl. Math., 5, 11-24, 1983.
• Hartmann S., Kolisch R., Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem, Eur. J. Oper. Res., 127, 394-407, 2000.
• Kolisch R., Hartmann S., Experimental investigation of heuristics for resource-constrained project scheduling: an update, Eur. J. Oper. Res., 74, 1, 2337, 2006.
• Nawaz M., Enscore E., Ham I., A heuristic algorithm for the m machine, n-job flow-shop sequencing problem, OMEGA, 11, 91-95, 1983.
• Woo D.S., Yim H.S., A heuristicalgorithm for mean flowtime objective in flowshop scheduling, Comput. Oper. Res., 25, 175-182, 1998.
• Klimek M., Łebkowski P., Insertion algorithms with justification for solving the resource-constrained project scheduling, Decis. Mak. Manuf Serv., 10, 12, 31-43, 2016.
• Kolisch R., Serial and parallel resource-constrained project scheduling methods revisited: theory and computation, Eur. J. Oper. Res., 90, 320-333, 1996.
• Selle T., Zimmermann J., A bidirectional heuristic for maximizing the net present value of large-scale projects subject to limited resources, Nav. Res. Lo-gist., 50, 2, 130-148, 2003.
• Vanhoucke M., A scatter search procedure for maximizing the net present value of a resource-constrained project with fixed activity cash flows, Work. Paper, 2006/417, Gent, pp. 1-23, 2006.
• Valls V., Ballestin F., Quintanilla S., Justification and RCPSP: a technique that pays, Eur. J. Oper. Res., 165, 2, 375-386, 2005.
• Valls V., Ballestin F., Quintanilla S., Justification technique generalisations, [in:] Józefowska J., Węglarz J. [Eds.], Perspectives in Modern Project Scheduling, Springer, Berlin, pp. 205-223, 2006.

Identyfikatory

DOI

DOI: 10.24425/119551