A non-permutation flowshop scheduling problem with lot streaming: A mathematical model

Autores
Rossit, Daniel Alejandro; Tohmé, Fernando Abel; Frutos, Mariano; Bard, Jonathan; Broz, Diego Ricardo
Año de publicación
2016
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
In this paper we investigate the use of lot streaming in non-permutation flowshop scheduling problems. The objective is to minimize the makespan subject to the standard flowshop constraints, but where it is now permitted to reorder jobs between machines. In addition, the jobs can be divided into manageable sublots, a strategy known as lot streaming. Computational experiments show that lot streaming reduces the makespan up to 43% for a wide range of instances when compared to the case in which no job splitting is applied. The benefits grow as the number of stages in the production process increases but reach a limit. Beyond a certain point, the division of jobs into additional sublots does not improve the solution.
Fil: Rossit, Daniel Alejandro. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Investigaciones Económicas y Sociales del Sur. Universidad Nacional del Sur. Departamento de Economía. Instituto de Investigaciones Económicas y Sociales del Sur; Argentina
Fil: Tohmé, Fernando Abel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; Argentina
Fil: Frutos, Mariano. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Investigaciones Económicas y Sociales del Sur. Universidad Nacional del Sur. Departamento de Economía. Instituto de Investigaciones Económicas y Sociales del Sur; Argentina
Fil: Bard, Jonathan. University of Texas; Estados Unidos
Fil: Broz, Diego Ricardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; Argentina. Universidad Nacional de Misiones; Argentina
Materia
Flowshop Scheduling
Lot Streaming
Makespan
Non-Permutation
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/53693
Acceder
id CONICETDig_367f9e39f6c6908e09abc6b51ac9aadb
oai_identifier_str oai:ri.conicet.gov.ar:11336/53693
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling A non-permutation flowshop scheduling problem with lot streaming: A mathematical modelRossit, Daniel AlejandroTohmé, Fernando AbelFrutos, MarianoBard, JonathanBroz, Diego RicardoFlowshop SchedulingLot StreamingMakespanNon-Permutationhttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1In this paper we investigate the use of lot streaming in non-permutation flowshop scheduling problems. The objective is to minimize the makespan subject to the standard flowshop constraints, but where it is now permitted to reorder jobs between machines. In addition, the jobs can be divided into manageable sublots, a strategy known as lot streaming. Computational experiments show that lot streaming reduces the makespan up to 43% for a wide range of instances when compared to the case in which no job splitting is applied. The benefits grow as the number of stages in the production process increases but reach a limit. Beyond a certain point, the division of jobs into additional sublots does not improve the solution.Fil: Rossit, Daniel Alejandro. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Investigaciones Económicas y Sociales del Sur. Universidad Nacional del Sur. Departamento de Economía. Instituto de Investigaciones Económicas y Sociales del Sur; ArgentinaFil: Tohmé, Fernando Abel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; ArgentinaFil: Frutos, Mariano. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Investigaciones Económicas y Sociales del Sur. Universidad Nacional del Sur. Departamento de Economía. Instituto de Investigaciones Económicas y Sociales del Sur; ArgentinaFil: Bard, Jonathan. University of Texas; Estados UnidosFil: Broz, Diego Ricardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; Argentina. Universidad Nacional de Misiones; ArgentinaGrowing Science2016-06info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/53693Rossit, Daniel Alejandro; Tohmé, Fernando Abel; Frutos, Mariano; Bard, Jonathan; Broz, Diego Ricardo; A non-permutation flowshop scheduling problem with lot streaming: A mathematical model; Growing Science; International Journal of Industrial Engineering Computations; 7; 3; 6-2016; 507-5161923-2926CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/http://www.growingscience.com/ijiec/IJIEC_2015_47.pdfinfo:eu-repo/semantics/altIdentifier/doi/10.5267/j.ijiec.2015.11.004info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-29T10:39:49Zoai:ri.conicet.gov.ar:11336/53693instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-29 10:39:49.739CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv A non-permutation flowshop scheduling problem with lot streaming: A mathematical model
title A non-permutation flowshop scheduling problem with lot streaming: A mathematical model
spellingShingle A non-permutation flowshop scheduling problem with lot streaming: A mathematical model
Rossit, Daniel Alejandro
Flowshop Scheduling
Lot Streaming
Makespan
Non-Permutation
title_short A non-permutation flowshop scheduling problem with lot streaming: A mathematical model
title_full A non-permutation flowshop scheduling problem with lot streaming: A mathematical model
title_fullStr A non-permutation flowshop scheduling problem with lot streaming: A mathematical model
title_full_unstemmed A non-permutation flowshop scheduling problem with lot streaming: A mathematical model
title_sort A non-permutation flowshop scheduling problem with lot streaming: A mathematical model
dc.creator.none.fl_str_mv Rossit, Daniel Alejandro
Tohmé, Fernando Abel
Frutos, Mariano
Bard, Jonathan
Broz, Diego Ricardo
author Rossit, Daniel Alejandro
author_facet Rossit, Daniel Alejandro
Tohmé, Fernando Abel
Frutos, Mariano
Bard, Jonathan
Broz, Diego Ricardo
author_role author
author2 Tohmé, Fernando Abel
Frutos, Mariano
Bard, Jonathan
Broz, Diego Ricardo
author2_role author
author
author
author
dc.subject.none.fl_str_mv Flowshop Scheduling
Lot Streaming
Makespan
Non-Permutation
topic Flowshop Scheduling
Lot Streaming
Makespan
Non-Permutation
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv In this paper we investigate the use of lot streaming in non-permutation flowshop scheduling problems. The objective is to minimize the makespan subject to the standard flowshop constraints, but where it is now permitted to reorder jobs between machines. In addition, the jobs can be divided into manageable sublots, a strategy known as lot streaming. Computational experiments show that lot streaming reduces the makespan up to 43% for a wide range of instances when compared to the case in which no job splitting is applied. The benefits grow as the number of stages in the production process increases but reach a limit. Beyond a certain point, the division of jobs into additional sublots does not improve the solution.
Fil: Rossit, Daniel Alejandro. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Investigaciones Económicas y Sociales del Sur. Universidad Nacional del Sur. Departamento de Economía. Instituto de Investigaciones Económicas y Sociales del Sur; Argentina
Fil: Tohmé, Fernando Abel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; Argentina
Fil: Frutos, Mariano. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Investigaciones Económicas y Sociales del Sur. Universidad Nacional del Sur. Departamento de Economía. Instituto de Investigaciones Económicas y Sociales del Sur; Argentina
Fil: Bard, Jonathan. University of Texas; Estados Unidos
Fil: Broz, Diego Ricardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; Argentina. Universidad Nacional de Misiones; Argentina
description In this paper we investigate the use of lot streaming in non-permutation flowshop scheduling problems. The objective is to minimize the makespan subject to the standard flowshop constraints, but where it is now permitted to reorder jobs between machines. In addition, the jobs can be divided into manageable sublots, a strategy known as lot streaming. Computational experiments show that lot streaming reduces the makespan up to 43% for a wide range of instances when compared to the case in which no job splitting is applied. The benefits grow as the number of stages in the production process increases but reach a limit. Beyond a certain point, the division of jobs into additional sublots does not improve the solution.
publishDate 2016
dc.date.none.fl_str_mv 2016-06
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/53693
Rossit, Daniel Alejandro; Tohmé, Fernando Abel; Frutos, Mariano; Bard, Jonathan; Broz, Diego Ricardo; A non-permutation flowshop scheduling problem with lot streaming: A mathematical model; Growing Science; International Journal of Industrial Engineering Computations; 7; 3; 6-2016; 507-516
1923-2926
CONICET Digital
CONICET
url http://hdl.handle.net/11336/53693
identifier_str_mv Rossit, Daniel Alejandro; Tohmé, Fernando Abel; Frutos, Mariano; Bard, Jonathan; Broz, Diego Ricardo; A non-permutation flowshop scheduling problem with lot streaming: A mathematical model; Growing Science; International Journal of Industrial Engineering Computations; 7; 3; 6-2016; 507-516
1923-2926
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://www.growingscience.com/ijiec/IJIEC_2015_47.pdf
info:eu-repo/semantics/altIdentifier/doi/10.5267/j.ijiec.2015.11.004
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Growing Science
publisher.none.fl_str_mv Growing Science
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1844614424800788480
score 13.070432

Publicaciones similares