Skip to main content

Solving the general project scheduling problem with multiple constrained resources by mathematical programming

  • Integer Programming, Networks
  • Conference paper
  • First Online:
Optimization Techniques

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 7))

Abstract

The problem of the time-optimal allocation of multiple-constrained resources among dependent operations is considered for the case when operation models are given in the form of differential equations relating operation performance speed to amounts of resources allotted. An approach is presented which permits the problem to be reduced to a mathematical programming one and enables a proper insight to be obtained into the properties of optimal solutions.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bubnicki, Z.: Optimal control of a complex of operations with random parameters, Podstawy Sterowania 1 /1971/,3–10.

    Google Scholar 

  2. Burkov, V.N.: Optimal control of a complex of operations,/Russian/IV Congress of IFAC, Technical Session 35, Warsaw, 1969, 46–57.

    Google Scholar 

  3. Słowiński, R.: Optimal Control of Multiple-Resource Allocation in a Complex of Operations, /Polish/ unpublished doctoral dissertation, Technical University of Poznan, 1977.

    Google Scholar 

  4. Węglarz, J., Słowiński, R.: Computational aspects of a certain class of time-optimal resource allocation problems in a complex of operations, Foundations of Control Engineering 1 /1976/, 123–133.

    Google Scholar 

  5. Węglarz, J.: Application of the convex sets theory in a certain problem of time-optimal control of a complex of operations, Systems Science 1 /1975/,67–74.

    Google Scholar 

  6. Węglarz, J.: Time-optimal control of resource allocation in a complex of operations framework, IEEE Trans. Systems, Man and Cybernet., SMC-6, 11/1976/,783–788.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

J. Stoer

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag

About this paper

Cite this paper

Słowiński, R., Węglarz, J. (1978). Solving the general project scheduling problem with multiple constrained resources by mathematical programming. In: Stoer, J. (eds) Optimization Techniques. Lecture Notes in Control and Information Sciences, vol 7. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006533

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08708-3

  • Online ISBN: 978-3-540-35890-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics