期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2013
卷号：49
期号：1
出版社：Journal of Theoretical and Applied
摘要：Workforce scheduling is one of the most important and practical problems in the service of industry and continuous manufacturing settings. Solving this problem requires determining how many workers must be assigned to each of the planning periods of work time for an organization. In this paper, our main objective is to solve the days-off scheduling problem with day task constraints. This problem is naturally formulated as 0-1 quadratic programming subject to linear constraints. To solve the latter problem, we formulate it as an equivalent 0-1 quadratic programming with a convex objective function using two convexification techniques, the first one is based on the smallest eigenvalue and the second uses the semidefinite relaxation. Some numerical examples and computational experiments assess the effectiveness of the theoretical results shown in this paper.
