Dual Resource Constrained Job Shop Dynamic Scheduling with Local Time Window

2014 ◽  
Vol 933 ◽  
pp. 708-713 ◽  
Author(s):  
Yuan Huang ◽  
Xiu Tian Yan ◽  
Jing Yao Li
Keyword(s):  
Local Time ◽  
Job Shop ◽  
Dynamic Scheduling ◽  
Time Window ◽  
Scheduling Algorithm ◽  
Resource Constrained ◽  
Dynamic Disturbance ◽  
Scheduling System ◽  
Scheduling Method ◽  
Disturbance Analysis

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.

An Improved Ant Colony Algorithm Based Dynamic Scheduling Method in Job Shop with Parallel Machines

2012 ◽  
Vol 628 ◽  
pp. 304-309 ◽  
Author(s):  
J. Zhang ◽  
J.G. Yang ◽  
W. Qin ◽  
H. Li ◽  
Z.G. Xu
Keyword(s):  
Ant Colony Algorithm ◽  
Parallel Machines ◽  
Job Shop ◽  
Dynamic Scheduling ◽  
Job Shop Scheduling ◽  
Scheduling Algorithm ◽  
Ant Colony ◽  
Elite Strategy ◽  
Scheduling Method ◽  
The Impact

In this paper, the authors analysed the impact of machine breakdowns in job shop scheduling problem with parallel machines. A mathematical model with the objective of minimizing the weighted value of makespan and early due date was established. An improved ant colony dynamic scheduling algorithm combined with elite strategy and max-min ant mechanism was designed. Simulation experiments were designed and numerical results verified the superiority of the proposed approach.

scholarly journals ANALISA PERBANDINGAN PENJADWALAN PRODUKSI DENGAN METODE CDS (CAMPBELL DUDEK SMITH), EDD (EARLIEST DUE DATE) DAN FCFS (FIRST COME FIRST SERVE) PADA PT. SARI WARNA ASLI UNIT V

2021 ◽  
Vol 1 (2) ◽  
pp. 46-51
Author(s):  
Dwi Ayu Lestari, Vikha Indira Asri
Keyword(s):  
Production Process ◽  
Production System ◽  
Production Scheduling ◽  
Job Shop ◽  
Allocation Of Resources ◽  
Due Date ◽  
Scheduling System ◽  
Make To Order ◽  
First Come First Serve ◽  
Scheduling Method

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.

Dynamic Scheduling Model and Algorithm for Dispatching Trains in High-Speed Railway Passenger Station

2010 ◽  
Author(s):  
Yixiang Yue ◽  
Leishan Zhou
Keyword(s):  
High Speed ◽  
Large Scale ◽  
Job Shop ◽  
Dynamic Scheduling ◽  
Time Window ◽  
Real Life ◽  
Greedy Heuristic ◽  
Railway Station ◽  
High Speed Railway ◽  
Railway Passenger

Regarding the railway station tracks and train running routes as machines, all trains in this railway station as jobs, dispatching trains in high-speed railway passenger stations can be considered as a special type of Job-Shop Problem (JSP). In this paper, we proposed a multi-machines, multi-jobs JSP model with special constraints for Operation Plan Scheduling Problem (OPSP) in high-speed railway passenger stations, and presented a fast heuristic algorithm based on greedy heuristic. This algorithm first divided all operations into several layers according to the yards attributes and the operation’s urgency level. Then every operation was allotted a feasible time window, each operation was assigned to a specified “machine” sequenced or backward sequenced within the time slot, layer by layer according to its priority. As we recorded and modified the time slots dynamically, the searching space was decreased dramatically. And we take the South Beijing High-speed Railway Station as example and give extensive numerical experiment. Computational results based on real-life instance show that the algorithm has significant merits for large scale problems; can both reduce tardiness and shorten cycle times. The empirical evidence also proved that this algorithm is industrial practicable.

scholarly journals Energy-Efficient Job-Shop Dynamic Scheduling System Based on the Cyber-Physical Energy-Monitoring System

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 52238-52247 ◽  
Author(s):  
Yixiong Feng ◽  
Qirui Wang ◽  
Yicong Gao ◽  
Jin Cheng ◽  
Jianrong Tan
Keyword(s):  
Monitoring System ◽  
Energy Efficient ◽  
Job Shop ◽  
Dynamic Scheduling ◽  
Energy Monitoring ◽  
Scheduling System ◽  
Physical Energy

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).

Sign in / Sign up

Export Citation Format

Share Document