A BINARY INTEGER LINEAR PROGRAMMING MODEL FOR EMPLOYEE SCHEDULING IN A CONVENIENCE STORE: A CASE STUDY IN NAKHON PATHOM

Convenience stores are workplaces where employees work in shifts. An optimal work schedule for employees is necessary for every convenience store because it enables employees to work more efficiently. This paper considers the employee scheduling of a 24-hour convenience store in Nakhon Pathom. This...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:BAREKENG: Jurnal Ilmu Matematika dan Terapan Jg. 19; H. 4; S. 2843 - 2860
Hauptverfasser: Laisupannawong, Teeradech, Jeenanunta, Chawalit
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Universitas Pattimura 01.09.2025
Schlagworte:
binary integer linear programming
convenience store
scheduling
ISSN:1978-7227, 2615-3017
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Convenience stores are workplaces where employees work in shifts. An optimal work schedule for employees is necessary for every convenience store because it enables employees to work more efficiently. This paper considers the employee scheduling of a 24-hour convenience store in Nakhon Pathom. This store divides working hours into three shifts: morning, noon, and night. Each employee is assigned to the same shift for an entire week before rotating to a different shift in the next week. This paper presents a novel binary integer linear programming model for generating an optimal four-week employee schedule for this convenience store. The objective of the proposed model was to prioritize assigning weekend days off to the manager and assistant managers ahead of the regular staff, while adhering to the constraints outlined in the store’s regulations. The proposed model was solved using the CPLEX software to generate an optimal schedule for the 15 employees at this convenience store. The model could find an optimal schedule with a computational time of less than three seconds, where the days off for the manager and assistant managers could all be scheduled on weekends. The proposed model also verified that the current number of employees at the convenience store is the minimum required to create a feasible work schedule, and the store needs to increase its staff by at least two employees if each employee is to work the night shift for at most one week within a four-week schedule period. The proposed model can be a practical tool for generating an optimal employee schedule for this convenience store in real-life scenarios.
AbstractList Convenience stores are workplaces where employees work in shifts. An optimal work schedule for employees is necessary for every convenience store because it enables employees to work more efficiently. This paper considers the employee scheduling of a 24-hour convenience store in Nakhon Pathom. This store divides working hours into three shifts: morning, noon, and night. Each employee is assigned to the same shift for an entire week before rotating to a different shift in the next week. This paper presents a novel binary integer linear programming model for generating an optimal four-week employee schedule for this convenience store. The objective of the proposed model was to prioritize assigning weekend days off to the manager and assistant managers ahead of the regular staff, while adhering to the constraints outlined in the store’s regulations. The proposed model was solved using the CPLEX software to generate an optimal schedule for the 15 employees at this convenience store. The model could find an optimal schedule with a computational time of less than three seconds, where the days off for the manager and assistant managers could all be scheduled on weekends. The proposed model also verified that the current number of employees at the convenience store is the minimum required to create a feasible work schedule, and the store needs to increase its staff by at least two employees if each employee is to work the night shift for at most one week within a four-week schedule period. The proposed model can be a practical tool for generating an optimal employee schedule for this convenience store in real-life scenarios.
Author Laisupannawong, Teeradech
Jeenanunta, Chawalit
Author_xml – sequence: 1
  givenname: Teeradech
  orcidid: 0000-0003-4705-8456
  surname: Laisupannawong
  fullname: Laisupannawong, Teeradech
– sequence: 2
  givenname: Chawalit
  orcidid: 0000-0002-1932-9776
  surname: Jeenanunta
  fullname: Jeenanunta, Chawalit
BookMark eNp1kctO3DAARS1EJQbKP3jDMsWvxDESC5MxM1ETexRmkFhFjh8o7XQyShBV_74EUHddXd17pbM55-D0MBwCAFcYfaMoFfl1Z8fwMxyeX4c9Fv00seOR5IwmJM_QCViQDKcJRZifggUWPE84IfwMXE5T3yHGeCYETRfgt4R3pZbNEyz1Vq1UA6tSK9nATWNWjazrUq9gbZaqgvemgareVOZJKfhQrNVyV81vqaGEhdGPSpdKF2_f1jTqZh7lw9x2y5kOtfy-Nhpu5HZt6q_gS7T7KVx-5gXY3attsU4qsyoLWSWOMI4STztLrECeR4xcsHkWmbfI-uCs54H6LktZ3sVUpIExhIUTKDIaInYCx9zTC1B-cP1gf7THsf9lxz_tYPv2fRjG59aOL73bhxZ3BDFnGacCsTTHAjvMmPeMhOiYE2-s2w-WG4dpGkP8x8OofZfS_kdKO0uhfwELJX5R
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.30598/barekengvol19iss4pp2843-2860
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: Directory of Open Access Journals (DOAJ)
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
EISSN 2615-3017
EndPage 2860
ExternalDocumentID oai_doaj_org_article_1b204ca47390458191c144dd42efc4c9
10_30598_barekengvol19iss4pp2843_2860
GroupedDBID AAYXX
ALMA_UNASSIGNED_HOLDINGS
CITATION
GROUPED_DOAJ
ID FETCH-LOGICAL-c2470-d3ba2a90d7f10cea86f4da0adecad7e3db6548bf595e44019c90f43ef1c91f8d3
IEDL.DBID DOA
ISSN 1978-7227
IngestDate Fri Oct 03 12:51:02 EDT 2025
Sat Nov 29 07:32:08 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
License http://creativecommons.org/licenses/by-sa/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2470-d3ba2a90d7f10cea86f4da0adecad7e3db6548bf595e44019c90f43ef1c91f8d3
ORCID 0000-0003-4705-8456
0000-0002-1932-9776
OpenAccessLink https://doaj.org/article/1b204ca47390458191c144dd42efc4c9
PageCount 18
ParticipantIDs doaj_primary_oai_doaj_org_article_1b204ca47390458191c144dd42efc4c9
crossref_primary_10_30598_barekengvol19iss4pp2843_2860
PublicationCentury 2000
PublicationDate 2025-09-01
PublicationDateYYYYMMDD 2025-09-01
PublicationDate_xml – month: 09
  year: 2025
  text: 2025-09-01
  day: 01
