scholarly journals Predictive Scheduling with Markov Chains and ARIMA Models

2020 ◽  
Vol 10 (17) ◽  
pp. 6121
Author(s):  
Łukasz Sobaszek ◽  
Arkadiusz Gola ◽  
Edward Kozłowski

Production scheduling is attracting considerable scientific interest. Effective scheduling of production jobs is a critical element of smooth organization of the work in an enterprise and, therefore, a key issue in production. The investigations focus on improving job scheduling effectiveness and methodology. Due to simplifying assumptions, most of the current solutions are not fit for industrial applications. Disruptions are inherent elements of the production process and yet, for reasons of simplicity, they tend to be rarely considered in the current scheduling models. This work presents the framework of a predictive job scheduling technique for application in the job-shop environment under the machine failure constraint. The prediction methods implemented in our work examine the nature of the machine failure uncertainty factor. The first section of this paper presents robust scheduling of production processes and reviews current solutions in the field of technological machine failure analysis. Next, elements of the Markov processes theory and ARIMA (auto-regressive integrated moving average) models are introduced to describe the parameters of machine failures. The effectiveness of our solutions is verified against real production data. The data derived from the strategic machine failure prediction model, employed at the preliminary stage, serve to develop the robust schedules using selected dispatching rules. The key stage of the verification process concerns the simulation testing that allows us to assess the execution of the production schedules obtained from the proposed model.

2017 ◽  
Vol 18 (1) ◽  
pp. 29
Author(s):  
Riven Nasution ◽  
Annisa Kesy Garside ◽  
Dana Marsetiya Utama

Production scheduling is an important activity in manufacturing. Optimal scheduling affects the time of completion of the work. PT. Interpack is a company that produces packaging machines. The job schedule of the product spare part still uses the random priority rules. Use of random rules makes a lot of time delay. Delay causes operator and machine idle. Delay also causes the total time of completion of the work (makespan) and delay the greater.  So it needs to be rescheduled to work on the spare part of product. Job scheduling using the Artificial Immune System (AIS) algorithm. AIS was developed by Farmer et al. The AIS algorithm refers to the human immune system. The stages of the AIS algorithm begin with random initialization, antibody representation and gene classification, clone breeding, selection of donor antibodies, germ-line construction, gene fragment redesign, and ending with diversification of antibodies. AIS algorithm scheduling resulted in a more optimal new schedule. AIS algorithm scheduling generates a future of 6483.91 minutes. Company scheduling generates makespan of 7059.99 minutes. AIS Schedule finishes algorithm 4 days of the due date. AIS algorithm schedule increase machine utility by 1%.


2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Jianfei Ye ◽  
Huimin Ma

In order to solve the joint optimization of production scheduling and maintenance planning problem in the flexible job-shop, a multiobjective joint optimization model considering the maximum completion time and maintenance costs per unit time is established based on the concept of flexible job-shop and preventive maintenance. A weighted sum method is adopted to eliminate the index dimension. In addition, a double-coded genetic algorithm is designed according to the problem characteristics. The best result under the circumstances of joint decision-making is obtained through multiple simulation experiments, which proves the validity of the algorithm. We can prove the superiority of joint optimization model by comparing the result of joint decision-making project with the result of independent decision-making project under fixed preventive maintenance period. This study will enrich and expand the theoretical framework and analytical methods of this problem; it provides a scientific decision analysis method for enterprise to make production plan and maintenance plan.


2020 ◽  
Author(s):  
Su Nguyen ◽  
Mengjie Zhang ◽  
Damminda Alahakoon ◽  
Kay Chen Tan

Evolving production scheduling heuristics is a challenging task because of the dynamic and complex production environments and the interdependency of multiple scheduling decisions. Different genetic programming (GP) methods have been developed for this task and achieved very encouraging results. However, these methods usually have trouble in discovering powerful and compact heuristics, especially for difficult problems. Moreover, there is no systematic approach for the decision makers to intervene and embed their knowledge and preferences in the evolutionary process. This article develops a novel people-centric evolutionary system for dynamic production scheduling. The two key components of the system are a new mapping technique to incrementally monitor the evolutionary process and a new adaptive surrogate model to improve the efficiency of GP. The experimental results with dynamic flexible job shop scheduling show that the proposed system outperforms the existing algorithms for evolving scheduling heuristics in terms of scheduling performance and heuristic sizes. The new system also allows the decision makers to interact on the fly and guide the evolution toward the desired solutions.


