Optimal sizing, scheduling and shift policy of the grinding section of a ceramic tile plant
Autor(a) principal: | |
---|---|
Data de Publicação: | 2008 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10316/3772 https://doi.org/10.1016/j.cor.2008.05.007 |
Resumo: | This paper addresses the optimal design of the grinding section of a ceramic tile plant operating in a cyclic mode with the units (mills) following a batch sequence. The optimal design problem of this single product plant is formulated with a fixed time horizon of one week, corresponding to one cycle of production, and using a discrete-time resource task network (RTN) process representation. The size of the individual units is restricted to discrete values, and the plant operates with a set of limited resources (workforce and equipment). The goal is to determine the optimal number and size of the mills to install in the grinding section, the corresponding production schedule, and shift policy. This problem involves labor/semi-labor intensive (LI/SLI) units with a depreciation cost of the same order as that of the operation cost. The optimal design of the grinding section comprises the trade-off between these two costs. The resulting optimization formulation is of the form of a mixed integer linear programming (MILP) problem, solved using a branch and bound solver (CPLEX 9.0.2). The optimal solution is analyzed for various ceramic tile productions and different shift policies.Scope and Purpose |
id |
RCAP_e53c503d1bcca8d507c27063ee1d0a49 |
---|---|
oai_identifier_str |
oai:estudogeral.uc.pt:10316/3772 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Optimal sizing, scheduling and shift policy of the grinding section of a ceramic tile plantSchedulingResource task networkMixed-integer linear programmingCeramic industryThis paper addresses the optimal design of the grinding section of a ceramic tile plant operating in a cyclic mode with the units (mills) following a batch sequence. The optimal design problem of this single product plant is formulated with a fixed time horizon of one week, corresponding to one cycle of production, and using a discrete-time resource task network (RTN) process representation. The size of the individual units is restricted to discrete values, and the plant operates with a set of limited resources (workforce and equipment). The goal is to determine the optimal number and size of the mills to install in the grinding section, the corresponding production schedule, and shift policy. This problem involves labor/semi-labor intensive (LI/SLI) units with a depreciation cost of the same order as that of the operation cost. The optimal design of the grinding section comprises the trade-off between these two costs. The resulting optimization formulation is of the form of a mixed integer linear programming (MILP) problem, solved using a branch and bound solver (CPLEX 9.0.2). The optimal solution is analyzed for various ceramic tile productions and different shift policies.Scope and Purposehttp://www.sciencedirect.com/science/article/B6VC5-4SJ2WWC-1/1/3b1c46a108097a375d39b9eac02ce5522008-08-29info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleaplication/PDFhttp://hdl.handle.net/10316/3772http://hdl.handle.net/10316/3772https://doi.org/10.1016/j.cor.2008.05.007engComputers & Operations Research. In Press, Corrected Proof:Duarte, Belmiro P. M.Santos, Lino O.Mariano, Jorge S.info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2020-11-06T16:48:55Zoai:estudogeral.uc.pt:10316/3772Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T20:59:21.166887Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Optimal sizing, scheduling and shift policy of the grinding section of a ceramic tile plant |
title |
Optimal sizing, scheduling and shift policy of the grinding section of a ceramic tile plant |
spellingShingle |
Optimal sizing, scheduling and shift policy of the grinding section of a ceramic tile plant Duarte, Belmiro P. M. Scheduling Resource task network Mixed-integer linear programming Ceramic industry |
title_short |
Optimal sizing, scheduling and shift policy of the grinding section of a ceramic tile plant |
title_full |
Optimal sizing, scheduling and shift policy of the grinding section of a ceramic tile plant |
title_fullStr |
Optimal sizing, scheduling and shift policy of the grinding section of a ceramic tile plant |
title_full_unstemmed |
Optimal sizing, scheduling and shift policy of the grinding section of a ceramic tile plant |
title_sort |
Optimal sizing, scheduling and shift policy of the grinding section of a ceramic tile plant |
author |
Duarte, Belmiro P. M. |
author_facet |
Duarte, Belmiro P. M. Santos, Lino O. Mariano, Jorge S. |
author_role |
author |
author2 |
Santos, Lino O. Mariano, Jorge S. |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Duarte, Belmiro P. M. Santos, Lino O. Mariano, Jorge S. |
dc.subject.por.fl_str_mv |
Scheduling Resource task network Mixed-integer linear programming Ceramic industry |
topic |
Scheduling Resource task network Mixed-integer linear programming Ceramic industry |
description |
This paper addresses the optimal design of the grinding section of a ceramic tile plant operating in a cyclic mode with the units (mills) following a batch sequence. The optimal design problem of this single product plant is formulated with a fixed time horizon of one week, corresponding to one cycle of production, and using a discrete-time resource task network (RTN) process representation. The size of the individual units is restricted to discrete values, and the plant operates with a set of limited resources (workforce and equipment). The goal is to determine the optimal number and size of the mills to install in the grinding section, the corresponding production schedule, and shift policy. This problem involves labor/semi-labor intensive (LI/SLI) units with a depreciation cost of the same order as that of the operation cost. The optimal design of the grinding section comprises the trade-off between these two costs. The resulting optimization formulation is of the form of a mixed integer linear programming (MILP) problem, solved using a branch and bound solver (CPLEX 9.0.2). The optimal solution is analyzed for various ceramic tile productions and different shift policies.Scope and Purpose |
publishDate |
2008 |
dc.date.none.fl_str_mv |
2008-08-29 |
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 |
http://hdl.handle.net/10316/3772 http://hdl.handle.net/10316/3772 https://doi.org/10.1016/j.cor.2008.05.007 |
url |
http://hdl.handle.net/10316/3772 https://doi.org/10.1016/j.cor.2008.05.007 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
Computers & Operations Research. In Press, Corrected Proof: |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
aplication/PDF |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799133885299163136 |