DocumentCode :
2495214
Title :
Scheduling jobs with machine-dependent processing times
Author :
Hung, Yi-Feng ; Yang, Jui-Ling
Author_Institution :
Dept. of Ind. Eng., Nat. Tsing Hua Univ., Hsinchu, Taiwan
fYear :
1996
fDate :
14-16 Oct 1996
Firstpage :
42
Lastpage :
48
Abstract :
In semiconductor manufacturing, the rapid development of manufacturing equipment allows product processing to be achieved by machines of different generations whose processing speed may be different. In this study, we propose several heuristics to schedule independent jobs on machines with different processing speeds. The scope of this research is limited to a static and deterministic problem. The scheduling objective is to minimize two due-date-related criteria: total lateness and total tardiness, respectively
Keywords :
C language; computer aided production planning; deterministic algorithms; integrated circuit manufacture; production control; semiconductor device manufacture; deterministic problem; due-date-related criteria; job scheduling; machine-dependent processing times; processing speed; product processing; semiconductor manufacturing; static problem; total lateness; total tardiness; Decision making; Industrial engineering; Job shop scheduling; Machinery production industries; Manufacturing industries; Manufacturing processes; Parallel machines; Semiconductor device manufacture; Semiconductor device testing; Single machine scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electronics Manufacturing Technology Symposium, 1996., Nineteenth IEEE/CPMT
Conference_Location :
Austin, TX
ISSN :
1089-8190
Print_ISBN :
0-7803-3642-9
Type :
conf
DOI :
10.1109/IEMT.1996.559680
Filename :
559680
Link To Document :
بازگشت