2021 ◽  
Vol 1 (2) ◽  
pp. 46-51
Author(s):  
Dwi Ayu Lestari, Vikha Indira Asri

Scheduling is defined as the process of sequencing the manufacture of a product as a whole on several machines. All industries need proper scheduling to manage the allocation of resources so that the production system can run quickly and precisely as of it can produce optimal product. PT. Sari Warna Asli Unit V is one of the companies that implements a make to order production system with the FCFS system. Thus, scheduling the production process at this company is also known as job shop production scheduling. The methods used in this research are the CDS method, the EDD method and the FCFS method. The purpose of this research is to minimize the production time and determine the best method that can be applied to the company. The results of this research showed that the makespan obtained in the company's scheduling system with FCFS rules was 458 minutes, and the results of scheduling using the CDS method obtained a makespan value of 329 minutes, then the best production scheduling method that had the smallest makespan value was the CDS method.


2021 ◽  
Vol 5 (1) ◽  
Author(s):  
Inna Kholidasari ◽  

Production scheduling is the most important part in carrying out the production process that will be carried out on a production floor. Scheduling activities are carried out before the production process begins to ensure the smooth running of the production process. If the production scheduling is not done properly, there will be obstacles in the production process and will cause losses to the company. This study aims to determine the production machine scheduling in a company engaged in the manufacture of spare parts for automotive products. This company implements a job shop production process and uses the First In First Out method in completing its work. Due to the large number of products that have to be produced, there are often two or more products that must be worked on at the same time and machine. This condition causes some products to have to wait for the associated machine to finish operating and causes long product turnaround times. This problem is solved by making a production machine scheduling using the Non-Delay method. By applying this method, the makespan of completion time can be minimized.


2021 ◽  
Vol 13 (23) ◽  
pp. 13016
Author(s):  
Rami Naimi ◽  
Maroua Nouiri ◽  
Olivier Cardin

The flexible job shop problem (FJSP) has been studied in recent decades due to its dynamic and uncertain nature. Responding to a system’s perturbation in an intelligent way and with minimum energy consumption variation is an important matter. Fortunately, thanks to the development of artificial intelligence and machine learning, a lot of researchers are using these new techniques to solve the rescheduling problem in a flexible job shop. Reinforcement learning, which is a popular approach in artificial intelligence, is often used in rescheduling. This article presents a Q-learning rescheduling approach to the flexible job shop problem combining energy and productivity objectives in a context of machine failure. First, a genetic algorithm was adopted to generate the initial predictive schedule, and then rescheduling strategies were developed to handle machine failures. As the system should be capable of reacting quickly to unexpected events, a multi-objective Q-learning algorithm is proposed and trained to select the optimal rescheduling methods that minimize the makespan and the energy consumption variation at the same time. This approach was conducted on benchmark instances to evaluate its performance.


Symmetry ◽  
2019 ◽  
Vol 11 (2) ◽  
pp. 165 ◽  
Author(s):  
Arun Sangaiah ◽  
Mohsen Suraki ◽  
Mehdi Sadeghilalimi ◽  
Seyed Bozorgi ◽  
Ali Hosseinabadi ◽  
...  

In a real manufacturing environment, the set of tasks that should be scheduled is changing over the time, which means that scheduling problems are dynamic. Also, in order to adapt the manufacturing systems with fluctuations, such as machine failure and create bottleneck machines, various flexibilities are considered in this system. For the first time, in this research, we consider the operational flexibility and flexibility due to Parallel Machines (PM) with non-uniform speed in Dynamic Job Shop (DJS) and in the field of Flexible Dynamic Job-Shop with Parallel Machines (FDJSPM) model. After modeling the problem, an algorithm based on the principles of Genetic Algorithm (GA) with dynamic two-dimensional chromosomes is proposed. The results of proposed algorithm and comparison with meta-heuristic data in the literature indicate the improvement of solutions by 1.34 percent for different dimensions of the problem.


Sign in / Sign up

Export Citation Format

Share Document