Dear scheduling researcher, We are delighted to announce the talk given by Bruno Escoffier (LIP6, Sorbonne). The title is "Resource Leveling for Scheduling Problems: Some Complexity and Approximation Results". The seminar will take place on Zoom on Wednesday, April 15 at 13:00 UTC. Join Zoom Meeting https://cesnet.zoom.us/j/93518304259?pwd=raL1poIlb2JMYLa3rJeU746uORq1Xh.1 Meeting ID: 935 1830 4259 Passcode: 688261 You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A The abstract follows. Scheduling problems usually consider resource constraints as hard constraints. In resource leveling instead, a function of resource use is optimized, typically under a deadline constraint. This is motivated by the fact that, in practice, additional resources (e.g., workforce or machines) can be mobilized in order to meet a deadline, yet at some cost. In this talk we will focus on the following setting: given a (target) resource level, our goal is to schedule the jobs in such a way as to best respect this resource level, that is to say, to exceed it as little as possible. We study classical scheduling problems (with or without precedence constraints, with arbitrary or unit processing times,...) in this setting, providing both positive and negative complexity and approximability results. The next talk in our series will be Alena Otto (TU Munich)| April 29 | Overcoming poor data quality: Optimizing validation of precedence relation data. For more details, please visit https://schedulingseminar.com/ With kind regards Zdenek Hanzalek, Michael Pinedo and Guohua Wan