On the calendar planning problem with renewable resource
- 55 Downloads
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.
KeywordsRemote Control Planning Horizon Renewable Resource Time Moment Dynamic Programming Algorithm
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- 5.Kallrath, J., Borisovsky, P., and Kovalenko, J., Scheduling Using Continuous-Time Formulations, Technical Report, BASF SE, Scientific Computing, 2010.Google Scholar
- 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
- 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