170 research outputs found

    Closed-loop supply chains: What reverse logistics factors influence performance?

    Get PDF
    This paper analyses the inventory and order flow dynamics in closed-loop supply chains (CLSCs). In this kind of supply chains the reverse flow of materials entering the system for recycling purposes complicates the way in which inventories should be managed and replenishment policies should be designed. Specifically, we analyse the relationships between some reverse logistics' factors (remanufacturing lead-time, return rate of recycled products, reverse order policy, and number of supply chain tiers) on the order and inventory variance amplification. We firstly perform a systematic literature review of the related studies. Secondly, by adopting a difference equation math approach and design of experiment we perform a robust what-if analysis of a CLSC under a variety of operational and market conditions. Results show that, ceteris paribus, CLSC outperforms a forward supply chain, both in mono-echelon and multi-echelon structures and under both stationary and turbulent market demands. Furthermore, reducing remanufacturing lead-time and promoting information transparency may be crucial to improve CLSC dynamics. Finally, we use the research findings to provide interesting managerial consideration about how to reduce unnecessary operational members' costs

    On the bullwhip avoidance phase: the synchronized supply chain

    Get PDF
    The aim of this paper is to analyse the operational response of a Synchronised Supply Chain (SSC). To do so, first a new mathematical model of a SSC is presented. An exhaustive Latin Square design of experi- ments is adopted in order to perform a boundary variation analysis of the main three parameters of the periodic review smoothing (S,R) order-up-to policy: i.e., lead time, demand smoothing forecasting factor, and proportional controller of the replenishment rule. The model is then evaluated under a variety of performance measures based on internal process benefits and customer benefits. The main results of the analysis are: (I) SSC responds to violent changes in demand by resolving bullwhip effect and by creating stability in inventories under different parameter settings and (II) in a SSC, long production\u2013 distribution lead times could significantly affect customer service level. Both results have important consequences for the design and operation of supply chains

    A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation

    Get PDF
    [EN] The permutation flowshop problem is a classic machine scheduling problem where n jobs must be processed on a set of m machines disposed in series and where each job must visit all machines in the same order. Many production scheduling problems resemble flowshops and hence it has generated much interest and had a big impact in the field, resulting in literally hundreds of heuristic and metaheuristic methods over the last 60 years. However, most methods proposed for makespan minimisation are not properly compared with existing procedures so currently it is not possible to know which are the most efficient methods for the problem regarding the quality of the solutions obtained and the computational effort required. In this paper, we identify and exhaustively compare the best existing heuristics and metaheuristics so the state-of-the-art regarding approximate procedures for this relevant problem is established. (C) 2016 Elsevier B.V. All rights reserved.The authors are sincerely grateful to the anonymous referees, who provide very valuable comments on the earlier version of the paper. This research has been funded by the Spanish Ministry of Science and Innovation, under projects "ADDRESS" (DPI2013-44461-P/DPI) and "SCHEYARD" (DPI2015-65895-R) co-financed by FEDER funds.Fernandez-Viagas, V.; Ruiz García, R.; Framinan, J. (2017). A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation. European Journal of Operational Research. 257(3):707-721. https://doi.org/10.1016/j.ejor.2016.09.055S707721257

    The effect of inventory record inaccuracy in information exchange supply chains

    Get PDF
    The goal of this paper is to quantify the impact of Inventory Record Inaccuracy on the dynamics of collaborative supply chains, both in terms of operational performance (i.e. order and inventory stability), and customer service level. To do so, we model an Information Exchange Supply Chain under shrinkage errors in the inventory item recording activity of their nodes, present the mathematical formulation of such supply chain model, and conduct a numerical simulation assuming different levels of errors. Results clearly show that Inventory Record Inaccuracy strongly compromises supply chain stability, particularly when moving upwards in the supply chain. Important managerial insights can be extracted from this analysis, such as the role of 'benefit-sharing' strategies in order to guarantee the advantage of investments in connectivity technologies

    A scheduling theory framework for GPU tasks efficient execution

    Get PDF
    Concurrent execution of tasks in GPUs can reduce the computation time of a workload by overlapping data transfer and execution commands. However it is difficult to implement an efficient run- time scheduler that minimizes the workload makespan as many execution orderings should be evaluated. In this paper, we employ scheduling theory to build a model that takes into account the device capabili- ties, workload characteristics, constraints and objec- tive functions. In our model, GPU tasks schedul- ing is reformulated as a flow shop scheduling prob- lem, which allow us to apply and compare well known methods already developed in the operations research field. In addition we develop a new heuristic, specif- ically focused on executing GPU commands, that achieves better scheduling results than previous tech- niques. Finally, a comprehensive evaluation, showing the suitability and robustness of this new approach, is conducted in three different NVIDIA architectures (Kepler, Maxwell and Pascal).Proyecto TIN2016- 0920R, Universidad de Málaga (Campus de Excelencia Internacional Andalucía Tech) y programa de donación de NVIDIA Corporation

    Controllable Processing Times in Project and Production Management: Analysing the Trade-Off between Processing Times and the Amount of Resources

    Get PDF
    The amount of resources assigned to a task highly influences its processing time. Traditionally, different functions have been used in the literature in order to map the processing time of the task with the amount of resources assigned to the task. Obviously, this relation depends on several factors such as the type of resource and/or decision problem under study. Although in the literature there are hundreds of papers using these relations in their models or methods, most of them do not justify the motivation for choosing a specific relation over another one. In some cases, even wrong justifications are given and, hence, infeasible or nonappropriated relations have been applied for the different problems, as we will show in this paper. Thus, our paper intends to fill this gap establishing the conditions where each relation can be applied by analysing the relations between the processing time of a task and the amount of resources assigned to that task commonly employed in the production and project management literature
    corecore