- -

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

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

Show full item record

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. doi:10.3926/jiem.550

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/45499

Files in this item

Item Metadata

Title: Algorithm for complete enumeration based on a stroke graph to solve the supply network configuration and operations scheduling problem
Author:
UPV Unit: Universitat Politècnica de València. Grupo de Investigación en Reingeniería, Organización, trabajo en Grupo y Logística Empresarial (ROGLE)
Universitat Politècnica de València. Departamento de Organización de Empresas - Departament d'Organització d'Empreses
Issued date:
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 ...[+]
Subjects: Stroke graph , Supply network configuration , Alternative operations , Complete enumeration
Copyrigths: Reconocimiento - No comercial (by-nc)
Source:
Journal of Industrial Engineering and Management. (issn: 2013-8423 ) (eissn: 2013-0953 )
DOI: 10.3926/jiem.550
Publisher:
OmniaScience
Publisher version: http://dx.doi.org/10.3926/jiem.550
Project ID: info:eu-repo/grantAgreement/EC/FP7/229333/EU
Thanks:
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 ...[+]
Type: Artículo

This item appears in the following Collection(s)

Show full item record