Research on the Knowledge Acquirement and Updating in Dynamic Scheduling System

Author(s):  
Zhenqiang Bao ◽  
Xiangqing Li ◽  
Kaizhou Gao ◽  
Chao Wang
1995 ◽  
Author(s):  
YaoXue Zhang ◽  
GuangJie Li ◽  
Shuo Di ◽  
Hua Cheng ◽  
KangFu Cheng

2014 ◽  
Vol 933 ◽  
pp. 708-713 ◽  
Author(s):  
Yuan Huang ◽  
Xiu Tian Yan ◽  
Jing Yao Li

To solve the Dual Resource Constrained Job Shop Dynamic Scheduling Problem with heterogeneous workers (DRCJDSP-HW),a three-tier dynamic scheduling system including dynamic disturbance analysis, dynamic disturbance evaluation and dynamic scheduling method was constructed based on the idea of scheduling with local time window. To minimize the revision of old scheduling scheme in DRCJDSP-HW, a hybrid dynamic scheduling algorithm was proposed based on the chromosome reduction mechanism and the scheduling optimization of local job in stages. The outstanding application effect of the dynamic scheduling system and the hybrid dynamic scheduling algorithm were validated reducing the influence of dynamic disturbances effectively by simulation experiment at last.


2021 ◽  
Author(s):  
Wence Sui

A dynamic scheduling system for flexible manufacturing systems (FMSs) is developed. The system consists of an artificial intelligence scheduler (AIS), a simulation model, a database, and a user interface. The AIS is used to generate candidate schedules according to specified dispatching rules and to control the search depth based on the status of an FMS. The simulation model is utilized to evaluate candidate schedules. The user interface is used to manually generate candidate schedules and to facilitate communication between different modules so as to realize automatic scheduling. Schedule related data are stored in the database. A dispatching-rule-based approximation search method is employed, which can quickly converge on good areas of the solution space, and the search method is suitable for dynamic scheduling in FMSs. A hypothetic FMS is designed and an sample scheduling problem is used to demonstrate the mechanism of the scheduling system.


IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 52238-52247 ◽  
Author(s):  
Yixiong Feng ◽  
Qirui Wang ◽  
Yicong Gao ◽  
Jin Cheng ◽  
Jianrong Tan

2011 ◽  
Vol 383-390 ◽  
pp. 6236-6241
Author(s):  
Nyeoh Cheng Ying ◽  
Mohzani Bin Mokhtar

In today’s highly competitive market, laser cutting which has a characteristic of “make to order” and high product variety is under pressure to reduce costs, to increase productivity and to respond to the rapidly changing demands from customers. To maintain the competitive advantage, companies need to have a real-time dynamic scheduling system, which can handle large combinations of jobs, allowing sequencing of jobs to achieve multi-objective goals. Motivated by a real-life scheduling problem in a sheet metal processing company in Malaysia, this research addressed single machine scheduling problem with sequence-dependent setup times and group technology assumption to minimize makespan and with the secondary objective of minimizing setup times. The focus of this paper is on developing a simple heuristic algorithm based dynamic scheduling system. This algorithm has been coded in vb.net and is integrated with a database system. The scheduling system developed is verified and validated by comparing to the actual production run. Results show that the algorithm model can find good solutions within short computational time.


2009 ◽  
Vol 419-420 ◽  
pp. 101-104
Author(s):  
Dan Zhao ◽  
Jia Tai Zhang ◽  
Ling Li Li

Failure in FMS includes two aspects: equipment breakdown and tool failure of which should be considered in an excellent FMS scheduling system. Most of past scheduling researches have only discussed the former and the analysis of the latter rarely seen in relevant papers. The scheduling system without tool failure processing seems to be not coincident to the actually production in which tool breakdowns are very common. This paper gives a dynamic scheduling simulation model with concern of the two kind failure using Object-Oriented technology and Colored Petri Net (OOCPN). Rescheduling strategy of tool failure is proposed and the simulation analysis is given which shows that our model and principle are effective and adaptable to actual case.


Sign in / Sign up

Export Citation Format

Share Document