Skip to main content
SpringerLink
Log in

One-machine scheduling problems with resource constraints

  • Conference paper
  • First Online:
System Modelling and Optimization

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

Abstract

One-machines scheduling problems with maximum lateness and maximum tardiness criteria are generalized on the case with allocation of continuously-divisible constrained nonrenewable resource. Models of operation are assumed to be duration versus resource amount linear functions. For the problems with maximum lateness and the maximum tardiness criteria under equal release dates (i.e. moments at which operations are available for processing) polynomial-time algorithms are found. It is shown that the problem with maximum lateness criterion under unequal release dates is NP-hard. For this problem a branch-and-bound algorithm (utilizing properties shown) is outlined.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

  2. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.

    Google Scholar 

  3. J. Grabowski and A. Janiak, Sequencing problem with resource constraints in: Cybernetics and Systems Research 2, Elsevier Science Publishers B.V. (North-Holland), 329–333, 1984.

    Google Scholar 

  4. J. Grabowski and A. Janiak, On job-shop scheduling with resource constraints in: Lecture Notes in Control and Information Sciences 59, Springer-Verlag, 193–200, 1984.

    Google Scholar 

  5. B.J. Lageweg, J.K. Lenstra and A.H.G. Rinnooy Kan, Minimizing maximum lateness on one machine: computational experience and some applications, Statistica Neerlandica 30, 25–41, 1976.

    Google Scholar 

  6. L. Lawler, Optimal sequencing of a single machine subject to precedence constraints, Manag. Science 19, 544–546, 1973.

    Google Scholar 

  7. R. Słowinski, Multiobjective network scheduling with efficient use of renewable and nonrenewable resources, Europ. J. Opl. Res. 7, 265–273, 1981.

    Google Scholar 

  8. J. Węglarz, Project scheduling with discrete and continuous resources, IEEE Trans. SMC-9, 644–650, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Eng. Cybernetics, Techn. University of Wrocław, Wrocław, Poland

    Adam Janiak

Authors
  1. Adam Janiak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. Prékopa J. Szelezsáan B. Strazicky

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag

About this paper

Cite this paper

Janiak, A. (1986). One-machine scheduling problems with resource constraints. In: Prékopa, A., Szelezsáan, J., Strazicky, B. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 84. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0043857

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16854-6

  • Online ISBN: 978-3-540-47138-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation