Skip to main content
SpringerLink
Log in

On the calendar planning problem with renewable resource

  • Computer-Aided Information Control Systems, Process Control Systems
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

We consider a strongly NP-hard calendar planning problem with constraints on resource consumption and job ordering. One characteristic feature of our problem setting is that resource consumption intensities by different jobs may change during their processing, and resource availability depends on time. To solve the problem, we construct an integer programming model and develop a dynamic programming algorithm. We distinguish a special case of the problem that can be solved in pseudopolynomial time. We show numerical experiments on randomly generated test examples.

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

Similar content being viewed by others

References

  1. Servakh, V.V., An Efficiently Solvable Case of Calendar Planning Problems with Renewable Resource, Diskret. Anal. Issled. Oper., 2000, ser. 2, vol. 7, no. 1, pp. 75–82.

    MathSciNet  MATH  Google Scholar 

  2. Garey, M.R. and Johnson, D.S., Complexity Results for Multiprocessor Scheduling under Resource Constraints, SIAM J. Comput., 1975, vol. 4, no. 4, pp. 397–411.

    Article  MathSciNet  MATH  Google Scholar 

  3. Servah, V.V. and Shcherbinina, T.A., A Fully Polynomial Time Approximation Scheme for Two Project Scheduling Problems, Proc. 12th IFAC Int. Sympos., Dolgui, A., Morel, G., and Pereira, C.E., Eds., Elsevier, 2007, vol. 3, pp. 129–134.

  4. Gimadi, E.Kh., Zalyubovskii, V.V., and Sevast’yanov, S.V., Polynomial Solvability of Calendar Planning Problems with Stored Resources and Directive Deadlines, Diskret. Anal. Issled. Oper., 2000, ser. 2, vol. 7, no. 1, pp. 9–34.

    MathSciNet  MATH  Google Scholar 

  5. Kallrath, J., Borisovsky, P., and Kovalenko, J., Scheduling Using Continuous-Time Formulations, Technical Report, BASF SE, Scientific Computing, 2010.

  6. Kovalenko, Yu.V., Solving the Calendar Planning Problem with a Production with Continuous Raw Material Intake, in Youth of the Third Millenium: XXXIV Regional Sci.-Pract. Student Conf., “Phys.-Mat. Sci.” Section Proceedings, Omsk: Omsk. Gos. Univ., 2010, pp. 21–24.

    Google Scholar 

  7. Sprecher, A., Kolisch, R., and Drexl, A., Semi-Active, Active, and Non-Delay Schedules for the Resource-Constrained Project Scheduling Problem, Eur. J. Oper. Res., 1995, vol. 80, pp. 94–102.

    Article  MATH  Google Scholar 

  8. Gimadi, E.Kh. and Glebov, N.I., Diskretnye ekstremal’nye zadachi prinyatiya reshenii (Discrete Extremal Decision Problems), Novosibirsk: Novosib. Gos. Univ., 1991.

    Google Scholar 

  9. Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: Freeman, 1979. Translation under the title Vychislitel’nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dostoevsky Omsk State University, Omsk, Russia

    Yu. V. Kovalenko

Authors
  1. Yu. V. Kovalenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © Yu.V. Kovalenko, 2012, published in Avtomatika i Telemekhanika, 2012, No. 6, pp. 140–153.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kovalenko, Y.V. On the calendar planning problem with renewable resource. Autom Remote Control 73, 1046–1055 (2012). https://doi.org/10.1134/S0005117912060094

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117912060094

Keywords

Search

Navigation