1,720,987 research outputs found
Supply Chain Innovation for Parts Inventory Optimisation
No full textThe Ph.D. project focuses on spare parts supply chain optimisation and it is related to the innovation of a European spare parts Supply Chain. The project first focused on the single warehouses, and then a global perspective was taken, looking at the whole supply chain.
In the local perspective, the optimisation of the operational processes was considered. The objective was the improvement of the service level/inventory trade-off. Three main phases of the inventory management have been considered: the forecasting process (i.e., the methods used to predict future unknown demand), the planning process (i.e., setting inventory targets and issuing replenishment orders to suppliers) and the allocation process (i.e., giving the available inventory to customers according to their orders and their priority). Various algorithms have been proposed to improve the single inventory for all the three phases, both for fast and slow moving products.
In the global perspective, we studied the demand variability propagation in the supply chain (i.e., the Bullwhip Effect), which is one of the main causes of inefficiency and of cost increase. The identification of the bullwhip effect and of its potential influencing factors were the main topics we focused on, both from an empirical and a theoretical point of view. From the empirical standpoint, we proved that dealers tend to decouple supply and demand and, when they are given incentives to forward-buy, they may prefer to forward-buy fast moving items, especially during the switches from promotional to non-promotional periods. Instead, from the theoretical point of view, we proved that not knowing the demand process parameters increases the bullwhip effect. Also, an analytical approximation of the bullwhip was derived
An effective approach for total completion time minimization subject to makespan constraint in permutation flowshops
Full text linkThis article addresses the permutation flowshop scheduling problem with the objective of minimizing the total completion time subject to a makespan constraint. The makespan is related to system utilization while the total completion time is related to the waiting time, and hence to the work in process (WIP); in real contexts, focusing on both total completion time and makespan allows a good trade-off between WIP and utilization to be found. Two local search algorithms are developed in the paper and, by using an extensive computational experience on literature benchmark instances, they are proved to be able to find good solutions both for regular and no-wait flowshops
An empirical investigation of the bullwhip effect on a complex three-echelon supply chain
No full textExploring the interplay of costs and flow time in server allocation for flow lines with parallel non-identical machines
No full textThe Server Allocation Problem is a significant challenge in manufacturing systems involving deciding the number and version of machines for each stage. This optimization problem is of utmost importance when there is a trade-off between minimizing investment costs and flow time while achieving target performance, such as a minimum throughput. Manufacturing systems often employ hybrid flow lines, with non-identical machines at each stage. This paper analyzes the trade-off between minimizing costs and flow time when allocating servers in hybrid flow lines by proposing a bi-criteria approach that uses an efficient pattern-based problem representation and a Variable Neighborhood Search solution algorithm. The objectives are to minimize total cost and flow time while ensuring a target throughput. A metric for comparing obtained solutions is proposed, providing insights for practical implementation. A comprehensive numerical analysis is conducted, to validate the proposed approach and demonstrate its applicability in real-world manufacturing settings
Implementing Job Sequencing in a CONWIP fully automated assembly line
No full textElectric vehicle production poses several challenges from the manufacturing point of view due to the uncertainty in the price and availability of raw materials and the frequent fluctuations of market demand. Moreover, mass customisation requires flexible and reconfigurable manufacturing systems, while the automation of the assembly lines to achieve a higher throughput rate and the complexity of job handling require conveyors and carousels. This paper investigates the implementation of job sequencing policies through conveyor loops to improve the flexibility and reconfigurability of a realistic CONWIP assembly line while avoiding upstream and downstream variability propagation. Scenario analysis evaluates how different job sequencing strategies and WIP control can impact the average and standard deviation of the shift throughput, the average job flow time, and the probability of deadlocks on an assembly line for stators of electric engines
Circular economy at scheduling level: influencing factors and impacts on system performance
No full textIn manufacturing systems, Circular economy (CE) strategies to recover returned end-of-life prod-ucts can reduce raw material purchasing costs and lead times while improving environmental performance. However, CE strategies may undermine production planning, control, and inventory management activities, and there is a lack of scientific evidence about the impact on work-in-progress (WIP) and overall performance. This paper uses Discrete Event Simulation to analyse the factors influencing the exploitation of returned products under different CE strategies and priority rules. The experiments investigate the impacts on makespan, virgin raw material consumptions, and WIP at the scheduling level in a realistic production and assembly system where production is coupled with disassembly, repairing, remanufacturing, and reusing. The results highlight the importance of production control strategies in limiting the negative impacts of CE strategies on WIP, makespan,and materials consumption. Moreover, frequent rescheduling is required due to the high variability affecting the systems implementing CE strategies
Managing different demand classes in a spare parts inventory: a practical dynamic allocation strategy
No full textThe Server Allocation Problem with non-identical machines: A meta-heuristic approach
No full textFirms often need to drastically improve the production rate to meet customer demand, also according to some forecast scenarios. To this end, in the design phase, one of the most significant problem is how to allocate new resources to design efficient production systems. This paper addresses the resource (or server) allocation problem of series-parallel production lines where non-identical machines can be assigned at each stage. Machines can be chosen from a list of versions available on the market, whose purchase cost depends on their related processing speed. The decision problem consists in selecting both number and version of machines to be allocated at each production stage. The goal is to minimize the total cost while assuring a minimum target throughput. To solve the aforementioned server allocation problem (SAP), we accomplished three major research steps. First, we devised an efficient evaluative simulation algorithm that, properly combined with a pattern-based problem representation, allows handling non-identical machines at each stage during the optimization phase. Secondly, we developed a specific constructive heuristic for generating a feasible solution of the SAP. Finally, we used such heuristic solution to speed up the convergence of a new Variable Neighborhood Search (VNS) algorithm, whose effectiveness has been tested through a comprehensive numerical analysis involving five alternative state-of-the-art meta-heuristics
Integrating buffer “stock” and buffer loops in an assembly line with conveyors: An automotive case study
No full textThe degree of automation in manufacturing systems, along with the characteristics of job handling and transport between workstations, and the product cycle time, determine the most suitable job handling system for each line. Conveyor systems allow for the management of re-entrant flows at the same workstations and more flexible system architecture through carousels, which also serve as a buffer loop to accommodate jobs awaiting machine availability. This paper explores the role of buffer stocks and blocking after service mechanisms, task allocation within the system, and operational characteristics to tackle the assembly line balancing problem in a fully automated assembly line interconnected by conveyors through discrete event simulation. Scenario analysis is employed to assess the impacts of constraining job flows through the conveyors on: fluctuations in throughput from shift to shift, its variability, and the critical WIP threshold for the CONWIP logic
A column generation algorithm for the Buffer Allocation Problem approximated by the Time Buffer concept
No full text- …
