Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups

Detalhes bibliográficos
Autor(a) principal: Martinovic, John
Data de Publicação: 2022
Outros Autores: Strasdat, Nico, Valério de Carvalho, José Manuel, Furini, Fabio
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
Texto Completo: https://hdl.handle.net/1822/89925
Resumo: The instances were solved by the commercial software Gurobi. The underlying implementation of the models in Python can be found in https://github.com/wotzlaff/tbpp-cf2.
id RCAP_d49d86aa5892e12001c9f183cefc1acc
oai_identifier_str oai:repositorium.sdum.uminho.pt:1822/89925
network_acronym_str RCAP
network_name_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository_id_str https://opendoar.ac.uk/repository/7160
spelling Variable and constraint reduction techniques for the temporal bin packing problem with fire-upsCutting and packingTemporal bin packing problemFire-upsInteger linear programmingEngenharia e Tecnologia::Outras Engenharias e TecnologiasScience & TechnologyThe instances were solved by the commercial software Gurobi. The underlying implementation of the models in Python can be found in https://github.com/wotzlaff/tbpp-cf2.The aim of this letter is to design and computationally test several improvements for the compact integer linear programming (ILP) formulations of the temporal bin packing problem with fire-ups (TBPP-FU). This problem is a challenging generalization of the classical bin packing problem in which the items, interpreted as jobs of given weight, are active only during an associated time window. The TBPP-FU objective function asks for the minimization of the weighted sum of the number of bins, viewed as servers of given capacity, to execute all the jobs and the total number of fire-ups. The fire-ups count the number of times the servers are activated due to the presence of assigned active jobs. Our contributions are effective procedures to reduce the number of variables and constraints of the ILP formulations proposed in the literature as well as the introduction of new valid inequalities. By extensive computational tests we show that substantial improvements can be achieved and several instances from the literature can be solved to proven optimality for the first time.Open Access funding enabled and organized by Projekt DEAL.SpringerUniversidade do MinhoMartinovic, JohnStrasdat, NicoValério de Carvalho, José ManuelFurini, Fabio20222022-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/1822/89925engMartinovic, J., Strasdat, N., Valério de Carvalho, J. et al. Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups. Optim Lett 16, 2333–2358 (2022). https://doi.org/10.1007/s11590-021-01825-x1862-44721862-448010.1007/s11590-021-01825-xhttps://link.springer.com/article/10.1007/s11590-021-01825-xinfo:eu-repo/semantics/openAccessreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2024-09-07T01:29:20Zoai:repositorium.sdum.uminho.pt:1822/89925Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-28T15:15:53.103276Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse
dc.title.none.fl_str_mv Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
title Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
spellingShingle Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
Martinovic, John
Cutting and packing
Temporal bin packing problem
Fire-ups
Integer linear programming
Engenharia e Tecnologia::Outras Engenharias e Tecnologias
Science & Technology
title_short Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
title_full Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
title_fullStr Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
title_full_unstemmed Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
title_sort Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
author Martinovic, John
author_facet Martinovic, John
Strasdat, Nico
Valério de Carvalho, José Manuel
Furini, Fabio
author_role author
author2 Strasdat, Nico
Valério de Carvalho, José Manuel
Furini, Fabio
author2_role author
author
author
dc.contributor.none.fl_str_mv Universidade do Minho
dc.contributor.author.fl_str_mv Martinovic, John
Strasdat, Nico
Valério de Carvalho, José Manuel
Furini, Fabio
dc.subject.por.fl_str_mv Cutting and packing
Temporal bin packing problem
Fire-ups
Integer linear programming
Engenharia e Tecnologia::Outras Engenharias e Tecnologias
Science & Technology
topic Cutting and packing
Temporal bin packing problem
Fire-ups
Integer linear programming
Engenharia e Tecnologia::Outras Engenharias e Tecnologias
Science & Technology
description The instances were solved by the commercial software Gurobi. The underlying implementation of the models in Python can be found in https://github.com/wotzlaff/tbpp-cf2.
publishDate 2022
dc.date.none.fl_str_mv 2022
2022-01-01T00:00:00Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv https://hdl.handle.net/1822/89925
url https://hdl.handle.net/1822/89925
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Martinovic, J., Strasdat, N., Valério de Carvalho, J. et al. Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups. Optim Lett 16, 2333–2358 (2022). https://doi.org/10.1007/s11590-021-01825-x
1862-4472
1862-4480
10.1007/s11590-021-01825-x
https://link.springer.com/article/10.1007/s11590-021-01825-x
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Springer
publisher.none.fl_str_mv Springer
dc.source.none.fl_str_mv reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron:RCAAP
instname_str FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron_str RCAAP
institution RCAAP
reponame_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
collection Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository.name.fl_str_mv Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
repository.mail.fl_str_mv info@rcaap.pt
_version_ 1833595206539149312

Registros relacionados