- -

Algorithm for complete enumeration based on a stroke graph to solve the supply network configuration and operations scheduling problem

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

  • Estadisticas de Uso

Algorithm for complete enumeration based on a stroke graph to solve the supply network configuration and operations scheduling problem

Show simple item record

Files in this item

dc.contributor.author Maheut, Julien Philippe es_ES
dc.contributor.author García Sabater, José Pedro
dc.date.accessioned 2014-12-16T12:31:52Z
dc.date.available 2014-12-16T12:31:52Z
dc.date.issued 2013
dc.identifier.issn 2013-8423
dc.identifier.uri http://hdl.handle.net/10251/45499
dc.description.abstract [EN] Purpose: The purpose of this paper is to present an algorithm that solves the supply network configuration and operations scheduling problem in a mass customization company that faces alternative operations for one specific tool machine order in a multiplant context. Design/methodology/approach: To achieve this objective, the supply chain network configuration and operations scheduling problem is presented. A model based on stroke graphs allows the design of an algorithm that enumerates all the feasible solutions. The algorithm considers the arrival of a new customized order proposal which has to be inserted into a scheduled program. A selection function is then used to choose the solutions to be simulated in a specific simulation tool implemented in a Decision Support System. Findings and Originality/value: The algorithm itself proves efficient to find all feasible solutions when alternative operations must be considered. The stroke structure is successfully used to schedule operations when considering more than one manufacturing and supply option in each step. Research limitations/implications: This paper includes only the algorithm structure for a one-by-one, sequenced introduction of new products into the list of units to be manufactured. Therefore, the lotsizing process is done on a lot-per-lot basis. Moreover, the validation analysis is done through a case study and no generalization can be done without risk. Practical implications: The result of this research would help stakeholders to determine all the feasible and practical solutions for their problem. It would also allow to assessing the total costs and delivery times of each solution. Moreover, the Decision Support System proves useful to assess alternative solutions. Originality/value: This research offers a simple algorithm that helps solve the supply network configuration problem and, simultaneously, the scheduling problem by considering alternative operations. The proposed system allows an easier generation of many different alternatives for the supply network configuration. es_ES
dc.description.sponsorship The research leading to these results has received funding from the European Community's Seventh Framework Programme (FP7/2007-2013) under grant agreement no. NMP2-SL-2009- 229333 and has been partially supported by the Spanish Ministry of Science and Innovation within the Program "Proyectos de Investigación Fundamental No Orientada through the project "CORSARI MAGIC DPI2010-18243". Julien Maheut holds a VALi+d grant funded by the Regional Valencian Government (Ref. ACIF/2010/222).
dc.language Inglés es_ES
dc.publisher OmniaScience es_ES
dc.relation.ispartof Journal of Industrial Engineering and Management es_ES
dc.rights Reconocimiento - No comercial (by-nc) es_ES
dc.subject Stroke graph es_ES
dc.subject Supply network configuration es_ES
dc.subject Alternative operations es_ES
dc.subject Complete enumeration es_ES
dc.subject.classification INGENIERÍA DE ORGANIZACIÓN (UPV) es_ES
dc.subject.classification ORGANIZACION DE EMPRESAS es_ES
dc.title Algorithm for complete enumeration based on a stroke graph to solve the supply network configuration and operations scheduling problem es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.3926/jiem.550
dc.relation.projectID info:eu-repo/grantAgreement/EC/FP7/229333/EU/Resilient Multi-Plant Networks/
dc.relation.projectID info:eu-repo/grantAgreement/MICINN//DPI2010-18243/ES/COORDINACION DE OPERACIONES EN REDES DE SUMINISTRO%2FDEMANDA AJUSTADAS, RESILIENTES A LA INCERTIDUMBRE: MODELOS Y ALGORITMOS PARA LA GESTION DE LA INCERTIDUMBRE Y LA COMPLEJIDAD/ es_ES
dc.relation.projectID info:eu-repo/grantAgreement/GVA//ACIF%2F2010%2F222/ es_ES
dc.rights.accessRights Abierto es_ES
dc.contributor.affiliation Universitat Politècnica de València. Grupo de Investigación en Reingeniería, Organización, trabajo en Grupo y Logística Empresarial (ROGLE) es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Organización de Empresas - Departament d'Organització d'Empreses es_ES
dc.description.bibliographicCitation Maheut, JP.; García Sabater, JP. (2013). Algorithm for complete enumeration based on a stroke graph to solve the supply network configuration and operations scheduling problem. Journal of Industrial Engineering and Management. 6(3):779-795. https://doi.org/10.3926/jiem.550 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://dx.doi.org/10.3926/jiem.550 es_ES
dc.description.upvformatpinicio 779 es_ES
dc.description.upvformatpfin 795 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 6 es_ES
dc.description.issue 3 es_ES
dc.relation.senia 260891
dc.identifier.eissn 2013-0953
dc.contributor.funder European Commission
dc.contributor.funder Ministerio de Ciencia e Innovación
dc.contributor.funder Generalitat Valenciana


This item appears in the following Collection(s)

Show simple item record