scholarly journals Data mining–based disturbances prediction for job shop scheduling

2019 ◽  
Vol 11 (3) ◽  
pp. 168781401983817 ◽  
Author(s):  
Yongtao Qiu ◽  
Rapinder Sawhney ◽  
Chaoyang Zhang ◽  
Shao Chen ◽  
Tao Zhang ◽  
...  

In real production manufacturing process, there are many disturbances (e.g. machine fault, shortage of materials, tool damage) which can greatly interfere the original scheduling. These interventions will cost production managers extra time to schedule orders, which increase much workload and cost of maintenance. On account of this phenomenon, a novel system of data mining–based disturbances prediction for job shop scheduling is proposed. It consists of three modules: data mining module, disturbances prediction module, and manufacturing process module. First, in data mining module, historical data and new data are acquired by radio frequency identification or cable from database, and a hybrid algorithm is used to build a disturbance tree which is utilized as a classifier of disturbances happened before manufacturing. Then, in the disturbances prediction module, a disturbances pattern is built and a decision making will be determined according to the similarity between testing data attributes and mined pattern. Finally, in the manufacturing process module, scheduling will be arranged in advance to avoid the disturbances according to the results of decision making. Besides, an experiment is conducted at the end of this article to show the prediction process and demonstrate the feasibility of the proposed method.

2019 ◽  
Vol 18 (01) ◽  
pp. 35-56
Author(s):  
M. Habib Zahmani ◽  
B. Atmani

Identifying the best Dispatching Rule in order to minimize makespan in a Job Shop Scheduling Problem is a complex task, since no Dispatching Rule is better than all others in different scenarios, making the selection of a most effective rule which is time-consuming and costly. In this paper, a novel approach combining Data Mining, Simulation, and Dispatching Rules is proposed. The aim is to assign in real-time a set of Dispatching Rules to the machines on the shop floor while minimizing makespan. Experiments show that the suggested approach is effective and reduces the makespan within a range of 1–44%. Furthermore, this approach also reduces the required computation time by using Data Mining to determine and assign the best Dispatching Rules to machines.


1999 ◽  
Vol 10 (7) ◽  
pp. 690-706 ◽  
Author(s):  
K. Mesghouni ◽  
P. Pesin ◽  
D. Trentesaux ◽  
S. Hammadi ◽  
C. Tahon ◽  
...  

2009 ◽  
Vol 57 (3) ◽  
pp. 195-208 ◽  
Author(s):  
T. Witkowski ◽  
P. Antczak ◽  
A. Antczak

Multi-objective decision making and search space for the evaluation of production process schedulingOver the years, various approaches have been proposed in order to solve the multi-objective job-shop scheduling problem - particularly a hard combinatorial optimization problem. The paper presents an evaluation of job shop scheduling problem under multiple objectives (mean flow time, max lateness, mean tardiness, mean weighted tardiness, mean earliness, mean weighted earliness, number of tardy tasks). The formulation of the scheduling problem has been presented as well as the evaluation schedules for various optimality criteria. The paper describes the basic mataheuristics used for optimization schedules and the approaches that use domination method, fuzzy method, and analytic hierarchy proccess (AHP) for comparing schedules in accordance with multiple objectives. The effectiveness of the algorithms has been tested on several examples and the results have been shown. New search space for evaluation and generation of schedules has been created. The three-dimensional space can be used for the analysis and control of the production processes.


Sensors ◽  
2019 ◽  
Vol 19 (23) ◽  
pp. 5254 ◽  
Author(s):  
Cunji Zhang ◽  
Xifan Yao ◽  
Wei Tan ◽  
Yue Zhang ◽  
Fudong Zhang

The job-shop scheduling is an important approach to manufacturing enterprises to improve response speed, reduce cost, and improve service. Proactive scheduling for job-shop based on abnormal event monitoring of workpieces and remaining useful life prediction of tools is proposed with radio frequency identification (RFID) and wireless accelerometer in this paper. Firstly, the perception environment of machining job is constructed, the mathematical model of job-shop scheduling is built, the framework of proactive scheduling is put forward, and the hybrid rescheduling strategy based on real-time events and predicted events is adopted. Then, the multi-objective, double-encoding, double-evolving, and double-decoding genetic algorithm (MD3GA) is used to reschedule. Finally, an actual prototype platform to machine job is built to verify the proposed scheduling method. It is shown that the proposed method solves the integration problem of dynamic scheduling and proactive scheduling of processing workpieces, reduces the waste of redundant time for the scheduling, and avoids the adverse impact on abnormal disturbances.


Sign in / Sign up

Export Citation Format

Share Document