Scheduling of the inbound and outbound trucks at a Cross-Docking platform considering mutualization of docks
Autor(a) principal: | |
---|---|
Data de Publicação: | 2022 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Production |
Texto Completo: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0103-65132022000100203 |
Resumo: | Abstract Paper aims This paper studies a new Cross-Docking (CD) scheduling problem inspired by the trend of resource mutualization at CD operations where a company owning a CD platform can lease its docks to other companies. Originality This work pioneers the studies of the resource mutualization at CD operations solving at scheduling problem, where there is a set of requirements for leasing the loading and unloading docks for a period, and the company owning the docks can accept or decline each requirement. Considering that the availability of the docks is linked to scheduling the trucks at the company’s loading and unloading docks, the decision to accept the requirements must be made along with the decisions for scheduling the trucks. Research method To solve this problem, this work proposes a Mixed-Integer Linear Programming (MILP) formulation. Main findings Using a commercial solver, the MILP formulation can optimally solve 65/128 instances based on a real operation. For the remaining instances, the MILP formulation obtains an average optimized gap of 8.95%. Implications for theory and practice The MILP formulation obtains acceptable results. Moreover, we found that all the instances accepted the requirements showing that it is economically interesting to lease docks. |
id |
ABEPRO-1_6366ffe0c3c59c6be512d480e50a0f8e |
---|---|
oai_identifier_str |
oai:scielo:S0103-65132022000100203 |
network_acronym_str |
ABEPRO-1 |
network_name_str |
Production |
repository_id_str |
|
spelling |
Scheduling of the inbound and outbound trucks at a Cross-Docking platform considering mutualization of docksCross docking platformMutualizationScheduling problemMILP formulationAbstract Paper aims This paper studies a new Cross-Docking (CD) scheduling problem inspired by the trend of resource mutualization at CD operations where a company owning a CD platform can lease its docks to other companies. Originality This work pioneers the studies of the resource mutualization at CD operations solving at scheduling problem, where there is a set of requirements for leasing the loading and unloading docks for a period, and the company owning the docks can accept or decline each requirement. Considering that the availability of the docks is linked to scheduling the trucks at the company’s loading and unloading docks, the decision to accept the requirements must be made along with the decisions for scheduling the trucks. Research method To solve this problem, this work proposes a Mixed-Integer Linear Programming (MILP) formulation. Main findings Using a commercial solver, the MILP formulation can optimally solve 65/128 instances based on a real operation. For the remaining instances, the MILP formulation obtains an average optimized gap of 8.95%. Implications for theory and practice The MILP formulation obtains acceptable results. Moreover, we found that all the instances accepted the requirements showing that it is economically interesting to lease docks.Associação Brasileira de Engenharia de Produção2022-01-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0103-65132022000100203Production v.32 2022reponame:Productioninstname:Associação Brasileira de Engenharia de Produção (ABEPRO)instacron:ABEPRO10.1590/0103-6513.20210091info:eu-repo/semantics/openAccessCordoba,NataliaMontoya,Alejandroeng2022-01-05T00:00:00Zoai:scielo:S0103-65132022000100203Revistahttps://www.scielo.br/j/prod/https://old.scielo.br/oai/scielo-oai.php||production@editoracubo.com.br1980-54110103-6513opendoar:2022-01-05T00:00Production - Associação Brasileira de Engenharia de Produção (ABEPRO)false |
dc.title.none.fl_str_mv |
Scheduling of the inbound and outbound trucks at a Cross-Docking platform considering mutualization of docks |
title |
Scheduling of the inbound and outbound trucks at a Cross-Docking platform considering mutualization of docks |
spellingShingle |
Scheduling of the inbound and outbound trucks at a Cross-Docking platform considering mutualization of docks Cordoba,Natalia Cross docking platform Mutualization Scheduling problem MILP formulation |
title_short |
Scheduling of the inbound and outbound trucks at a Cross-Docking platform considering mutualization of docks |
title_full |
Scheduling of the inbound and outbound trucks at a Cross-Docking platform considering mutualization of docks |
title_fullStr |
Scheduling of the inbound and outbound trucks at a Cross-Docking platform considering mutualization of docks |
title_full_unstemmed |
Scheduling of the inbound and outbound trucks at a Cross-Docking platform considering mutualization of docks |
title_sort |
Scheduling of the inbound and outbound trucks at a Cross-Docking platform considering mutualization of docks |
author |
Cordoba,Natalia |
author_facet |
Cordoba,Natalia Montoya,Alejandro |
author_role |
author |
author2 |
Montoya,Alejandro |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Cordoba,Natalia Montoya,Alejandro |
dc.subject.por.fl_str_mv |
Cross docking platform Mutualization Scheduling problem MILP formulation |
topic |
Cross docking platform Mutualization Scheduling problem MILP formulation |
description |
Abstract Paper aims This paper studies a new Cross-Docking (CD) scheduling problem inspired by the trend of resource mutualization at CD operations where a company owning a CD platform can lease its docks to other companies. Originality This work pioneers the studies of the resource mutualization at CD operations solving at scheduling problem, where there is a set of requirements for leasing the loading and unloading docks for a period, and the company owning the docks can accept or decline each requirement. Considering that the availability of the docks is linked to scheduling the trucks at the company’s loading and unloading docks, the decision to accept the requirements must be made along with the decisions for scheduling the trucks. Research method To solve this problem, this work proposes a Mixed-Integer Linear Programming (MILP) formulation. Main findings Using a commercial solver, the MILP formulation can optimally solve 65/128 instances based on a real operation. For the remaining instances, the MILP formulation obtains an average optimized gap of 8.95%. Implications for theory and practice The MILP formulation obtains acceptable results. Moreover, we found that all the instances accepted the requirements showing that it is economically interesting to lease docks. |
publishDate |
2022 |
dc.date.none.fl_str_mv |
2022-01-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0103-65132022000100203 |
url |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0103-65132022000100203 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
10.1590/0103-6513.20210091 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
text/html |
dc.publisher.none.fl_str_mv |
Associação Brasileira de Engenharia de Produção |
publisher.none.fl_str_mv |
Associação Brasileira de Engenharia de Produção |
dc.source.none.fl_str_mv |
Production v.32 2022 reponame:Production instname:Associação Brasileira de Engenharia de Produção (ABEPRO) instacron:ABEPRO |
instname_str |
Associação Brasileira de Engenharia de Produção (ABEPRO) |
instacron_str |
ABEPRO |
institution |
ABEPRO |
reponame_str |
Production |
collection |
Production |
repository.name.fl_str_mv |
Production - Associação Brasileira de Engenharia de Produção (ABEPRO) |
repository.mail.fl_str_mv |
||production@editoracubo.com.br |
_version_ |
1754213154843262976 |