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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of Engineering Science (Chişinău) Ročník 29; číslo 4; s. 97 - 108
Hlavní autori: Moraru, Vasile, Istrati, Daniela, Zaporojan, Sergiu
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Technical University of Moldova 01.01.2023
Predmet:
binary quadratic programming
circulant matrix
convex relaxation
scheduling problem
separable optimization
ISSN:2587-3474, 2587-3482
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
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.
AbstractList 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.
Author Moraru, Vasile
Zaporojan, Sergiu
Istrati, Daniela
Author_xml – sequence: 1
  givenname: Vasile
  orcidid: 0000-0002-6400-1374
  surname: Moraru
  fullname: Moraru, Vasile
– sequence: 2
  givenname: Daniela
  orcidid: 0000-0002-1607-9273
  surname: Istrati
  fullname: Istrati, Daniela
– sequence: 3
  givenname: Sergiu
  orcidid: 0000-0001-5928-4229
  surname: Zaporojan
  fullname: Zaporojan, Sergiu
BookMark eNo9kEtPg0AURiemJtbav2BY6gIc5s0SKS0kUJSH2tVkGMC0acVAXfjvhdZ0db97FmdxbsHkq_2qAbi3oUURRuxpV_fWz_FgIYiQhZwH8mhBegWmiApuYiLQ5LI5uQHzvt9BCJFwbCboFGyyJHoL1ysjD3xj4W4yM1kujcwL_EURjfwlTZ4jPzaKbPxeC3eRunnojXyVunE80vcwDwwvTL0icte5Ebt5Gn7cgetG7ft6_n9nIF_6uReYUbIKPTcytc0gNTUtteZEURsKognFDnFYU5KyUYwqhxJUEcwrxW0ukIZlCVGlncqBFcKQQTwD4VlbtWonv7vtQXW_slVbeQJt9ylVd9zqfS054kKJBnGGOSlVowa9YE1V1kIrDfXgYmeX7tq-7-rm4rOhPOWWQ2455JZjbokcSaSEFP8BtT1vPA
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.52326/jes.utm.2022.29(4).05
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
EISSN 2587-3482
EndPage 108
ExternalDocumentID oai_doaj_org_article_7278a8f276374bafaa9586fdbe8cac0c
10_52326_jes_utm_2022_29_4__05
GroupedDBID AAYXX
ADBBV
ALMA_UNASSIGNED_HOLDINGS
BCNDV
CITATION
GROUPED_DOAJ
ID FETCH-LOGICAL-c1605-c5bcc74a51084c4539496fb4bfa65a9542d437da71782c0bb02dc9d90d230603
IEDL.DBID DOA
ISSN 2587-3474
IngestDate Fri Oct 03 12:43:19 EDT 2025
Sat Nov 29 02:05:36 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c1605-c5bcc74a51084c4539496fb4bfa65a9542d437da71782c0bb02dc9d90d230603
ORCID 0000-0001-5928-4229
0000-0002-6400-1374
0000-0002-1607-9273
OpenAccessLink https://doaj.org/article/7278a8f276374bafaa9586fdbe8cac0c
PageCount 12
ParticipantIDs doaj_primary_oai_doaj_org_article_7278a8f276374bafaa9586fdbe8cac0c
crossref_primary_10_52326_jes_utm_2022_29_4__05
PublicationCentury 2000
PublicationDate 2023-01-00
PublicationDateYYYYMMDD 2023-01-01
PublicationDate_xml – month: 01
  year: 2023
  text: 2023-01-00
PublicationDecade 2020
PublicationTitle Journal of Engineering Science (Chişinău)
PublicationYear 2023
Publisher Technical University of Moldova
Publisher_xml – name: Technical University of Moldova
SSID ssj0002891685
Score 2.2056186
Snippet 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...
SourceID doaj
crossref
SourceType Open Website
Index Database
StartPage 97
SubjectTerms binary quadratic programming
circulant matrix
convex relaxation
scheduling problem
separable optimization
Title SOLVING THE DAYS-OFF SCHEDULING PROBLEM USING QUADRATIC PROGRAMMING WITH CIRCULANT MATRIX
URI https://doaj.org/article/7278a8f276374bafaa9586fdbe8cac0c
Volume 29
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2587-3482
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002891685
  issn: 2587-3474
  databaseCode: DOA
  dateStart: 20180101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQxcCCQIB4ywMDDKGpY8f2GNKnlLaoDdBOlh-JRIeCSuH3c04K6sbCFp0SK_oul7vPj_sQummVLSeJDQOmjQyg_rcQUoYH0ljHOVzKSu7tOeOjkZjN5OOW1JffE1a3B66Ba0J-FVqUBOKAU6NLrSUTcelMIay2ofV_35DLLTK1qJfPWnGlx0mYjyLKaX08GHgXiZsLIKGfa38QnZB7Im_p3b3Xr9vKTFsN_KtM0z1A-5sSESf1qx2inWJ5hObTcfY8GPVw3u_gdjKfBuNuF0_Tfqf9lHn742T8kHWG2Oto9DAUqm0__ZR6e2-SDIfe-jLI-zgdTNKnLBnleJjkk8HsGOXdTp72g40sQmBbQD4Cy4y1nGqIJkEtZZGkMi4NNaWOGaBDiaMRdxqImgAvGBMSZ6WTofN0I4xOUGP5tixOEZaxkzwqbMFgPEachlolJCUVkfALmOwMNX8QUe918wsFpKHCUAGGCjBUHkNFpKJKhfDEgwfu927fvLoygEvVxqXqL5ee_8cgF2jPK8PXsyWXqLFefRZXaNd-rV8_VtfV1_INLQi62Q
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=SOLVING+THE+DAYS-OFF+SCHEDULING+PROBLEM+USING+QUADRATIC+PROGRAMMING+WITH+CIRCULANT+MATRIX&rft.jtitle=Journal+of+Engineering+Science+%28Chi%C5%9Fin%C4%83u%29&rft.au=MORARU%2C+Vasile&rft.au=ISTRATI%2C+Daniela&rft.au=ZAPOROJAN%2C+Sergiu&rft.date=2023-01-01&rft.pub=Technical+University+of+Moldova&rft.issn=2587-3474&rft.eissn=2587-3482&rft.volume=XXIX&rft.issue=4&rft.spage=97&rft.epage=108&rft_id=info:doi/10.52326%2Fjes.utm.2022.29%284%29.05&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_7278a8f276374bafaa9586fdbe8cac0c
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2587-3474&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2587-3474&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2587-3474&client=summon