Paper Title:
A Three-Fold Approach to Solve Dynamic Job Shop Scheduling Problems by Artificial Immune Algorithm
  Abstract

This paper aims to propose a novel three-fold approach to solve dynamic job-shop scheduling problems by artificial immune algorithm. The proposed approach works in three phases. Firstly, priority rules are deployed to decrease problem scale instead of using scheduling algorithms directly. Secondly, immune algorithm is applied to optimize the individual scheduling modules. Finally, integration schema is employed to reschedule operations and minimize makespan of gross schedule. The integration schema is carried out in a dynamic manner that the previous modules’ machine idle time is searched continuously. In this way, the machine utilization is increased while the objective of makespan minimization is maintained. Efficacy of the proposed approach has been tested with test instances of job-shop scheduling problems. The experimentation results clearly show effectiveness of the proposed approach.

  Info
Periodical
Advanced Materials Research (Volumes 139-141)
Edited by
Liangchi Zhang, Chunliang Zhang and Tielin Shi
Pages
1666-1669
DOI
10.4028/www.scientific.net/AMR.139-141.1666
Citation
S. S. Wu, B. Z. Li, J. G. Yang, "A Three-Fold Approach to Solve Dynamic Job Shop Scheduling Problems by Artificial Immune Algorithm", Advanced Materials Research, Vols. 139-141, pp. 1666-1669, 2010
Online since
October 2010
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: Shi Jin Wang
Abstract:Classical flexible job-shop scheduling problem (FJSP) does not consider the transportation time of jobs movement among different machines,...
2440
Authors: Hong Zhan, Jian Jun Yang, Lu Yan Ju
Abstract:This paper presents an improved genetic algorithm for the job shop scheduling problem. We designed a new encoding method based on operation...
4212
Authors: Parinya Kaweegitbundit
Chapter 5: Monitoring and Control of the Manufacturing Process
Abstract:This paper considers flow shop scheduling problems with sequence dependent setup time. The makespan criterion has been considered. In this...
332
Authors: Guo Hui Zhang
Abstract:The multi objective job shop scheduling problem is well known as one of the most complex optimization problems due to its very large search...
245
Authors: Dan Tang, Hong Ping Shu
Chapter 2: Management and Production Scheduling
Abstract:For the flow shop scheduling problem which aims to minimize makespan, this paper gives a new derivation about its mathematical definition,...
528