반도체 제조공정을 위한 새로운 생산일정 알고리즘A New Scheduling Algorithm for Semiconductor Manufacturing Process

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 521
  • Download : 1730
A new scheduling algorithm for large scale semiconductor processes is addressed. The difficulties of scheduling for semiconductor fabrication processes are mainly due from repeating production of wagers that experience reentrant flows. Sequence branch algorithm (SBA) is proposed for large real scheduling problems when all processing times are deterministic. The SBA is vased on the reachability graph of Petri net of which the solution deviating a little from the optimal solution of mized integer programming, it is adjustable for large size scheduling provlems. Especially, it shows a potential that is capable of handling commercial size problems that are intractable with mathmatical programming.
Publisher
제어자동화시스템공학회
Issue Date
1998-12
Keywords

semiconductor scheduling; sequence branch algorithm; SBA

Citation

Journal of Control, Automation and Systems Engineering, Vol.4, No.6

URI
http://hdl.handle.net/10203/25296
Appears in Collection
CBE-Journal Papers(저널논문)
Files in This Item
19.pdf(870.87 kB)Download

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0