Buscar
Mostrando ítems 41-50 de 191
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Root-cause analysis in the aftersales management
(Universidad del Zulia, 2014)
This article focuses on one of the steps proposed by the authors as a framework for improving the management of post-sale service. Specifically, the referred step tries to apply root cause analysis of failures to improve ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
A bi-criteria approach to the truck-multidrone routing problem
(Elsevier, 2024-06)
In the rapidly expanding field of e-commerce logistics, the optimisation of last-mile delivery solutions is paramount. This paper introduces a novel methodology that addresses this challenge by generating approximate Pareto ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
The implications of batching in the bullwhip effect and customer service of closed-loop supply chains
(Elsevier, 2022-02)
Batching is a well-known cause of the bullwhip effect. Despite being very common in many industries to leverage economies of scale, it has been little explored due to its nonlinear complexity. This work examines how ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Dynamic artificial neural network-based reliability considering operational context of assets
(Elsevier, 2019-08)
Assets reliability is a key issue to consider in the maintenance management policy and given its importance several estimation methods and models have been proposed within the reliability engineering discipline. However, ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Closed-loop supply chains: How do production capacity and production control policies impact the performance?
(Elsevier, 2024-03)
The paper addresses the impact of manufacturing and remanufacturing capacity in a multi-product closed-loop supply chain. In the problem under investigation, the manufacturing system of the factory node is characterized ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
(Elsevier, 2019)
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 ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Programación y evaluación pública: un triángulo complejo
(Gobierno Vasco = Eusko Jaurlaritza: Departamento de Hacienda y Administración Pública = Ogasun eta Herri Administrazio Saila, 2005)
El desarrollo teórico de la evaluación de políticas públicas se ha centrado en la elaboración de herramientas y metodologías de análisis de programas y proyectos aislados. Los programas públicos actuales están caracterizados ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
A new set of high-performing heuristics to minimize flowtime in permutation flowshops
(Elsevier, 2015)
This paper addresses the problem of scheduling jobs in a permutation flowshop with the objective of total completion time minimisation. Since this problem is known to be NP-hard, most research has focussed on obtaining ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Failure mode prediction and energy forecasting of PV plants to assist dynamic maintenance tasks by ANN based models
(Elsevier, 2015-09)
In the field of renewable energy, reliability analysis techniques combining the operating time of the system with the observation of operational and environmental conditions, are gaining importance over time. In this ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
(Elsevier, 2014-05)
The most efficient approximate procedures so far for the flowshop scheduling problem with makespan objective – i.e. the NEH heuristic and the iterated greedy algorithm – are based on constructing a sequence by iteratively ...