Buscar
Mostrando ítems 71-80 de 191
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Skill requirements and labour polarisation: an association analysis based on Polish online job offers
(Elsevier, 2022-10)
This paper uses the methodological scheme of contingency tables to explore polarisation in the Polish labour market. We use a large database of online job offers published on selected Polish job portals in the period ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
On bullwhip-limiting strategies in divergent supply chain networks
(Elsevier, 2014-07)
The amplification of demand variation in a supply chain network (SCN) is a well-known phenomenon called the bullwhip effect. This effect generates a large volume of inefficiencies as it moves a greater number of units than ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Information sharing in supply chains with heterogeneous retailers
(Elsevier, 2018)
This work analyses partial information sharing involving retailers with different operational configurations. Retailers are characterized by four operational factors, i.e., demand variance, lead time average, forecasting ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
An assessment of European electricity arbitrage using storage systems
(Elsevier, 2022-03)
Electricity arbitrage involves the storage of energy at times when prices are low, and offering it on the markets when prices are high. The development of renewable and energy storage technologies may provide a promising ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimize total tardiness
(Elsevier, 2018)
The permutation flow shop scheduling problem is one of the most studied operations research related problems. Literally, hundreds of exact and approximate algorithms have been proposed to optimise several objective functions. ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Permutation flowshop scheduling with periodic maintenance and makespan objective
(Elsevier, 2020-05)
In this paper, we address the permutation flowshop scheduling problem with cyclical unavailability periods where no operation can be processed. Under this constraint, all machines must stop at the same time due to the shift ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Customer-oriented risk assessment in Network Utilities
(Elsevier, 2016-03)
For companies that distribute services such as telecommunications, water, energy, gas, etc., quality perceived by the customers has a strong impact on the fulfillment of financial goals, positively increasing the demand ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Profit-efficiency analysis of forest ecosystem services in the southeastern US
(Elsevier, 2023-12)
Technical, allocative, and profit efficiency of longleaf pine (Pinus palustris. Mill) forests in the southeastern United States, producing ecosystem services such as timber, tree biodiversity, water, and carbon sequestration, ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Guidelines for the deployment and implementation of manufacturing scheduling systems
(Taylor & Francis, 2011)
It has frequently been stated that there exists a gap between production scheduling theory and practice. In order to put theoretical findings into practice, advances in scheduling models and solution procedures should be ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
New approximate algorithms for the customer order scheduling problem with total completion time objective
(Elsevier, 2017-02)
In this paper, we study a customer order scheduling problem where a number of orders, composed of several product types, have to be scheduled on a set of parallel machines, each one capable to process a single product type. ...