Client‐contractor bargaining on net present value in project scheduling with limited resources

DOI10.1002/nav.20331zbMath1158.90349OpenAlexW2103380475MaRDI QIDQ3621917

Gündüz Ulusoy, Nursel Kavlak, Funda Sivrikaya-Serifoglu, İlker Birbil

Publication date: 22 April 2009

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20331

zbMATH Keywords

heuristicsproject schedulingbargainingnet present valueresource constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ An agency perspective for multi-mode project scheduling with time/cost trade-offs ⋮ Metaheuristics for multi-mode capital-constrained project payment scheduling ⋮ Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective

Uses Software

• PSPLIB

Cites Work

• Unnamed Item
• Project network models with discounted cash flows a guided tour through recent developments
• Scheduling projects to maximize net present value -- the case of time-dependent, contingent cash flows
• PSPLIB -- a project scheduling problem library
• An equitable approach to the payment scheduling problem in project management
• Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models
• Scheduling a project to maximize its net present value: An integer programming approach
• Early-tardy cost trade-offs in resource constrained projects with cash flows: An optimization-guided heuristic approach
• Trading bargaining weights
• On Maximizing the Net Present Value of a Project Under Renewable Resource Constraints
• The Impact of Contractor Behavior on the Client’s Payment-Scheduling Problem
• Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach
• On modelling payments in projects
• Performance of the heuristic procedures for constrained projects with progress payments
• Heuristic scheduling of resource-constrained projects with cash flows
• Cash Flows in Networks
• The payment scheduling problem
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
• Project Scheduling with Discounted Cash Flows and Progress Payments
• Maximizing the net present value of a project under resource constraints using a Lagrangian relaxation based heuristic with tight upper bounds
• Four payment models for the multi-mode resource constrained project scheduling problem with discounted cash flows

This page was built for publication: Client‐contractor bargaining on net present value in project scheduling with limited resources