Datum / čas
Date(s) - 15.04.
15:00 - 17:00
Kategorie ne Kategorie
Resource Leveling For Scheduling Problems: Some Complexity And Approximation Results
by
LIP6, Sorbonne University
Abstract:
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.
Scheduling Seminar
Objective of a virtual seminar on scheduling research and applications is to discuss both the field’s newest advancements and survey traditional areas. Seminars take place typically on every second Wednesday through three different time zones (Europe, the Middle East & Africa, North America & South America, and Asia, Australia & Oceania).