Application of genetic algorithms and rules in the scheduling of flexible job shops

被引：0
作者：
Butt, Shahid Ikramullah [1 ,2 ]
Sun, Hou-Fang [1 ]
机构：
[1] Department of Manufacturing and Automation (3rd School), Beijing Institute of Technology, Haidian District, Beijing 100081
[2] National University of Sciences and Technology, Rawalpindi
来源：
Journal of Applied Sciences | 2006年 / 6卷 / 07期
关键词：
Flexible job shop; Genetic algorithms; Scheduling; Scheduling rules;
D O I：
10.3923/jas.2006.1586.1590
中图分类号：
学科分类号：
摘要：
Different methods have been in use for small and large size problems to find out a specific objective function or performance measure such as Makespan. The problem presented in the research is a case study of BIT (Beijing Institute of Technology) Training Workshop, which is the best example of a Flexible Job Shop, considered a special case of job shop scheduling problem. Genetic algorithm is employed in combination with the scheduling rules to solve the scheduling problem with an option of recirculation. Development of software is done to do an offline scheduling. Results of scheduling software are presented for the flexible job shop environment using MT10 and MT20 as benchmark problems. Comparison with LEKIN® software results is also done with the developed software to show that this is practical software and can be used successfully at BIT Training Workshop. © 2006 Asian Network for Scientific Information.
引用
收藏
页码：1586 / 1590
页数：4
相关论文
共 13 条
  • [1] Baker K.R., Introduction to Sequencing and Scheduling, (1974)
  • [2] Barnes J.W., Chambers J.B., Solving the job shop scheduling problem using tabu search, IIE Transactions, 27, pp. 257-263, (1995)
  • [3] Blackstone Jr. J.H., Philips T.D., Hogg G.L., A state-of-the-art survey of dispatching rules for manufacturing job shop operations, Intl. J. Prod. Res., 20, pp. 27-45, (1982)
  • [4] Chambers J.B., Barnes J.W., New tabu search results for the job shop scheduling problem, (1996)
  • [5] Chambers J.B., Barnes J.W., Flexible job shop scheduling by tabu search, (1996)
  • [6] Chambers J.B., Barnes J.W., Tabu search for the flexible-routing job shop problem, (1996)
  • [7] David W.S., A survey of approaches to the job shop scheduling problem, Proceedings of the Twenty-Eighth Southeastern Symposium on System Theory, 31, pp. 396-400, (1996)
  • [8] Goldberg D.E., Genetic Algorithms in Search, Optimization and Machine Learning, (1989)
  • [9] Kumar N.S.H., Srinivasan G., A genetic algorithm for job shop scheduling-A case study, Computers in Industry, 31, pp. 155-160, (1996)
  • [10] Lagewag B.J., Lenstra J.K., Kan R., Job shop scheduling by implicit enumeration, Manage. Sci., 24, pp. 441-450, (1977)
12