Skip to main content
SpringerLink
Log in

Chapter 5 General discrete resource requests

  • Part II Multiple Category Resources
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. J. Carlier, Complexité des problèmes d'ordonnancement à contraintes de financement, in: P. Hansen and D. de Werra (eds.)Regards sur la Théorie des Graphes (Presses Polytechniques Romandes, Lausanne, 1980) pp. 183–186.

    Google Scholar 

  2. J. Carlier and A.H.G. Rinnooy Kan, Scheduling subject to nonrenewable resource constraints, Operations Research Letters 1, No. 2 (1982)52–55.

    Article  Google Scholar 

  3. M. Cochand, D. de Werra and R. Słowiński, Preemptive scheduling with staircase and piecewise linear resource availability. O.R. Working Paper 85/1, Ecole Polytechnique Fédérale de Lausanne, Dép. de Mathématiques, Lausanne 1985.

    Google Scholar 

  4. S.E. Elmaghraby,Activity Networks. Project Planning and Control by Network Models (Wiley, New York, 1977).

    Google Scholar 

  5. J. Grabowski and A. Janiak, Sequencing problem with resource constraints, in: R. Trappl (ed.),Cybernetics and Systems Research 2 (North-Holland, Amsterdam, 1984) pp. 329–333.

    Google Scholar 

  6. G. Merkel, G. Nägler and S. Schönherr,Anwenderhandbuch LEINET-OS, Teil 1 (Institut für Aus- und Weiterbildung im Bauwesen, Leipzig 1980).

    Google Scholar 

  7. J. Patterson, R. Słowiński, B. Talbot and J. Węglarz, An algorithm for a general class of precedence and resource constrained scheduling problems. Submitted for publication.

  8. S. Schönherr, The problem of allocation of storable resources to activities of a network model, Math. Operationsforsch. u. Statist., ser. optimization 15, No. 1 (1984)99–114.

    Google Scholar 

  9. R. Słowiński, Cost-minimal preemptive scheduling of independent jobs with release and due dates on open shop under resource constraints, Information Processing Letters 9, No. 5 (1979)233–237.

    Article  Google Scholar 

  10. R. Słowiński, Algorithms for the Allocation of Resources of Different Categories in the Complex of Operations Framework (in Polish). Technical University of Poznań Press, ser. Rozprawy No. 114, Poznań, 1980.

  11. R. Słowiński, Preemptive scheduling of independent jobs on parallel machines subject to financial constraints, European Journal of Operational Research 15, No. 3 (1984)366–373.

    Article  Google Scholar 

  12. J.B. Stinson, E.W. Davis and B.M. Khumawala, Multiple resource-constrained scheduling using branch and bound, AIIE Transactions 10, No. 3 (1978)252–259.

    Google Scholar 

  13. F.B. Talbot, Resource-constrained project scheduling with time-resource tradeoffs — the nonpreemptive case, Management Science 28, No. 10 (1982)1197–1210.

    Google Scholar 

  14. F.B. Talbot and J.H. Patterson, An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems, Management Science 24, No. 11 (1978)1163–1174.

    Google Scholar 

Download references

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chapter 5 General discrete resource requests. Ann Oper Res 7, 151–176 (1986). https://doi.org/10.1007/BF02186437

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02186437

Keywords

Search

Navigation