Year: 2010
Type: report
Abstract: This paper analyzes stability in multi-skill workforce schedules. In our stability analysis, we extend the notion of blocking pairs as stated in the Marriage model of Gale-Shapley. It is shown that finding stable schedules is NP-Hard. In some special cases stable schedules can be constructed in polynomial time. An integer linear programming model is proposed to decrease the instability of schedules.
Source: TU/e Research Portal
Authors: Murat Fırat, C.A.J. Hurkens, Alexandre Laugier
Language: English
Field: Decision Sciences
Domain: Social Sciences
Open Access status: green
OpenAlex ID: W2119378474
