Activity nets: A guided tour through some recent developments
No abstract is available for this item.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Salah E. Elmaghraby & Jerzy Kamburowski, 1992. "The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)," Management Science, INFORMS, vol. 38(9), pages 1245-1263, September.
- Kolisch, Rainer & Sprecher, Arno & Drexl, Andreas, 1992. "Characterization and generation of a general class of resource-constrained project scheduling problems: Easy and hard instances," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 301, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
- Christofides, Nicos & Alvarez-Valdes, R. & Tamarit, J. M., 1987. "Project scheduling with resource constraints: A branch and bound approach," European Journal of Operational Research, Elsevier, vol. 29(3), pages 262-273, June.
- Elmaghraby, Salah E., 1990. "Project bidding under deterministic and probabilistic activity durations," European Journal of Operational Research, Elsevier, vol. 49(1), pages 14-34, November.
- Herroelen, Willy S. & Gallens, Els, 1993. "Computational experience with an optimal procedure for the scheduling of activities to maximize the net present value of projects," European Journal of Operational Research, Elsevier, vol. 65(2), pages 274-277, March.
- D. R. Fulkerson, 1961. "A Network Flow Computation for Project Cost Curves," Management Science, INFORMS, vol. 7(2), pages 167-178, January.
- Erik Demeulemeester & Willy Herroelen, 1992. "A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem," Management Science, INFORMS, vol. 38(12), pages 1803-1818, December.
- Elmaghraby, Salah E. & Herroelen, Willy S., 1980. "On the measurement of complexity in activity networks," European Journal of Operational Research, Elsevier, vol. 5(4), pages 223-234, October.
- Elmaghraby, Salah E. & Herroelen, Willy S., 1990. "The scheduling of activities to maximize the net present value of projects," European Journal of Operational Research, Elsevier, vol. 49(1), pages 35-49, November.
- F. Brian Talbot & James H. Patterson, 1978. "An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems," Management Science, INFORMS, vol. 24(11), pages 1163-1174, July.
- De Wit, Jan & Herroelen, Willy, 1990. "An evaluation of microcomputer-based software packages for project management," European Journal of Operational Research, Elsevier, vol. 49(1), pages 102-139, November.
- Deckro, Richard F. & Winkofsky, E. P. & E. Hebert, John & Gagnon, Roger, 1991. "A decomposition approach to multi-project scheduling," European Journal of Operational Research, Elsevier, vol. 51(1), pages 110-118, March.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:82:y:1995:i:3:p:383-408. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.