Skip to main content
SpringerLink
Log in

Resource Constrained Scheduling

  • Chapter
Scheduling in Computer and Manufacturing Systems

  • 74 Accesses

Abstract

The scheduling model we consider now is more complicated than the previous ones, because any task, besides processors, may require for its processing some additional scarce resources. Resources, depending on their nature, may be classified into types and categories. The classification into types takes into account only the functions resources fulfill: resources of the same type are assumed to fulfill the same functions. The classification into categories will concern two points of view. First, we differentiate three categories of resources from the viewpoint of resource constraints. We will call a resource renewable, if only its total usage i.e. temporary availability at every moment is constrained (in other words this resource can be used once more when returned by a task currently using it). A resource is called nonrenewable, if only its total consumption, i.e. integral availability up to any given moment is constrained (in other words this resource once used by some task cannot be assigned to any other task). A resource is called doubly constrained, if both total usage and total consumption are constrained. Secondly, we distinguish two resource categories from the viewpoint of resource divisibility: discrete (i.e. discretely-divisible) and continuous (i.e. continuously-divisible) resources. In other words, by a discrete resource we will understand a resource which can be allocated to tasks in discrete amounts from a finite set of possible allocations, which in particular may consist of only one unit per task. Continuous resources, on the other hand, can be allocated in arbitrary a priori unknown amounts less than or equal to some given maximum value.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Błażewicz, J. Barcelo, W. Kubiak, H. Röck, Scheduling tasks on two processors with deadlines and additional resources, European J. Oper. Res. 26, 1986, 364–370.

    Article  Google Scholar 

  2. J. Błażewicz, W. Cellary, R. Słowiński, J. Węglarz, Scheduling under Resource Constraints: Deterministic Models, J. C. Baltzer, Basel, 1986.

    Google Scholar 

  3. J. Błażewicz, K. Ecker, Scheduling multiprocessor tasks under unit resource constraints, Int. Conf. on Optimization Techniques and Applications, Singapore, April 1987, 161–169.

    Google Scholar 

  4. J. Błażewicz, W. Kubiak, J. Szwarcfiter, Scheduling independent fixed-type tasks, in: R. Słowiński, J. Węglarz (eds.), Advances in Project Scheduling, Elsevier Science Publ., Amsterdam, 1989, 225–236.

    Google Scholar 

  5. J. Błażewicz, Complexity of computer scheduling algorithms under resource constraints, Proc. I Meeting AFCET — SMF on Applied Mathematics, Palaiseau, 1978, 169–178.

    Google Scholar 

  6. J. Błażewicz, J. K. Lenstra, A. H. G. Rinnooy Kan, Scheduling subject to resource constraints: classification and complexity, Discrete Appl. Math. 5, 1983, 11–24.

    Article  Google Scholar 

  7. E. G. Coffman Jr., P. J. Denning, Operating Systems Theory, Prentice-Hall, Englewood Cliffs, N. J., 1973.

    Google Scholar 

  8. E. G: Coffman Jr., M. R. Garey, D. S. Johnson, Approximation algorithms for bin-packing — an updated survey, in: G. Ausiello, M. Lucertini, P. Seraflni (eds.), Algorithms Design for Computer System Design, Springer Verlag, Wien, 1984, 49–106.

    Google Scholar 

  9. E. G. Coffman Jr., M. R. Garey, D. S. Johnson, A. S. La Paugh, Scheduling file transfers in a distributed network, Proc. 2nd ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, Montreal, 1983.

    Google Scholar 

  10. M. R. Garey, R. L. Graham, Bounds for multiprocessor scheduling with resource constraints, SIAM J. Comput. 4, 1975, 187–200.

    Article  Google Scholar 

  11. M. R. Garey, D. S. Johnson, Complexity results for multiprocessor scheduling under resource constraints, SIAM J. Comput. 4, 1975, 397–411.

    Article  Google Scholar 

  12. A. Janiak, Flow-shop scheduling with controllable operation processing times, in: H. P. Geering, M. Mansour (eds.), Large Scale Systems: Theory and Applications, Pergamon Press, 1986, 602–605.

    Google Scholar 

  13. A. Janiak, Single machine sequencing with linear models of jobs subject to precedence constraints, Archiwum Aut. i Telem. 33, 1988, 203–210.

    Google Scholar 

  14. A. Janiak, Permutaeyjny problem przepfywowy z liniowymi modelami operacji, Zeszyty Naukowe Politechniki. Słaskiej. ser. Automatyka 94, 1918, 125–138.

    Google Scholar 

  15. A. Janiak, Minimization of the total resource consumption in permutation flow-shop sequencing subject to a given makespan, J. Modelling, Simulation and Control (AMSE Press) 13, 1988, 1–11.

    Google Scholar 

  16. A. Janiak, General flow-shop scheduling with resource constraints, Internal. J. Production Res. 26, 1988, 1089–1103.

    Article  Google Scholar 

  17. A. Janiak, Minimization of resource consumption under a given deadline in two-processor flow-shop scheduling problem, Inform. Process. Lett. 32, 1989, 101–112.

    Article  Google Scholar 

  18. A. Janiak, Minimization of the blooming mill standstills — mathematical model. Suboptimal algorithms, Zesz. Nauk. AGH s. Mechanika 8, 1989, 37–49.

    Google Scholar 

  19. A. Janiak, Dokladne i przyblizone algorytmy szeregowania zadan i rozdzialu zasobow w dyskretnych procesach przemyslowych, Prace Naukowe Instytutu Cybernetyki Technicznej Politeehniki Wroclawskiej 87, Monografie 20, Wroclaw, 1991.

    Google Scholar 

  20. A. Janiak, Single machine scheduling problem with a common deadline and resource dependent release dates, European J. Oper. Res. 53, 1991, 317–325.

    Article  Google Scholar 

  21. J. Grabowski, A. Janiak, Job-shop scheduling with resource-time models of operations, European J. Oper. Res. 28, 1987, 58–73.

    Article  Google Scholar 

  22. N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4, 1984, 373–395.

    Article  Google Scholar 

  23. O. Kariv, S. Even, An O(n2) algorithm for maximum matching in general graphs, 16th Annual Symp. on Foundations of Computer Science, IEEE, 1975, 100–112.

    Google Scholar 

  24. K. L. Krause, V. Y. Shen, H. D. Schwetman, Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems, J. Assoc. Comput. Mach. 22, 1975, 522–550.

    Google Scholar 

  25. E. L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York 1976.

    Google Scholar 

  26. H. W. Lenstra, Jr., Integer programming with a fixed number of variables, Math. Oper. Res. 8, 1983, 538–548.

    Article  Google Scholar 

  27. R. McNaughton, Scheduling with deadlines and loss functions, Management Sci. 12, 1959, 1–12.

    Article  Google Scholar 

  28. E. Nowicki, S. Zdrzalka, Optimal control of a complex of independent operations, Internat. J. Systems Sci. 12, 1981, 77–93.

    Article  Google Scholar 

  29. E. Nowicki, S. Zdrzalka, Optimal control policies for resource allocation in an activity network, European J. Oper. Res. 16, 1984, 198–214.

    Article  Google Scholar 

  30. E. Nowicki, S. Zdrzalka, Scheduling jobs with controllable processing times as an optimal control problem, Internat. J. Control 39, 1984, 839–848.

    Article  Google Scholar 

  31. R. Słowiński, J. Węglarz (eds.), Advances in Project Scheduling, Elsevier, Amsterdam, 1989.

    Google Scholar 

  32. J. Węglarz, J. Błażewicz, W. Cellary, R. Słowiński, An automatic revised simplex method for constrained resource network scheduling, ACM Trans. Math. Software 3, 295–300, 1977.

    Article  Google Scholar 

  33. J. Węglarz, Multiprocessor scheduling with memory allocation — a deterministic approach, IEEE Trans. Comput. C-29, 1980, 703–709.

    Article  Google Scholar 

  34. J. Węglarz, Project scheduling with continuously-divisible, doubly constrained resources, Management Sci. 27, 1981, 1040–1052.

    Article  Google Scholar 

  35. J. Węglarz, Modelling and control of dynamic resource allocation project scheduling systems, in: S. G. Tzafestas (ed.), Optimization and Control of Dynamic Operational Research Models, North-Holland, Amsterdam, 1982.

    Google Scholar 

  36. J. Węglarz, Project scheduling under continuous processing speed vs. resource amount functions, 1989. Chapter II.5 in [SW 89].

    Google Scholar 

  37. J. Węglarz, Synthesis problems in allocating continuous, doubly constrained resources, in: H. E. Bradley (ed.), Operational Research ’90 — Selected Papers from the 12th IFORS International Conference, Pergamon Press, Oxford, 1991, 715–725.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instytut Informatyki, Politechnika Poznanska, ul. Piotrowo 3a, 60-965, Poznań, Poland

    Prof. Dr. Jacek Błazewicz & Prof. Dr. Jan Węglarz

  2. Institut für Informatik, Technische Universität Clausthal, Erzstr. 1, 38678, Clausthal-Zellerfeld, Germany

    Prof. Dr. Klaus H. Ecker

  3. Lehrstuhl für Betriebswirtschaftslehre, insbesondere Wirtschaftsinformatik II, Universität des Saarlandes, Gebäude 30, Postfach 151150, 66041, Saarbrücken, Germany

    Prof. Dr. Günter Schmidt

Authors
  1. Prof. Dr. Jacek Błazewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Prof. Dr. Klaus H. Ecker
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Prof. Dr. Günter Schmidt
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Prof. Dr. Jan Węglarz
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin · Heidelberg

About this chapter

Cite this chapter

Błazewicz, J., Ecker, K.H., Schmidt, G., Węglarz, J. (1994). Resource Constrained Scheduling. In: Scheduling in Computer and Manufacturing Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-79034-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-79034-8_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-79036-2

  • Online ISBN: 978-3-642-79034-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation