DocumentCode :
2611031
Title :
Scheduling multiple orders with preemptive jobs and resource dependence times
Author :
Chuang, S.P. ; Hsu, T.S. ; Yang, C.L.
Author_Institution :
Nat. Taiwan Univ. of Sci. & Technol., Taipei
fYear :
2007
fDate :
2-4 Dec. 2007
Firstpage :
1148
Lastpage :
1152
Abstract :
Scheduling with preemptive jobs and resource dependence times is a problem that operation managers face everyday, and the computational complexity of the problem also limits the solution techniques available. A proposed scheduling model, which integrates simulation, genetic algorithms and decision support tools, is to solve the scheduling problem with preemptive jobs and resource dependence times involving multiple orders on multiple operation stages. The objective of this study is to seek the minimum total tardiness of overall orders, and three subordinate objectives are also considered for making decisions in operation management. A numerical example is solved to illustrate the proposed model. The results demonstrate better performance than is achieved using several popular dispatching rules.
Keywords :
genetic algorithms; order processing; scheduling; computational complexity; decision support tool; genetic algorithm; minimum total tardiness; operation management; order scheduling; preemptive job scheduling; resource dependence times; Computational complexity; Computational modeling; Dispatching; Environmental management; Genetic algorithms; Job shop scheduling; Processor scheduling; Resource management; Single machine scheduling; Technology management; Resource allocation; scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Industrial Engineering and Engineering Management, 2007 IEEE International Conference on
Conference_Location :
Singapore
Print_ISBN :
978-1-4244-1529-8
Electronic_ISBN :
978-1-4244-1529-8
Type :
conf
DOI :
10.1109/IEEM.2007.4419372
Filename :
4419372
Link To Document :
بازگشت