Paper Title:
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.

  Info
Periodical
Edited by
Wenya Tian and Linli Xu
Pages
636-639
DOI
10.4028/www.scientific.net/AMR.186.636
Citation
Y. Cao, J. Du, "An Improved Simulated Annealing Algorithm for Real-Time Dynamic Job-Shop Scheduling", Advanced Materials Research, Vol. 186, pp. 636-639, 2011
Online since
January 2011
Authors
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Zhi Qiang Xie, Jing Yang, Yu Jing He, Guang Jie Ye
Abstract:Aiming at the dynamic integrated scheduling problem of complex multi-products with different arriving time and identical machines, an...
897
Authors: Bei Zhan Wang, Xiang Deng, Wei Chuan Ye, Hai Fang Wei
Chapter 13: Mechanical Control and Information Processing Technology
Abstract:The particle swarm optimization (PSO) algorithm is a new type global searching method, which mostly focus on the continuous variables and...
1787
Authors: Fang Li, Yu Wang, Ying Chun Zhong, Zhi Tan
Chapter 16: Application of Information and Network Technology
Abstract:An optimization of multi-varieties and small-batch of production scheduling is proposed, which is embodied the utilization ratio of...
3177
Authors: Hai Yan Wang
Chapter 6: Production Management
Abstract:This paper presents a hybrid algorithm to address the flexible job-shop scheduling problem (FJSP). Based on Differential Evolution (DE), a...
502
Authors: Sun Xin Wang, Yan Li, Yan Rong Zhang
Chapter 15: Economics, Marketing and Engineering Management
Abstract:In this paper a hybrid algorithm named IPSO-VND is proposed and applied to solving the vehicle routing problem with simultaneous pickup and...
2326