Authors: Pierre-Antoine Morin; Christian Artigues; Alain Haït
Addresses: ISAE SUPAERO, University of Toulouse, Toulouse, France; LAAS CNRS, University of Toulouse, CNRS, Toulouse, France ' LAAS CNRS, University of Toulouse, CNRS, Toulouse, France ' ISAE SUPAERO, University of Toulouse, Toulouse, France; LAAS CNRS, University of Toulouse, CNRS, Toulouse, France
Abstract: In this paper, a new project scheduling problem is introduced, the periodically aggregated resource-constrained project scheduling problem (PARCPSP), in which the resource usage is considered on average over aggregated periods of parameterised length, while temporal aspects (start/completion dates of activities and precedence relations) are taken into account in an exact manner. A mixed integer linear programming formulation based on a mixed time representation is given. The adaptation of schedule generation schemes developed for standard project scheduling problems is discussed. An iterative solution scheme is described; experiments show that this method permits to find better upper bounds and sometimes enables to reduce the overall computational time. [Received 30 September 2016; Revised 28 January; Revised 5 July 2017; Accepted 16 September 2017]
Keywords: periodically aggregated resource-constrained project scheduling problem; PARCPSP; mixed integer linear programming; MILP; schedule generation schemes; SGS; iterative solution scheme; ISS.
European Journal of Industrial Engineering, 2017 Vol.11 No.6, pp.792 - 817
Accepted: 07 Sep 2017
Published online: 03 Jan 2018 *