An investigation of multiproduct, multimachine production scheduling and inventory control of a flow-shop system

1978 ◽  
Vol 16 (6) ◽  
pp. 477-491 ◽  
Author(s):  
DILEEP DHAVALE ◽  
SUMER AGGARWAL
2021 ◽  
Vol 13 (14) ◽  
pp. 7708
Author(s):  
Yiping Huang ◽  
Qin Yang ◽  
Jinfeng Liu ◽  
Xiao Li ◽  
Jie Zhang

In order to reduce the energy consumption of furnaces and save costs in the product delivery time, the focus of this paper is to discuss the uncertainty of demand in the rolling horizon and to globally optimize the sustainability of the production in the aluminum furnace hot rolling section in environmental and economic dimensions. First, the triples α/β/γ are used to describe the production scheduling in the aluminum furnace hot rolling section as the scheduling of flexible flow shop, satisfied to constraints of demand uncertainty, operation logic, operation time, capacity and demand, objectives of minimizing the residence time of the ingot in the furnace and minimizing the makespan. Second, on the basis of describing the uncertainty of demand in rolling horizon with the scenario tree, a multi-objective mixed integer linear programming (MILP) optimization model for sustainable production in the aluminum furnace hot rolling section is formulated. Finally, an aluminum alloy manufacturer is taken as an example to illustrate the proposed model. The computational results show that when the objective weight combination takes the value of α=0.7, β=0.3, the sustainability indicators of the environmental and economic dimensions can be optimized to the maximum extent possible at the same time. Increasingly, managerial suggestions associated with the trade-off between environmental and economic dimensions are presented. Scheduling in the rolling horizon can optimize the production process of the aluminum furnace hot rolling section globally, indicating that it is more conducive to the sustainable development of the environment and economic dimensions than scheduling in a single decision time period.


2011 ◽  
Vol 49 (11) ◽  
pp. 3151-3170 ◽  
Author(s):  
Wei Li ◽  
Xinggang Luo ◽  
Deyi Xue ◽  
Yiliu Tu

2021 ◽  
Vol 2 ◽  
pp. 41-46
Author(s):  
Pavol Jurík

Production scheduling optimization is a very important part of a production process. There are production systems with one service object and systems with multiple service objects. When using several service objects, there are systems with service objects arranged in a parallel or in a serial manner. We also distinguish between systems such as flow shop, job shop, open shop and mixed shop. Throughout the history of production planning, a number of algorithms and rules have been developed to calculate optimal production plans. These algorithms and rules differ from each other in the possibilities and conditions of their application. Since there are too many possible algorithms and rules it is not easy to select the proper algorithm or rule for solving a specific scheduling problem. In this article we analyzed the usability of 33 different algorithms and rules in total. Each algorithm or rule is suitable for a specific type of problem. The result of our analysis is a set of comparison tables that can serve as a basis for making the right decision in the production process decision-making process in order to select the proper algorithm or rule for solving a specific problem. We believe that these tables can be used for a quick and easy selection of the proper algorithm or rule for solving some of the typical production scheduling problems.


2018 ◽  
Vol 19 (2) ◽  
pp. 148
Author(s):  
Siti Muhimatul Khoiroh

Production scheduling is one of the key success factors in the production process. Scheduling approach with Non-Permutation flow shop is a generalization of the traditional scheduling problems Permutation flow shop for the manufacturing industry to allow changing the job on different machines with the flexibility of combinations. This research tries to develop a heuristic approach that is non-delay algorithm by comparing Shortest Processing Time (SPT) and Largest Remaining Time (LRT) in the case of non-permutation flow shop to produce minimum mean flow time ratio. The result of simulation shows that the SPT algorithm gives less mean flow time value compared to LRT algorithm which means that SPT algorithm is better than LRT in case of non-permutation hybrid flow shop.


2020 ◽  
Vol 10 (1) ◽  
pp. 20-27
Author(s):  
Chamdan Mashuri ◽  
Ahmad Heru Mujianto ◽  
Hadi Sucipto ◽  
Rinaldo Yudianto Arsam

Research has been carried out by developing an optimization information system for scheduling production machines by applying the Android-based GUPTA method. This android-based application is able to optimize production time, because in the android application it implements the GUPTA algorithm which uses the calculation of the comparative processing time on every machine in the company by prioritizing the smallest processing time for scheduling which aims to optimize production scheduling time, by paying attention to the value of makespan to produce product size 12 griddle, size 14 griddle, 16 size griddle, 18 size griddle and 20 size griddle so that an optimal makespan value is obtained. The GUPTA method can be used in problems with more than two machines, because this method combines the time of each process on the first and subsequent machines to find the minimum value and can only be used in pure flow shop scheduling. The advantage of this method is that it determines scheduling only on one machine group. This research resulted in an Android-based application that can schedule products to be produced by machines automatically. From the results of testing with a total of 12 pieces of production in each product with a total of 5 different sizes, the minimum value of makespan is obtained, namely 2054569 minutes with the sequence of product processing with work order 12 griddle, griddle 18, griddle 20, griddle 16, and griddle 14 The accuracy of the application test results shows 98.87% for the first time and 98.84% for the second time when compared with manual calculations.


2011 ◽  
Vol 2011.60 (0) ◽  
pp. _507-1_-_507-2_
Author(s):  
Tatsuhiko SAKAGUCHI ◽  
Tatsurou MURAKAMI ◽  
Syohei FUJITA ◽  
Yoshiaki SHIMIZU ◽  
Keiichi SHIRASE

Sign in / Sign up

Export Citation Format

Share Document