DocumentCode
1973043
Title
An iterative refining mechanism for general job shop scheduling problems
Author
Chiang, Tsung-Che ; Fu, Li-Chen
Author_Institution
Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan
fYear
2005
fDate
1-2 Aug. 2005
Firstpage
203
Lastpage
208
Abstract
This paper addresses the general job shop scheduling problem with the objective as how to increase the meet-due-date rate. An iterative schedule refining mechanism is proposed, which iteratively adjusts the estimation of the remaining processing times of jobs in a dynamic and stage-specific manner. The refining mechanism is applied to a recently proposed sequencing heuristic and the integrated approach shows satisfactory performance through a comprehensive simulation study. Besides, we also show that the proposed refining mechanism can bring much improvement to several conventional rules.
Keywords
iterative methods; job shop scheduling; general job shop scheduling problems; iterative refining mechanism; meet-due-date rate; processing time estimation; Computer industry; Computer science; Customer satisfaction; Diversity reception; Dynamic scheduling; Job shop scheduling; Pervasive computing; Processor scheduling; Production; Semiconductor device manufacture;
fLanguage
English
Publisher
ieee
Conference_Titel
Automation Science and Engineering, 2005. IEEE International Conference on
Print_ISBN
0-7803-9425-9
Type
conf
DOI
10.1109/COASE.2005.1506769
Filename
1506769
Link To Document