The project scheduling problem with irregular starting time costs

DOI10.1016/S0167-6377(99)00050-4zbMath0937.90033WikidataQ59195766 ScholiaQ59195766MaRDI QIDQ1969764

Vittorio Maniezzo, Aristide Mingozzi

Publication date: 19 March 2000

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

integer programmingproject schedulingcombinatorial optimizationexact algorithm

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

An exact algorithm for an integrated project staffing problem with a homogeneous workforce ⋮ A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints ⋮ An exact composite lower bound strategy for the resource-constrained project scheduling problem ⋮ Fuzzy project scheduling problem and its hybrid intelligent algorithm ⋮ Project scheduling with irregular costs: complexity, approximability, and algorithms ⋮ On project scheduling with irregular starting time costs ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem ⋮ Project scheduling problem with stochastic activity duration times

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Scheduling projects to maximize net present value -- the case of time-dependent, contingent cash flows
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Scheduling a project to maximize its net present value: An integer programming approach
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach
• A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash Flows
• Cash Flows in Networks
• The payment scheduling problem