An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs

Authors:
Joseph G. Szmerekovsky;Prahalad Venkateshan
Affiliations:
North Dakota State University, College of Business, NDSU Department 2420, PO Box 6050, Fargo, North Dakota 58108-6050, USA;Indian Institute of Management, Vastrapur, Ahmedabad 380015, India
Venue:
Computers and Operations Research
Year:
2012

Citing 5
Cited 1

Project Contracts and Payment Schedules: The Client's Problem

Management Science
Solving Project Scheduling Problems by Minimum Cut Computations

Management Science
ANNIVERSARY ARTICLE: Selection, Provisioning, Shared Fixed Costs, Maximum Closure, and Implications on Algorithmic Methods Today

Management Science
The Impact of Contractor Behavior on the Client's Payment-Scheduling Problem

Management Science
On project scheduling with irregular starting time costs

Operations Research Letters

A new multi-objective multi-mode model for solving preemptive time-cost-quality trade-off project scheduling problems

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

Four integer programming formulations are studied for the irregular costs project scheduling problem with time/cost trade-offs (PSIC). Three formulations using standard assignment type variables are tested against a more novel integer programming formulation. Empirical tests show that in many instances the new formulation performs best and can solve problems with up to 90 activities in a reasonable amount of time. This is explained by a reduced number of binary variables, a tighter linear programming (LP) relaxation, and the sparsity and embedded network structure of the constraint matrix of the new formulation.