An analysis of dynamic scheduling for job-shop scheduling and its improvement using intelligent algorithms

1993 ◽  
pp. 563-568
Author(s):  
T. Watanabe ◽  
H. Tokumaru ◽  
Y. Hashimoto
Keyword(s):  
Job Shop ◽  
Dynamic Scheduling ◽  
Job Shop Scheduling ◽  
Intelligent Algorithms ◽  
Shop Scheduling

Modeling and Scheme Generation of Dynamic Flexible Job-Shop Scheduling

2013 ◽  
Vol 423-426 ◽  
pp. 2232-2236
Author(s):  
Ying Pan ◽  
Dong Juan Xue ◽  
Tian Yi Gao ◽  
Li Bin Zhou ◽  
Xiao Yu Xie
Keyword(s):  
Dynamic Simulation ◽  
Job Shop ◽  
Dynamic Scheduling ◽  
Job Shop Scheduling ◽  
Adaptive Genetic Algorithm ◽  
Flexible Job Shop ◽  
Uncertain Information ◽  
Flexible Job Shop Scheduling ◽  
Shop Scheduling ◽  
Scheduling Method

Aiming at uncertain information and dynamic characteristic during flexible job-shop scheduling process, some kind of dynamic scheduling method for flexible job-shop scheduling problem (FJSP) is put forward based on real-time adjustment. A dynamic simulation solution mode framework is presented for FJSP. This framework is inspired by adaptive control, combined with the robust scheduling and foreseeing scheduling. It has both advantages of such two scheduling methods, and its stable and highly efficient. Preliminary scheme generation method based on foreseeing dynamics scheduling is introduced then. Foreseeing function is realized by fault-handling algorithm and dynamic simulation solver on the basis of Adaptive Genetic Algorithm (AGA).

Research on Dynamic Scheduling Technology in Job Shop with Tool Flow

2013 ◽  
Vol 313-314 ◽  
pp. 685-688 ◽  
Author(s):  
Xi Chen ◽  
Guo Xin Wang
Keyword(s):  
Job Shop ◽  
Dynamic Scheduling ◽  
Job Shop Scheduling ◽  
Heuristic Approach ◽  
New Method ◽  
Decision Point ◽  
Shop Scheduling ◽  
Flow Interaction ◽  
Job Selection ◽  
Point Calculation

To solve the tool flow and part flow interaction problems in job-shop scheduling, a kind of dynamic scheduling technology in job shop with tool flow is proposed. A new method of decision point calculation and a new heuristic approach for job selection named tools-minimally-occupied (TMO) are proposed. According to the method and the rule, the problems of when and how to select the parts in the dynamic scheduling are solved. The technology is proved to be effective by examples.

scholarly journals Proactive Scheduling for Job-Shop Based on Abnormal Event Monitoring of Workpieces and Remaining Useful Life Prediction of Tools in Wisdom Manufacturing Workshop

Sensors ◽  
2019 ◽  
Vol 19 (23) ◽  
pp. 5254 ◽  
Author(s):  
Cunji Zhang ◽  
Xifan Yao ◽  
Wei Tan ◽  
Yue Zhang ◽  
Fudong Zhang
Keyword(s):  
Radio Frequency Identification ◽  
Life Prediction ◽  
Job Shop ◽  
Dynamic Scheduling ◽  
Job Shop Scheduling ◽  
Remaining Useful Life ◽  
Event Monitoring ◽  
Shop Scheduling ◽  
Proactive Scheduling ◽  
Useful Life

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.

Research on Strategy of Dynamic Flexible Job-Shop Scheduling

2013 ◽  
Vol 423-426 ◽  
pp. 2237-2243
Author(s):  
Ying Pan ◽  
Dong Juan Xue ◽  
Tian Yi Gao ◽  
Li Bin Zhou ◽  
Xiao Yu Xie
Keyword(s):  
Real Time ◽  
Job Shop ◽  
Dynamic Scheduling ◽  
Job Shop Scheduling ◽  
Uncertain Information ◽  
Operation Condition ◽  
Shop Scheduling ◽  
Practical Operation ◽  
Scheduling Method ◽  
Process Strategy

