An Improved Simulated Annealing Algorithm for Real-Time Dynamic Job-Shop Scheduling

Yan Cao; Jiang Du

doi:10.4028/www.scientific.net/AMR.186.636

Paper Titles

Research on Joint Scheduling of Multiple Imaging Satellites with Multiple Sensors
p.616

A Novel Personalized Filtering Recommendation Algorithm Based on Collaborative Tagging
p.621

A Genetic Algorithm for Solving Linear-Quadratic Bilevel Program-Ming Problems
p.626

P2P Mapping Creation by Semantic Discovering and Mapping
p.631

An Improved Simulated Annealing Algorithm for Real-Time Dynamic Job-Shop Scheduling
p.636

Concurrent Hierarchical Model and Analysis Based on Fuzzy-Timing Petri Net
p.640

Research on Bounding Box-Tree Algorithm for Collision Detection
p.645

Analysis and Proof for Convergence Region of Vision Iterative Method
p.650

A Improved Routing Algorithm for MAODV Based on Path Stability
p.655

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 186An Improved Simulated Annealing Algorithm for...

An Improved Simulated Annealing Algorithm for Real-Time Dynamic Job-Shop Scheduling

Abstract:

Job-shop scheduling is one of the core research aspects of Manufacturing Execution System (MES). It is significant for improving the utilization of enterprise resources, enhancing product quality, shortening delivery periods, reducing product cost, and raising enterprise competitive power in market economy. In order to solve this problem, Simulated Annealing (SA) algorithm is improved to solve large-scale combinatorial problem of job-shop scheduling. To make the SA algorithm more effective to solve job-shop scheduling problems, a solution encoding mode, scheduling scheme generation, initial temperature selection, temperature updating function, Markov chain length, end rule, and so on of the improved SA algorithm are discussed that affect the computation speed and convergence of the SA algorithm. Finally, the improved SA algorithm is validated by a job–shop scheduling problem of 10 workpieces and 10 machines.

You might also be interested in these eBooks

New Trends and Applications of Computer-aided Material and Engineering

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 186)

Pages:

636-639

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.186.636

Citation:

Cite this paper

Online since:

January 2011

Authors:

Yan Cao, Jiang Du

Keywords:

Combinatorial Optimization, Job Shop Scheduling, MES, Simulated Annealing Algorithm

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Y.Q. Rao, S.P. Liu, S.X. Li, and P.G. Li: Research on Agile Manufacturing Execution System in Shop Floor, China Mechanical Engineering Vol. 13 (2002), pp.654-656.

Google Scholar

[2] D.W. Wu, T.D. Lu, X.B. Liu and Y.S. Meng: Parallel Simulated Annealing Algorithm for Solving Job-Shop Scheduling Problem, Computer Integrated Manufacturing Systems Vol. 11 (2005), pp.847-850.

Google Scholar

[3] L.H. Zhao and F.Q. Deng: Improved Simulated Annealing Algorithm for Job Shop Schedule, Computer Engineering Vol. 32 No. 21 (2006), pp.38-40.

Google Scholar

[4] L.H. Zhao and F.Q. Deng: A Simulated Annealing Algorithm on Solving Job Shop Scheduling Problem, Manufacturing Automation Vol. 28 No. 3 (2006), pp.10-12, 23.

Google Scholar

[5] X. Liang, M. Huang and Z. Chang: New Genetic Annealing Hybrid Strategy for Job-Shop Scheduling Problem, Computer Integrated Manufacturing Systems Vol. 11 (2005), pp.851-854.

Google Scholar