DSpace Repository

Solving the days-off scheduling problem using quadratic programming with circulant matrix

Show simple item record

dc.contributor.author MORARU, Vasile
dc.contributor.author ISTRATI, Daniela
dc.contributor.author ZAPOROJAN, Sergiu
dc.date.accessioned 2023-01-18T08:04:11Z
dc.date.available 2023-01-18T08:04:11Z
dc.date.issued 2022
dc.identifier.citation MORARU, Vasile, ISTRATI, Daniela, ZAPOROJAN, Sergiu. Solving the days-off scheduling problem using quadratic programming with circulant matrix. In: Journal of Engineering Science. 2022, vol. 29, nr. 4, pp. 97-108. ISSN 2587-3474, eISSN 2587-3482. en_US
dc.identifier.issn 2587-3474
dc.identifier.issn 2587-3482
dc.identifier.uri https://doi.org/10.52326/jes.utm.2022.29(4).05
dc.identifier.uri http://repository.utm.md/handle/5014/22016
dc.description.abstract 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. en_US
dc.description.abstract Scopul acestei lucrări este abordarea unui model matematic dedicat planificării zilelor libere consecutive ale angajaților unei companii. Companiile trebuie să găsească un program de lucru flexibil între angajați, având întotdeauna în vedere satisfacerea sarcinilor de lucru cât și garantarea zilelor libere consecutive. Tratarea se bazează pe rezolvarea unei probleme de programare pătratică cu variabile binare. Metoda propusă utilizează proprietățile matricei simetrice circulante din modelul cercetat, care permite transformarea problemei considerate într-o problemă echivalentă de optimizare neconvexă separabilă. Este propusă o abordare practică de relaxare continuă convexă. Pentru rezolvarea problemei relaxate se utilizează Algoritmul DC. Se prezintă un exemplu numeric rezolvat. en_US
dc.language.iso en en_US
dc.publisher Technical University of Moldova en_US
dc.relation.ispartofseries Journal of Engineering Science;2022, V. 29, N. 4
dc.rights Attribution-NonCommercial-NoDerivs 3.0 United States *
dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/3.0/us/ *
dc.subject mathematical models en_US
dc.subject days off planning en_US
dc.subject scheduling problems en_US
dc.subject binary quadratic programming en_US
dc.subject circulant matrix en_US
dc.subject separable optimization en_US
dc.subject convex relaxation en_US
dc.subject planificarea zilelor libere en_US
dc.subject programare pătratică binară en_US
dc.subject matrice circulantă en_US
dc.subject optimizare separabilă en_US
dc.subject relaxare convexă en_US
dc.subject modele matematice en_US
dc.title Solving the days-off scheduling problem using quadratic programming with circulant matrix en_US
dc.title.alternative Rezolvarea problemei planificării zilelor libere folosind programarea pătratică cu matricea circulantă en_US
dc.type Article en_US


Files in this item

The following license files are associated with this item:

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 United States Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 United States

Search DSpace


Advanced Search

Browse

My Account