Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Victor Fernandez-Viagas"'
Autor:
Victor Fernandez-Viagas, Luis Sanchez-Mediano, Alvaro Angulo-Cortes, David Gomez-Medina, Jose Manuel Molina-Pariente
Publikováno v:
Mathematics, Vol 10, Iss 19, p 3446 (2022)
In this paper, we address the permutation flow shop scheduling problem with sequence-dependent and non-anticipatory setup times. These setups are performed or supervised by multiple servers, which are renewable secondary resources (typically human re
Externí odkaz:
https://doaj.org/article/fbe9599e58134b229a1939a2215a43ee
Publikováno v:
The Scientific World Journal, Vol 2014 (2014)
This paper addresses a decision problem related to simultaneously scheduling the tasks in a project and assigning the staff to these tasks, taking into account that a task can be performed only by employees with certain skills, and that the length of
Externí odkaz:
https://doaj.org/article/3045949aa631498f9df978d232ebd743
Publikováno v:
Annals of Operations Research. 322:5-40
Additive Manufacturing (AM) is a disruptive production technology that challenges many well-established, conventional practices in Operations and Supply Chain Management decisions. Consequently, new context-specific decision problems have appeared in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::670c40bc79da2587a40906de8977f69a
https://doi.org/10.1007/s10479-022-05040-4
https://doi.org/10.1007/s10479-022-05040-4
Publikováno v:
European Journal of Operational Research. 299:869-882
In this paper, we address the assembly flowshop scheduling problem, which is a generalisation of two well-known scheduling problems in the literature: the three-stage Assembly Scheduling Problem (ASP) and its variant with two stages denoted as the tw
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8bde1fdfcba7c821d001b1d0232fb138
https://doi.org/10.1016/j.ejor.2021.10.001
https://doi.org/10.1016/j.ejor.2021.10.001
Publikováno v:
IFAC-PapersOnLine. 55:2617-2622
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e6eae7465cd01bac93220e1235ea9ac
https://doi.org/10.1016/j.ifacol.2022.10.104
https://doi.org/10.1016/j.ifacol.2022.10.104
Publikováno v:
Digital.CSIC. Repositorio Institucional del CSIC
instname
instname
The scheduling literature is abundant on approximate methods for permutation flowshop scheduling, as this problem is NP-hard for the majority of objectives usually considered. Among these methods, some of the most efficient ones use an insertion-type
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0060bd464b0abfd33daa67269608d3dc
https://doi.org/10.1016/j.ejor.2019.10.017
https://doi.org/10.1016/j.ejor.2019.10.017
Publikováno v:
Computers & Operations Research. 145:105880
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3bea4d52de6e730fe493b0d55d40cd54
https://doi.org/10.1016/j.cor.2022.105880
https://doi.org/10.1016/j.cor.2022.105880
Publikováno v:
Computers & Operations Research. 109:77-88
In this paper we address the classical hybrid flow shop scheduling problem with makespan objective. As this problem is known to be NP-hard and a very common layout in real-life manufacturing scenarios, many studies have been proposed in the literatur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::199d19cc6823f47fa077c07a9f5c198c
https://doi.org/10.1016/j.cor.2019.05.002
https://doi.org/10.1016/j.cor.2019.05.002