Periodically aggregated resource-constrained project scheduling problem

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.

[1]  C. Artigues,et al.  A new relaxation of the Resource-Constrained Project Scheduling Problem , 2016 .

[2]  Axel Tuma,et al.  Energy-efficient scheduling in manufacturing companies: A review and research framework , 2016, Eur. J. Oper. Res..

[3]  Carlos A. Méndez,et al.  Improved time representation model for the simultaneous energy supply and demand management in microgrids , 2015 .

[4]  Sigrid Knust,et al.  A classification scheme for integrated staff rostering and scheduling problems , 2015, RAIRO Oper. Res..

[5]  Purushothaman Damodaran,et al.  A branch and price solution approach for order acceptance and capacity planning in make-to-order operations , 2011, Eur. J. Oper. Res..

[6]  Pedro M. Castro,et al.  Optimal scheduling of continuous plants with energy constraints , 2011, Comput. Chem. Eng..

[7]  Michel Gendreau,et al.  Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound , 2009, Comput. Oper. Res..

[8]  I. Grossmann,et al.  New continuous-time scheduling formulation for continuous plants under variable electricity cost , 2009 .

[9]  Christian Artigues,et al.  Resource-Constrained Project Scheduling: Models, Algorithms, Extensions and Applications , 2007 .

[10]  Tamás Kis,et al.  A branch-and-cut algorithm for scheduling of projects with variable-intensity activities , 2005, Math. Program..

[11]  Christodoulos A. Floudas,et al.  Continuous-time versus discrete-time approaches for scheduling of chemical processes: a review , 2004, Comput. Chem. Eng..

[12]  Elias Willem Hans,et al.  Resource Loading by Branch-and-Price Techniques , 2001 .

[13]  Michael Pinedo.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[14]  James F. Allen.  An Interval-Based Representation of Temporal Knowledge , 1981, IJCAI.

[15]  Christoph Schwindt,et al.  Handbook on project management and scheduling , 2015 .

[16]  Christian Artigues,et al.  An hybrid CP/MILP method for scheduling with energy costs , 2010 .

[17]  Rainer Kolisch,et al.  PSPLIB - a project scheduling problem library , 1996 .

[18]  Noud Gademann,et al.  Please Scroll down for Article Iie Transactions Linear-programming-based Heuristics for Project Capacity Planning Linear-programming-based Heuristics for Project Capacity Planning , 2022 .