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

Cun Liang Yan; Wei Feng Shi; Ze Ming Zou

doi:10.4028/www.scientific.net/AMM.198-199.1413

Paper Titles

Shortest Travel Path Searching System Based on Dijkstra Algorithm
p.1395

Orthogonal Wavelet Transform Blind Equalization Algorithm Based on the Optimization of Artificial Fish Swarm Algorithm
p.1399

A Kind of Improved SPRINT Classification Algorithm Adaptive to the Change of Concept Drift
p.1403

The Study of Coded CPM Schemes
p.1408

Research on Dynamic Job Shop Scheduling Problem Base on Hybrid Genetic Algorithm
p.1413

The Time Synchronization Analytical Study of the Dynamical Multi-Agent
p.1417

Research on Vehicle Optimization Scheduling of Highway Transportation in Logistics Industry Based on GA
p.1422

Study on Algorithm of Same Judgment on Nonlinear Boolean Functions’ Logical Expressions Structure
p.1428

Applications of the Genetic Algorithm with Steepest Descent Algorithm on Analyzing the Gauss-Type Overlapped Peaks
p.1432

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 198-199Research on Dynamic Job Shop Scheduling Problem...

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

Abstract:

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.

You might also be interested in these eBooks

Applied Mechanics, Mechatronics Automation & System Simulation

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 198-199)

Pages:

1413-1416

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.198-199.1413

Citation:

Cite this paper

Online since:

September 2012

Authors:

Cun Liang Yan, Wei Feng Shi, Ze Ming Zou

Keywords:

Dynamic Scheduling, Genetic Algorithm (GA), Job Shop Scheduling, Manufacture Execution System

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] V. Vinod and R. Sridharan, Dynamic job-shop scheduling with sequence-dependent setup times: Simulation modeling and analysis, International Journal Of Advanced Manufacturing Technology Vol. 36 (2008), pp.355-372.

DOI: 10.1007/s00170-006-0836-4

Google Scholar

[2] A. Rajabinasab and S. Mansour, Dynamic flexible job shop scheduling with alternative process plans: An agent-based approach, International Journal Of Advanced Manufacturing Technology Vol. 54 (2011), pp.1091-1107.

DOI: 10.1007/s00170-010-2986-7

Google Scholar

[3] A. Singh, N. K. Mehta and P. K. Jain, Multicriteria dynamic scheduling by swapping of dispatching rules, International Journal Of Advanced Manufacturing Technology Vol. 34 (2007), pp.988-1007.

DOI: 10.1007/s00170-006-0674-4

Google Scholar

[4] J. Jiang, M. Wen, K. Ma, X. Long and J. Li, Hybrid genetic algorithm for flexible job-shop scheduling with multi-objective, Journal of Information and Computational Science Vol. 8 (2011), pp.2197-2205.

Google Scholar

[5] P. Chen and S. M. Shahandashti, Hybrid of genetic algorithm and simulated annealing for multiple project scheduling with multiple resource constraints, Automation In Construction Vol. 18 (2009), pp.434-443.

DOI: 10.1016/j.autcon.2008.10.007

Google Scholar

[6] C. Yan, W. Shi and R. Zhao, Research on parallel hybrid genetic algorithm based on multi-group in job shop scheduling, Advanced Materials Research Vol. 482-484 (2012), pp.2227-2233.

DOI: 10.4028/www.scientific.net/amr.482-484.2227

Google Scholar