Dear scheduling researcher,

We are delighted to announce the talk given by Norbert Trautmann (University of Bern).
The title is "Mixed-integer linear programming for project scheduling with resource-unit related constraints". The seminar will take place on Zoom on Wednesday, December 4 at 14:00 UTC.

Join Zoom Meeting
https://cesnet.zoom.us/j/93745359018?pwd=WPl0pMPIc8GP7Ou2GxRTKzxusUqjow.1

Meeting ID: 937 4535 9018
Passcode: 272218

You can follow the seminar online or offline on our Youtube channel as well:
https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A

The abstract follows.
The widely discussed Resource-Constrained Project Scheduling Problem (RCPSP) consists in devising a schedule for the execution of the project activities such that (a) the project duration is minimized, (b) the completion-start precedence between given pairs of activities is respected, and (c) at no time does the total demand of the in-progress activities exceed the available capacity of the various resource types required for the execution of the activities. In the literature, different formulations of the RCPSP have been presented as binary or mixed-binary linear optimization problems; according to the time representation, the two groups of discrete-time and continuous-time formulations can be distinguished. In many applications, resource types represent pools of equipment units or teams of people with specific skills. In this talk, we consider two novel variants of the RCPSP in which additional constraints related to the individual units of the various resource types have to be considered. In the first variant, the execution of the project is distributed across multiple sites, i.e., for the execution of each activity, a particular site must be selected; moreover, while some resource units are available only at a particular site, other resource units can be moved between sites, requiring some transportation time. In the second variant, the workload should be balanced among the individual units of each resource type. For both variants, we present a continuous-time assignment-based formulation as a mixed-binary linear optimization problem.

The next talk in our series will be announced in January 2025.

For more details, please visit https://schedulingseminar.com/

With kind regards

Zdenek Hanzalek, Michael Pinedo and Guohua Wan

-- 
Zdenek Hanzalek
Industrial Informatics Department,
Czech Institute of Informatics, Robotics and Cybernetics,
Czech Technical University in Prague,
Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic
https://rtime.ciirc.cvut.cz/~hanzalek/