Please use this identifier to cite or link to this item:
|Title:||Combining simulation with metaheuristics in distributed scheduling problems with stochastic processing times|
|Author:||Calvet Liñan, Laura |
Fernández-Viagas Escudero, Víctor
Framiñán Torre, José Manuel
Juan Pérez, Ángel Alejandro
|Keywords:||job shop scheduling|
|Publisher:||Winter Simulation Conference (WSC). Proceedings|
|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|
|Published in:||Winter Simulation Conference, Washington D.C., EUA, 11-14, desembre de 2016|
|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.|
|Appears in Collections:||Articles|
Files in This Item:
There are no files associated with this item.
Items in repository are protected by copyright, with all rights reserved, unless otherwise indicated.