PublicationDecade 2020
PublicationTitle BAREKENG: Jurnal Ilmu Matematika dan Terapan
PublicationYear 2025
Publisher Universitas Pattimura
Publisher_xml – name: Universitas Pattimura
SSID ssib044769935
ssib044731219
Score 2.3020678
Snippet Convenience stores are workplaces where employees work in shifts. An optimal work schedule for employees is necessary for every convenience store because it...
SourceID doaj
crossref
SourceType Open Website
Index Database
StartPage 2843
SubjectTerms binary integer linear programming
convenience store
scheduling
Title A BINARY INTEGER LINEAR PROGRAMMING MODEL FOR EMPLOYEE SCHEDULING IN A CONVENIENCE STORE: A CASE STUDY IN NAKHON PATHOM
URI https://doaj.org/article/1b204ca47390458191c144dd42efc4c9
Volume 19
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: Directory of Open Access Journals (DOAJ)
  customDbUrl:
  eissn: 2615-3017
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044769935
  issn: 1978-7227
  databaseCode: DOA
  dateStart: 20070101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2615-3017
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044731219
  issn: 1978-7227
  databaseCode: M~E
  dateStart: 20070101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3Pb9MwGLXQhNAuaAgQg4F8GMdoiX808W5e67UVjVOlLdpOkWM7E0IqVfeDf5_PTmG9TLtwix3HSp4--fte4ryH0KklxvPCpgkH-pGwohMJHNDEGuodpY5b35tN5FoXV1divmf1FfaE9fLAPXBnWUtSZg3LgZwzHuiFBQ7gHCO-s8zGX_fSXOyRKYgkBsMz8ihUBu0BJGIePzEDbcoJyV-hr4GyQnlRnLVm63_69Q2sCJmAB2abDSzbNCFFlK58TFh7uv4xAV0eode7yhHL_o7foBd-_Rb9lvhiqmV9jYO27VjVeDbVStZ4XlfjWpblVI9xWY3UDAPdw6qcz6prpfBiOFGj1SycnWos8bDS35WO75vwYlnV6jx0ykVorUZhdqzlt0ml8VwuJ1X5Dq0u1XI4SXZeCoklLE8TR1tDjEhd3mWp9aYYdMyZ1Dhvjcs9dW0wkG87LrhnwLmEFWnHqO8yK7KucPQ9Olj_WvsPCBNug2U6jHGEtW5gMgC35QVkWyjWqDhGg7-ANZteMqMBqhGRbp5AuglIH6OLAO-_i4LydeyAeGh28dA8Fw8f_8ckn9AhCT6_cS_ZCTq42977z-ilfbj7cbv9EkPtD8b-y9k
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=A+BINARY+INTEGER+LINEAR+PROGRAMMING+MODEL+FOR+EMPLOYEE+SCHEDULING+IN+A+CONVENIENCE+STORE%3A+A+CASE+STUDY+IN+NAKHON+PATHOM&rft.jtitle=BAREKENG%3A+Jurnal+Ilmu+Matematika+dan+Terapan&rft.au=Laisupannawong%2C+Teeradech&rft.au=Jeenanunta%2C+Chawalit&rft.date=2025-09-01&rft.issn=1978-7227&rft.eissn=2615-3017&rft.volume=19&rft.issue=4&rft.spage=2843&rft.epage=2860&rft_id=info:doi/10.30598%2Fbarekengvol19iss4pp2843-2860&rft.externalDBID=n%2Fa&rft.externalDocID=10_30598_barekengvol19iss4pp2843_2860
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1978-7227&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1978-7227&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1978-7227&client=summon