A dynamic scheduling method for FJSP is put forward based on real-time adjustment of controllable margin, aiming at uncertain information and dynamic characteristic during practical job-shop scheduling process. Strategy and methods of dynamic scheduling adjustment are presented, which respond to real-time event. In view of practical operation condition and accuracy demands, two methods are proposed. One is rescheduling that condenses domain, the other is scheduling updating based on adjustment. Such strategy obtains dynamic robust scheduling of FJSP to ensure the real-time of algorithm, continuity and stability of scheduling schemes.

NSGA-II applied to dynamic flexible job shop scheduling problems with machine breakdown

2018 ◽  
Vol 32 (34n36) ◽  
pp. 1840111 ◽  
Author(s):  
Chao Chen ◽  
Zhicheng Ji ◽  
Yan Wang
Keyword(s):  
Job Shop ◽  
Dynamic Scheduling ◽  
Job Shop Scheduling ◽  
Flexible Job Shop ◽  
Flexible Job Shop Scheduling ◽  
Nsga Ii ◽  
Machine Breakdown ◽  
Shop Scheduling ◽  
Multi Objective ◽  
The Impact

This paper focuses on multi-objective dynamic flexible job shop scheduling problem (MODFJSP) with machine breakdown. First, a multi-objective dynamic scheduling model is established, with objectives to minimize makespan and total machine workload. Second, according to the processing status of faulty machine, a hybrid rescheduling strategy including transfer rescheduling strategy and complete rescheduling strategy is proposed to react to stochastic machine breakdown. The performance of two rescheduling strategies is analyzed in terms of the scheduling efficiency and its stability, from the delay extent and initial scheduling deviation, respectively. Besides, the optimal adaptation conditions of both scheduling strategies are obtained. Furthermore, the non-dominated sorting genetic algorithm (NSGA-II) is employed to solve the constructed model. Experimental results demonstrate the effectiveness of the proposed strategies on reducing the impact of machine breakdown in real scheduling.

scholarly journals Dynamic flexible job shop scheduling method based on improved gene expression programming

2020 ◽  
pp. 002029402094635
Author(s):  
Chunjiang Zhang ◽  
Yin Zhou ◽  
Kunkun Peng ◽  
Xinyu Li ◽  
Kunlei Lian ◽  
...  
Keyword(s):  
Gene Expression ◽  
Job Shop ◽  
Dynamic Scheduling ◽  
Job Shop Scheduling ◽  
Gene Expression Programming ◽  
Programming Algorithm ◽  
Neighborhood Search ◽  
Flexible Job Shop ◽  
Flexible Job Shop Scheduling ◽  
Shop Scheduling

Dynamic scheduling is one of the most important key technologies in production and flexible job shop is widespread. Therefore, this paper considers a dynamic flexible job shop scheduling problem considering setup time and random job arrival. To solve this problem, a dynamic scheduling framework based on the improved gene expression programming algorithm is proposed to construct scheduling rules. In this framework, the variable neighborhood search using four efficient neighborhood structures is combined with gene expression programming algorithm. And, an adaptive method adjusting recombination rate and transposition rate in the evolutionary progress is proposed. The test results on 24 groups of instances with different scales show that the improved gene expression programming performs better than the standard gene expression programming, genetic programming, and scheduling rules.

Research on Dynamic Job Shop Scheduling Problem Base on Hybrid Genetic Algorithm

2012 ◽  
Vol 198-199 ◽  
pp. 1413-1416 ◽  
Author(s):  
Cun Liang Yan ◽  
Wei Feng Shi ◽  
Ze Ming Zou
Keyword(s):  
Genetic Algorithm ◽  
Job Shop ◽  
Dynamic Scheduling ◽  
Job Shop Scheduling ◽  
Hybrid Genetic Algorithm ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Stochastic Events ◽  
Dynamic Job Shop

In real production processing, job shop scheduling problem (JSP) is often express as dynamic scheduling problem. In this article a hybrid genetic algorithm and handling strategies are used for real job shop scheduling problem. It gives the scheduling result with the appropriate handling strategies to the stochastic events such as equipment breakdown and urgent orders. The data of Shanghai Shen Mo Die & Mold Manufacturing Co., Ltd (ShenMo) is used for the application of dynamic scheduling simulation, and the results of which show that the proposed method can satisfactorily solve the stochastic events of scheduling.

Sign in / Sign up

Export Citation Format

Share Document