A new approach for solving capacitated lot sizing and scheduling problem with sequence and period-dependent setup costs

Purpose: We aim to examine the capacitated multi-item lot sizing problem which is a typical example of a large bucket model, where many different items can be produced on the same machine in one time period. We propose a new approach to determine the production sequence and lot sizes that minimize t...

Descripción completa

Detalles Bibliográficos
Autores: Memmi, Imen Chaieb, Laaroussi, Sondes Hammami
Tipo de recurso: artículo
Fecha de publicación:2013
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2099/14149
Acceso en línea:https://hdl.handle.net/2099/14149
Access Level:acceso abierto
Palabra clave:Production planning
Multi-item capacitated lot sizing
Sequence-dependent setup costs
Iterative approach
Scheduling
Producció -- Organització
Àrees temàtiques de la UPC::Economia i organització d'empreses::Direcció d'operacions
id ES_34c0d5af4e5ea54d04b4c2f91addc587
oai_identifier_str oai:upcommons.upc.edu:2099/14149
network_acronym_str ES
network_name_str España
repository_id_str
spelling A new approach for solving capacitated lot sizing and scheduling problem with sequence and period-dependent setup costsMemmi, Imen ChaiebLaaroussi, Sondes HammamiProduction planningMulti-item capacitated lot sizingSequence-dependent setup costsIterative approachProduction planningSchedulingProducció -- OrganitzacióÀrees temàtiques de la UPC::Economia i organització d'empreses::Direcció d'operacionsPurpose: We aim to examine the capacitated multi-item lot sizing problem which is a typical example of a large bucket model, where many different items can be produced on the same machine in one time period. We propose a new approach to determine the production sequence and lot sizes that minimize the sum of start up and setup costs, inventory and production costs over all periods. Design/methodology/approach: The approach is composed of three steps. First, we compute a lower bound on total cost. Then we propose a three sub-steps iteration procedure. We solve optimally the lot sizing problem without considering products sequencing and their cost. Then, we determine products quantities to produce each period while minimizing the storage and variable production costs. Given the products to manufacture each period, we determine its correspondent optimal products sequencing, by using a Branch and Bound algorithm. Given the sequences of products within each period, we evaluate the total start up and setup cost. We compare then the total cost obtained to the lower bound of the total cost. If this value riches a prefixed value, we stop. Otherwise, we modify the results of lot sizing problem. Findings and Originality/value: We show using an illustrative example, that the difference between the total cost and its lower bound is only 10%. This gap depends on the significance of the inventory and production costs and the machine’s capacity. Comparing the approach we develop with a traditional one, we show that we manage to reduce the total cost by 30%. Research limitations/implications: Our model fits better to real-world situations where production systems run continuously. This model is applied for limited number of part types and periods. Practical implications: Our approach determines the products to manufacture each time period, their economic amounts, and their scheduling within each period. This outcome should help decision makers bearing expensive start up and setup costs, to reduce their Inventory and Production costs and Start up and setup cots. Originality/value: The main idea of the proposed approach is to intelligibly reduce the number of products to manufacture within each period in order to decrease the setup cost; since in case of limited machine’s capacity, we show that setup costs could increase when reducing the total number of parts manufactured over the entire planning horizon. In fact, the triangular inequality in setup costs is proved to be not usually available.Peer ReviewedSchool of Industrial and Aeronautic Engineering of Terrassa (ETSEIAT). Universitat Politècnica de Catalunya (UPC)20132013-12-0120142014-01-08journal articlehttp://purl.org/coar/resource_type/c_6501NAhttp://purl.org/coar/version/c_be7fb7dd8ff6fe43info:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/2099/14149reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2Attribution-NonCommercial 3.0 Spainhttp://creativecommons.org/licenses/by-nc/3.0/es/info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2099/141492026-05-27T15:37:01Z
dc.title.none.fl_str_mv A new approach for solving capacitated lot sizing and scheduling problem with sequence and period-dependent setup costs
title A new approach for solving capacitated lot sizing and scheduling problem with sequence and period-dependent setup costs
spellingShingle A new approach for solving capacitated lot sizing and scheduling problem with sequence and period-dependent setup costs
Memmi, Imen Chaieb
Production planning
Multi-item capacitated lot sizing
Sequence-dependent setup costs
Iterative approach
Production planning
Scheduling
Producció -- Organització
Àrees temàtiques de la UPC::Economia i organització d'empreses::Direcció d'operacions
title_short A new approach for solving capacitated lot sizing and scheduling problem with sequence and period-dependent setup costs
title_full A new approach for solving capacitated lot sizing and scheduling problem with sequence and period-dependent setup costs
title_fullStr A new approach for solving capacitated lot sizing and scheduling problem with sequence and period-dependent setup costs
title_full_unstemmed A new approach for solving capacitated lot sizing and scheduling problem with sequence and period-dependent setup costs
title_sort A new approach for solving capacitated lot sizing and scheduling problem with sequence and period-dependent setup costs
dc.creator.none.fl_str_mv Memmi, Imen Chaieb
Laaroussi, Sondes Hammami
author Memmi, Imen Chaieb
author_facet Memmi, Imen Chaieb
Laaroussi, Sondes Hammami
author_role author
author2 Laaroussi, Sondes Hammami
author2_role author
dc.subject.none.fl_str_mv Production planning
Multi-item capacitated lot sizing
Sequence-dependent setup costs
Iterative approach
Production planning
Scheduling
Producció -- Organització
Àrees temàtiques de la UPC::Economia i organització d'empreses::Direcció d'operacions
topic Production planning
Multi-item capacitated lot sizing
Sequence-dependent setup costs
Iterative approach
Production planning
Scheduling
Producció -- Organització
Àrees temàtiques de la UPC::Economia i organització d'empreses::Direcció d'operacions
description Purpose: We aim to examine the capacitated multi-item lot sizing problem which is a typical example of a large bucket model, where many different items can be produced on the same machine in one time period. We propose a new approach to determine the production sequence and lot sizes that minimize the sum of start up and setup costs, inventory and production costs over all periods. Design/methodology/approach: The approach is composed of three steps. First, we compute a lower bound on total cost. Then we propose a three sub-steps iteration procedure. We solve optimally the lot sizing problem without considering products sequencing and their cost. Then, we determine products quantities to produce each period while minimizing the storage and variable production costs. Given the products to manufacture each period, we determine its correspondent optimal products sequencing, by using a Branch and Bound algorithm. Given the sequences of products within each period, we evaluate the total start up and setup cost. We compare then the total cost obtained to the lower bound of the total cost. If this value riches a prefixed value, we stop. Otherwise, we modify the results of lot sizing problem. Findings and Originality/value: We show using an illustrative example, that the difference between the total cost and its lower bound is only 10%. This gap depends on the significance of the inventory and production costs and the machine’s capacity. Comparing the approach we develop with a traditional one, we show that we manage to reduce the total cost by 30%. Research limitations/implications: Our model fits better to real-world situations where production systems run continuously. This model is applied for limited number of part types and periods. Practical implications: Our approach determines the products to manufacture each time period, their economic amounts, and their scheduling within each period. This outcome should help decision makers bearing expensive start up and setup costs, to reduce their Inventory and Production costs and Start up and setup cots. Originality/value: The main idea of the proposed approach is to intelligibly reduce the number of products to manufacture within each period in order to decrease the setup cost; since in case of limited machine’s capacity, we show that setup costs could increase when reducing the total number of parts manufactured over the entire planning horizon. In fact, the triangular inequality in setup costs is proved to be not usually available.
publishDate 2013
dc.date.none.fl_str_mv 2013
2013-12-01
2014
2014-01-08
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
NA
http://purl.org/coar/version/c_be7fb7dd8ff6fe43
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/2099/14149
url https://hdl.handle.net/2099/14149
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial 3.0 Spain
http://creativecommons.org/licenses/by-nc/3.0/es/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial 3.0 Spain
http://creativecommons.org/licenses/by-nc/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv School of Industrial and Aeronautic Engineering of Terrassa (ETSEIAT). Universitat Politècnica de Catalunya (UPC)
publisher.none.fl_str_mv School of Industrial and Aeronautic Engineering of Terrassa (ETSEIAT). Universitat Politècnica de Catalunya (UPC)
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869405837573750784
score 15,300724

Similares en LA Referencia