This article is cited in 2 papers

Computer-Aided Management Information Systems, Production Control Systems

On the calendar planning problem with renewable resource

Yu. V. Kovalenko

Dostoevskii Omsk State University, Omsk, Russia

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.

Presented by the member of Editorial Board: V. V. Kul'ba

Received: 30.03.2011

 English version: Automation and Remote Control, 2012, 73:6, 1046–1055

Bibliographic databases:

• 
•