SOLVING THE DAYS-OFF SCHEDULING PROBLEM USING QUADRATIC PROGRAMMING WITH CIRCULANT MATRIX

The purpose of this paper is the approach of a mathematical model dedicated to planning the consecutive days off of a company’s employees. Companies must find a flexible work schedule between employees, always considering the satisfaction of work tasks as well as guaranteeing consecutive days off. T...

Full description

Saved in:
Bibliographic Details
Published in:Journal of Engineering Science (Chişinău) Vol. 29; no. 4; pp. 97 - 108
Main Authors: Moraru, Vasile, Istrati, Daniela, Zaporojan, Sergiu
Format: Journal Article
Language:English
Published: Technical University of Moldova 01.01.2023
Subjects:
binary quadratic programming
circulant matrix
convex relaxation
scheduling problem
separable optimization
ISSN:2587-3474, 2587-3482
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The purpose of this paper is the approach of a mathematical model dedicated to planning the consecutive days off of a company’s employees. Companies must find a flexible work schedule between employees, always considering the satisfaction of work tasks as well as guaranteeing consecutive days off. The analysis is based on solving a quadratic programming problem with binary variables. The proposed method uses the properties of the circulant symmetric matrix in the researched model, which allows the transformation of the considered problems into an equivalent separable non-convex optimization problem. A practical continuous convex relaxation approach is proposed. DC Algorithm is used to solve relaxed problems. A solved numerical example is presented.
ISSN:2587-3474
2587-3482
DOI:10.52326/jes.utm.2022.29(4).05