New General Discrete-Time Scheduling Model for Multipurpose Batch Plants

Detalhes bibliográficos
Autor(a) principal: Samuel Moniz
Data de Publicação: 2013
Outros Autores: Barbosa Povoa,AP, Jorge Pinho de Sousa
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://repositorio.inesctec.pt/handle/123456789/4478
http://dx.doi.org/10.1021/ie4021073
Resumo: This work deals with the optimal short-term scheduling of general multipurpose batch plants, considering multiple operational characteristics such as sequence-dependent changeovers, temporary storage in the processing units, lots blending, and material flows traceability. A novel Mixed Integer Linear Programming (MILP) discrete-time formulation based on the State-Task Network (STN) is proposed, with new types of constraints for modeling changeovers and storage. We also propose some model extensions for addressing changeovers start; nonpreemptive lots; lots start and sizes; alternative task-unit and task-unit-layout assignments. Computational tests have shown that the proposed model is more effective than a similar model based on the Resource-Task Network (RTN).
id RCAP_1aab178e679f5e2b1cc05f0c6aee6a45
oai_identifier_str oai:repositorio.inesctec.pt:123456789/4478
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 New General Discrete-Time Scheduling Model for Multipurpose Batch PlantsThis work deals with the optimal short-term scheduling of general multipurpose batch plants, considering multiple operational characteristics such as sequence-dependent changeovers, temporary storage in the processing units, lots blending, and material flows traceability. A novel Mixed Integer Linear Programming (MILP) discrete-time formulation based on the State-Task Network (STN) is proposed, with new types of constraints for modeling changeovers and storage. We also propose some model extensions for addressing changeovers start; nonpreemptive lots; lots start and sizes; alternative task-unit and task-unit-layout assignments. Computational tests have shown that the proposed model is more effective than a similar model based on the Resource-Task Network (RTN).2017-12-20T15:28:24Z2013-01-01T00:00:00Z2013info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://repositorio.inesctec.pt/handle/123456789/4478http://dx.doi.org/10.1021/ie4021073engSamuel MonizBarbosa Povoa,APJorge Pinho de Sousainfo: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:RCAAP2023-05-15T10:20:22Zoai:repositorio.inesctec.pt:123456789/4478Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:53:01.469956Repositó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 New General Discrete-Time Scheduling Model for Multipurpose Batch Plants
title New General Discrete-Time Scheduling Model for Multipurpose Batch Plants
spellingShingle New General Discrete-Time Scheduling Model for Multipurpose Batch Plants
Samuel Moniz
title_short New General Discrete-Time Scheduling Model for Multipurpose Batch Plants
title_full New General Discrete-Time Scheduling Model for Multipurpose Batch Plants
title_fullStr New General Discrete-Time Scheduling Model for Multipurpose Batch Plants
title_full_unstemmed New General Discrete-Time Scheduling Model for Multipurpose Batch Plants
title_sort New General Discrete-Time Scheduling Model for Multipurpose Batch Plants
author Samuel Moniz
author_facet Samuel Moniz
Barbosa Povoa,AP
Jorge Pinho de Sousa
author_role author
author2 Barbosa Povoa,AP
Jorge Pinho de Sousa
author2_role author
author
dc.contributor.author.fl_str_mv Samuel Moniz
Barbosa Povoa,AP
Jorge Pinho de Sousa
description This work deals with the optimal short-term scheduling of general multipurpose batch plants, considering multiple operational characteristics such as sequence-dependent changeovers, temporary storage in the processing units, lots blending, and material flows traceability. A novel Mixed Integer Linear Programming (MILP) discrete-time formulation based on the State-Task Network (STN) is proposed, with new types of constraints for modeling changeovers and storage. We also propose some model extensions for addressing changeovers start; nonpreemptive lots; lots start and sizes; alternative task-unit and task-unit-layout assignments. Computational tests have shown that the proposed model is more effective than a similar model based on the Resource-Task Network (RTN).
publishDate 2013
dc.date.none.fl_str_mv 2013-01-01T00:00:00Z
2013
2017-12-20T15:28:24Z
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://repositorio.inesctec.pt/handle/123456789/4478
http://dx.doi.org/10.1021/ie4021073
url http://repositorio.inesctec.pt/handle/123456789/4478
http://dx.doi.org/10.1021/ie4021073
dc.language.iso.fl_str_mv eng
language eng
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.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_ 1799131605468446720

Registros relacionados