scholarly journals Task Scheduling Problem of Double-Deep Multi-Tier Shuttle Warehousing Systems

Processes ◽  
2020 ◽  
Vol 9 (1) ◽  
pp. 41
Author(s):  
Xiangnan Zhan ◽  
Liyun Xu ◽  
Xufeng Ling

Double-deep multi-tier shuttle warehousing systems (DMSWS) have been increasingly applied for store-and-retrieval stock-keeping unit tasks, with the advantage of a reduced number of aisles and improved space utilization. Scheduling different devices for retrieval tasks to increase system efficiency is an important concern. In this paper, a Pareto optimization model of task operations based on the cycle time and carbon emissions is presented. The impact of the rearrangement operation is considered in this model. The cycle time model is converted into a flow-shop scheduling model with parallel machines by analyzing the retrieval operation process. Moreover, the carbon emissions of the shuttle in the waiting process, the carbon emissions of the lift during the free process, and the carbon emissions of the retrieval operation are considered in the carbon emissions model, which can help us to evaluate the carbon emissions of the equipment more comprehensively during the entire retrieval task process. The elitist non-dominated sorting genetic algorithm II (NSGA-II) is adopted to solve the non-linear multi-objective optimization function. Finally, a real case is adopted to illustrate the findings of this study. The results show that this method can reduce carbon emissions and improve system efficiency. In addition, it also help managers to reduce operational costs and improve the utilization of shuttles.

2013 ◽  
Vol 651 ◽  
pp. 548-552
Author(s):  
Parinya Kaweegitbundit

This paper considers two stage hybrid flow shop (HFS) with identical parallel machine. The objectives is to determine makespan have been minimized. This paper presented memetic algorithm procedure to solve two stage HFS problems. To evaluated performance of propose method, the results have been compared with two meta-heuristic, genetic algorithm, simulated annealing. The experimental results show that propose method is more effective and efficient than genetic algorithm and simulated annealing to solve two stage HFS scheduling problems.


2012 ◽  
Vol 50 (10) ◽  
pp. 2796-2808 ◽  
Author(s):  
Beatriz Murrieta Cortés ◽  
Juan Carlos Espinoza García ◽  
Fabiola Regis Hernández

2020 ◽  
Vol 10 (10) ◽  
pp. 3534
Author(s):  
Sadok Turki ◽  
Soulayma Sahraoui ◽  
Christophe Sauvey ◽  
Nathalie Sauer

Due to environmental concerns, firms are under increasing pressure to comply with legislations and to take up environmental strategies. This leads researchers and firms to develop new sustainable supply chains, where a new area has emerged for a manufacturing and reconditioning system. The originality of this work consists in simultaneously considering carbon emissions strategies, carbon tax and mandatory emission in a manufacturing-reconditioning system. The proposed system is composed of two parallel machines, a manufacturing stock, a reconditioning stock and a recovery inventory. In order to make the proposed green manufacturing system more realistic, it is assumed that manufactured (new products) and reconditioned products are distinguishable. The quantity of worn products (used products) depends on the sales in the previous periods, and the repair periods of the machines are stochastic and independent. The aim of this work is to determine the optimal capacities of manufacturing and reconditioning stocks that maximize the total profit, as well as the optimal value of worn products under two carbon emissions’ limitations. An evolutionary algorithm is developed, along with an efficient improvement method, to find the optimal value of decision variables. Ultimately, numerical results are provided to show the impact of the period of carbon limit and the worn products (returned products) on decision variables.


2012 ◽  
Vol 201-202 ◽  
pp. 1004-1007 ◽  
Author(s):  
Guo Xun Huang ◽  
Wei Xiang ◽  
Chong Li ◽  
Qian Zheng ◽  
Shan Zhou ◽  
...  

The efficient surgical scheduling of the operating theatre plays a significant role in hospital’s income and cost. Currently surgical scheduling only considered the surgery process in operating room and ignored other stages which should not be left out in real situations. The surgical scheduling problem is regarded as the hybrid flow-shop scheduling problem in this study. Each elective surgery which need local anesthesia has to go through a two-stage surgery procedure. Beds and operating rooms are represented as parallel machines. A mathematical model for such surgical scheduling problem is proposed and solved by LINGO. A case study with its optimal solution is also presented to verify the model.


Sign in / Sign up

Export Citation Format

Share Document