Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10609/90877
Registro completo de metadatos
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Calvet Liñán, Laura | - |
dc.contributor.author | Fernández-Viagas Escudero, Víctor | - |
dc.contributor.author | Framiñán Torre, José Manuel | - |
dc.contributor.author | Juan, Angel A. | - |
dc.date.accessioned | 2019-01-30T12:16:38Z | - |
dc.date.available | 2019-01-30T12:16:38Z | - |
dc.date.issued | 2016-12 | - |
dc.identifier.citation | Calvet, L., Fernandez-Viagas, V., Framinan, J.M. & Juan, A.A. (2016). Combining simulation with metaheuristics in distributed scheduling problems with stochastic processing times. Winter Simulation Conference (WSC). Proceedings, 2016(), 2347-2357. doi: 10.1109/WSC.2016.7822275 | - |
dc.identifier.isbn | 9781509044863 | - |
dc.identifier.issn | 1558-4305MIAR | - |
dc.identifier.uri | http://hdl.handle.net/10609/90877 | - |
dc.description.abstract | In this paper, we focus on a scenario in which a company or a set of companies conforming a supply network must deliver a complex product (service) composed of several components (tasks) to be processed on a set of parallel flow-shops with a common deadline. Each flow-shop represents the manufacturing of an independent component of the product, or the set of activities of the service. We assume that the processing times are random variables following a given probability distribution. In this scenario, the product (service) is required to be finished by the deadline with a user-specified probability, and the decision-maker must decide about the starting times of each component/task while minimizing one of the following alternative goals: (a) the maximum completion time; or (b) the accumulated deviations with respect to the deadline. A simheuristic-based methodology is proposed for solving this problem, and a series of computational experiments are performed. | en |
dc.format.mimetype | application/pdf | - |
dc.language.iso | eng | - |
dc.publisher | Winter Simulation Conference (WSC). Proceedings | - |
dc.relation.ispartof | Winter Simulation Conference (WSC). Proceedings, 2016 | - |
dc.relation.ispartofseries | Winter Simulation Conference, Washington D.C., EUA, 11-14, desembre de 2016 | - |
dc.relation.uri | https://ieeexplore.ieee.org/document/7822275 | - |
dc.relation.uri | https://www.informs-sim.org/wsc16papers/205.pdf | - |
dc.rights | (c) Author/s & (c) Journal | - |
dc.subject | job shop scheduling | en |
dc.subject | random variables | en |
dc.subject | probability distribution | en |
dc.subject | computational modeling | en |
dc.subject | companies | en |
dc.subject | production facilities | en |
dc.subject | problema Job Shop | es |
dc.subject | variables aleatorias | es |
dc.subject | distribución de probabilidad | es |
dc.subject | modelo computacional | es |
dc.subject | centros de producción | es |
dc.subject | problema Job Shop | ca |
dc.subject | variables aleatòries | ca |
dc.subject | distribució de probabilitat | ca |
dc.subject | model computacional | ca |
dc.subject | centres de producció | ca |
dc.subject | empresa | ca |
dc.subject | empresa | es |
dc.subject.lcsh | Algorithms | en |
dc.title | Combining simulation with metaheuristics in distributed scheduling problems with stochastic processing times | - |
dc.type | info:eu-repo/semantics/conferenceObject | - |
dc.audience.mediator | Theme areas | en |
dc.subject.lemac | Algorismes | ca |
dc.subject.lcshes | Algoritmos | es |
dc.rights.accessRights | info:eu-repo/semantics/restrictedAccess | - |
dc.identifier.doi | 10.1109/WSC.2016.7822275 | - |
dc.relation.projectID | info:eu-repo/grantAgreement/TRA2013-48180-C3-P | - |
dc.relation.projectID | info:eu-repo/grantAgreement/DPI2013-44461-P | - |
dc.relation.projectID | info:eu-repo/grantAgreement/2014-CTP-00001 | - |
Aparece en las colecciones: | Articles |
Ficheros en este ítem:
No hay ficheros asociados a este ítem.
Comparte:
Los ítems del Repositorio están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.