Tytuł artykułuFinancial optimisation of the scheduling for the multi-stage project
Tytuł czasopismaBulletin of the Polish Academy of Sciences: Technical Sciences
Wydział PANNauki Techniczne
WydawcaPolish Academy of Sciences
IdentyfikatorISSN 0239-7528, eISSN 2300-1917
ReferencjeDayanand (2001), Project contracts and payment schedules The client s problem, Sci, 23, 1654. ; Mika (2005), Simulated annealing and tabu search for multi - mode resource - constrained project scheduling with positive discounted cash flows and different payment models, Eur Oper Res, 14, 164. ; Goldratt (1997), Critical chain Great The, null, 30. ; Leyman (2016), Payment models and net present value optimization for resource - constrained project scheduling, Comput Ind Eng, 12, 91. ; Goldratt (1992), The goal New York, null, 29. ; Tormos (2003), An efficient multi - pass heuristic for project scheduling with constrained resources, Int J Prod Res, 40, 1071. ; Valls (2005), Justification a technique that pays, Eur Oper Res, 165. ; Valls (2008), hybrid genetic algorithm for the, Eur Oper Res, 185. ; Klimek (2013), Robustness of schedules for project scheduling problem with cash flow optimisation Pol, Tech, 1005. ; Selle (2003), bidirectional heuristic for maximizing the net present value of large - scale projects subject to limited resources, Res, 15, 130. ; Pinder (1996), Using discounted cash flow heuristics to improve project net present value, Oper Manag, 14, 229. ; Klimek (null), Heuristics for project scheduling with discounted cash flows optimisation Pol, Tech, 11, 613. ; Baroum (1996), The development of cash flow weight procedures for maximizing the net present value of a project, Oper Manag, 14, 209. ; Fink (2013), An ant - based coordination mechanism for resource - constrained project scheduling with multiple agents and cash flow objectives Flex, null, 25, 94. ; Khoshjahan (2013), Resource constrained project scheduling problem with discounted earliness - tardiness penalties modeling and solving procedure, Mathematical Comput Ind Eng, 293. ; Kirkpatrick (1983), Optimization by simulated annealing, Science, 220. ; Wiest (1964), Some properties of schedules for large projects with limited resources, Oper Res, 12, 395. ; Valls (2006), Justification technique generalisations In eds Perspectives in Modern Project Scheduling, null, 205. ; Bahrami (2013), Study of payment scheduling problem to achieve client - contractor agreement, Int J Adv Manuf Tech, 22, 1. ; Bouleimen (2003), new efficient simulated annealing algorithm for the resource constrained project scheduling problem and its multiple version, Eur Oper Res, 49. ; Ranjbar (2011), An optimal NPV project scheduling with fixed work content and payment on milestones, Int J Ind Eng Prod Res, 31, 181. ; Goncalves (2011), biased random - key genetic algorithm with forward - backward improvement for the resource constrained project scheduling problem, Heuristics, 17, 37. ; Smith (1996), Heuristic scheduling of capital constrained projects, Oper Manag, 14, 241. ; Li (1992), An iterative scheduling technique for resource - constrained project scheduling, Eur Oper Res, 370. ; Hartmann (2000), Experimental evaluation of state - of - the - art heuristics for the resource - constrained project scheduling problem, Eur Oper Res, 127. ; Herroelen (1997), Project network models with discounted cash flows guided tour through recent developments, Eur Oper Res, 21, 97. ; Kolisch (1996), Serial and parallel resource - constrained project scheduling methods revisited Theory computation, Eur Oper Res, 320. ; Błażewicz (1983), Scheduling subject to resource constraints classification and complexity, Appl Math, 5. ; Manag (1970), Cash flows in networks, Russell Sci, 16, 357. ; Vanhoucke (2006), scatter search procedure for maximizing the net present value of a resource - constrained project with fixed activity cash flows Paper, Work, 18, 417. ; Dayanand (1997), On modelling payments in projects, Oper Res Soc, 24, 906. ; Józefowska (2006), eds Perspectives in modern project scheduling, null. ; Brucker (1999), Resource constrained project scheduling Notation classification models, methods Eur Oper Res, 1. ; Ulusoy (2001), Four payment models for the multi - mode resource constrained project scheduling problem with discounted cash flows, Ann Oper Res, 17, 237. ; Kolisch (1997), Sprecher a project scheduling, library Eur Oper Res, 205. ; Ulusoy (1995), heuristic scheduling algorithm for improving the duration and net present value of a project, Int J Oper Prod Manag, 25, 89. ; Kolisch (2006), Experimental Investigation of Heuristics for Resource - Constrained Project Scheduling : An Update, Eur Oper Res, 1. ; He (2009), Simulated annealing and tabu search for multimode project payment scheduling, Eur Oper Res, 28, 198. ; Vanhoucke (2001), On maximizing the net present value of a project under renewable resource constraints, Sci, 19, 1113. ; Tormos (2001), competitive heuristic solution technique for resource - constrained project scheduling, Ann Oper Res, 102, 39. ; Hartmann (2012), survey of variants and extensions of the resource - constrained project scheduling problem, Eur Oper Res, 207. ; Thiruvady (2014), Lagrangian relaxation and ACO hybrid for resource constrained project scheduling with discounted cash flows, Heuristics, 16, 643. ; He (2008), Multi - mode project payment scheduling problems with bonus penalty structure, Eur Oper Res, 27, 189. ; Vanhoucke (2001), Maximizing the net present value of a project with linear time - dependent cash flows, Int J Prod Res, 20, 14. ; Schwindt (2001), steepest ascent approach to maximizing the net present value of projects, Math Methods Oper Res, 53. ; Ulusoy (2000), An equitable approach to the payment scheduling problem in project management, Eur Oper Res, 26, 127. ; Kolisch (2001), An integrated survey of deterministic project scheduling OMEGA, null, 29, 249.