IIMA Institutional Repository
This Institutional Repository has been created to collect, preserve and distribute the scholarly output of Indian Institute of Management, Ahmedabad. This will work as an important tool to facilitate scholarly communication and preserve the institution knowledge. The Vikram Sarabhai Library is proud to be hosting the repository for the dissemination and preservation of this valuable knowledge resource of the IIMA community.
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/13652| Title: | An integer programming formulation for the project scheduling problem with irregular time–cost tradeoffs |
| Authors: | Szmerekovsky, Joseph G. Venkateshan, Prahalad |
| Keywords: | Programming formulation |
| Issue Date: | 2012 |
| Publisher: | Elsevier B.V. |
| Citation: | Szmerekovsky, J. G., & Venkateshan, P. (2012). An integer programming formulation for the project scheduling problem with irregular time–cost tradeoffs. Computers And Operations Research, 391402-1410. |
| 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. |
| URI: | http://hdl.handle.net/11718/13652 |
| ISSN: | 03050548 |
| Appears in Collections: | Journal Articles |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Anuntegerprogrammingformulation.pdf Restricted Access | 204.73 kB | Adobe PDF | View/Open Request a copy |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.