Employee scheduling with SAT-based pseudo-boolean constraint solving

The aim of this paper is practical: to show that, for at least one important real-world problem, modern SAT-based technology can beat the extremely mature branch-and-cut solving methods implemented in well-known state-of-the-art commercial solvers such as CPLEX or Gurobi. The problem of employee sch...

Descripción completa

Detalles Bibliográficos
Autores: Nieuwenhuis, Robert Lukas Mario|||0000-0002-6489-2138, Oliveras Llunell, Albert|||0000-0002-5893-1911, Rodríguez Carbonell, Enric|||0000-0003-1061-3954, Rollón Rico, Emma|||0000-0001-8021-9464
Tipo de recurso: artículo
Fecha de publicación:2021
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/355638
Acceso en línea:https://hdl.handle.net/2117/355638
https://dx.doi.org/10.1109/ACCESS.2021.3120597
Access Level:acceso abierto
Palabra clave:Production planning
Production scheduling
Employee scheduling
0-1 integer linear program
Propositional satisfiability
Producció -- Planificació
Àrees temàtiques de la UPC::Informàtica::Aplicacions de la informàtica
id ES_4ff6f3627092dd76392199790875fc9b
oai_identifier_str oai:upcommons.upc.edu:2117/355638
network_acronym_str ES
network_name_str España
repository_id_str
spelling Employee scheduling with SAT-based pseudo-boolean constraint solvingNieuwenhuis, Robert Lukas Mario|||0000-0002-6489-2138Oliveras Llunell, Albert|||0000-0002-5893-1911Rodríguez Carbonell, Enric|||0000-0003-1061-3954Rollón Rico, Emma|||0000-0001-8021-9464Production planningProduction schedulingEmployee scheduling0-1 integer linear programPropositional satisfiabilityProducció -- PlanificacióÀrees temàtiques de la UPC::Informàtica::Aplicacions de la informàticaThe aim of this paper is practical: to show that, for at least one important real-world problem, modern SAT-based technology can beat the extremely mature branch-and-cut solving methods implemented in well-known state-of-the-art commercial solvers such as CPLEX or Gurobi. The problem of employee scheduling consists in assigning a work schedule to each of the employees of an organization, in such a way that demands are met, legal and contractual constraints are respected, and staff preferences are taken into account. This problem is typically handled by first modeling it as a 0-1 integer linear program (ILP). Our experimental setup considers as a case study the 0-1 ILPs obtained from the staff scheduling of a real-world car rental company, and carefully compares the performance of CPLEX and Gurobi with our own simple conflict-driven constraint-learning pseudo-Boolean solver.Project RTI2018-094403-B-C33 funded by MCIN (Ministerio de Ciencia e Innovación)/AEI/10.13039/501100011033/FEDER ‘‘Una manera de hacer Europa.’’Peer ReviewedInstitute of Electrical and Electronics Engineers (IEEE)20212021-01-0120212021-11-04journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/2117/355638https://dx.doi.org/10.1109/ACCESS.2021.3120597reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)InglésengAgencia Estatal de Investigación http://doi.org/10.13039/501100011033 Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020 RTI2018-094403-B-C33 RAZONAMIENTO FORMAL PARA TECNOLOGIAS FACILITADORAS Y EMERGENTESopen accesshttp://purl.org/coar/access_right/c_abf2Attribution 4.0 Internationalhttps://creativecommons.org/licenses/by/4.0/deed.eninfo:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/3556382026-05-27T15:37:01Z
dc.title.none.fl_str_mv Employee scheduling with SAT-based pseudo-boolean constraint solving
title Employee scheduling with SAT-based pseudo-boolean constraint solving
spellingShingle Employee scheduling with SAT-based pseudo-boolean constraint solving
Nieuwenhuis, Robert Lukas Mario|||0000-0002-6489-2138
Production planning
Production scheduling
Employee scheduling
0-1 integer linear program
Propositional satisfiability
Producció -- Planificació
Àrees temàtiques de la UPC::Informàtica::Aplicacions de la informàtica
title_short Employee scheduling with SAT-based pseudo-boolean constraint solving
title_full Employee scheduling with SAT-based pseudo-boolean constraint solving
title_fullStr Employee scheduling with SAT-based pseudo-boolean constraint solving
title_full_unstemmed Employee scheduling with SAT-based pseudo-boolean constraint solving
title_sort Employee scheduling with SAT-based pseudo-boolean constraint solving
dc.creator.none.fl_str_mv Nieuwenhuis, Robert Lukas Mario|||0000-0002-6489-2138
Oliveras Llunell, Albert|||0000-0002-5893-1911
Rodríguez Carbonell, Enric|||0000-0003-1061-3954
Rollón Rico, Emma|||0000-0001-8021-9464
author Nieuwenhuis, Robert Lukas Mario|||0000-0002-6489-2138
author_facet Nieuwenhuis, Robert Lukas Mario|||0000-0002-6489-2138
Oliveras Llunell, Albert|||0000-0002-5893-1911
Rodríguez Carbonell, Enric|||0000-0003-1061-3954
Rollón Rico, Emma|||0000-0001-8021-9464
author_role author
author2 Oliveras Llunell, Albert|||0000-0002-5893-1911
Rodríguez Carbonell, Enric|||0000-0003-1061-3954
Rollón Rico, Emma|||0000-0001-8021-9464
author2_role author
author
author
dc.subject.none.fl_str_mv Production planning
Production scheduling
Employee scheduling
0-1 integer linear program
Propositional satisfiability
Producció -- Planificació
Àrees temàtiques de la UPC::Informàtica::Aplicacions de la informàtica
topic Production planning
Production scheduling
Employee scheduling
0-1 integer linear program
Propositional satisfiability
Producció -- Planificació
Àrees temàtiques de la UPC::Informàtica::Aplicacions de la informàtica
description The aim of this paper is practical: to show that, for at least one important real-world problem, modern SAT-based technology can beat the extremely mature branch-and-cut solving methods implemented in well-known state-of-the-art commercial solvers such as CPLEX or Gurobi. The problem of employee scheduling consists in assigning a work schedule to each of the employees of an organization, in such a way that demands are met, legal and contractual constraints are respected, and staff preferences are taken into account. This problem is typically handled by first modeling it as a 0-1 integer linear program (ILP). Our experimental setup considers as a case study the 0-1 ILPs obtained from the staff scheduling of a real-world car rental company, and carefully compares the performance of CPLEX and Gurobi with our own simple conflict-driven constraint-learning pseudo-Boolean solver.
publishDate 2021
dc.date.none.fl_str_mv 2021
2021-01-01
2021
2021-11-04
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/355638
https://dx.doi.org/10.1109/ACCESS.2021.3120597
url https://hdl.handle.net/2117/355638
https://dx.doi.org/10.1109/ACCESS.2021.3120597
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.relation.none.fl_str_mv Agencia Estatal de Investigación http://doi.org/10.13039/501100011033 Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020 RTI2018-094403-B-C33 RAZONAMIENTO FORMAL PARA TECNOLOGIAS FACILITADORAS Y EMERGENTES
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution 4.0 International
https://creativecommons.org/licenses/by/4.0/deed.en
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution 4.0 International
https://creativecommons.org/licenses/by/4.0/deed.en
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Institute of Electrical and Electronics Engineers (IEEE)
publisher.none.fl_str_mv Institute of Electrical and Electronics Engineers (IEEE)
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869407852160876544
score 15,223283

Similares en LA Referencia