Periodically aggregated resource-constrained project scheduling problem Online publication date: Fri, 05-Jan-2018
by Pierre-Antoine Morin; Christian Artigues; Alain Haït
European J. of Industrial Engineering (EJIE), Vol. 11, No. 6, 2017
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]
Online publication date: Fri, 05-Jan-2018
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org