outline LED n Scheduling Problem n Problem Formulation

outline LED封裝流程 n Scheduling Problem n Problem Formulation n 演算法最佳化求解 n 結語 n Reference n

Literature Problem formulation Total make-span: (1) δ = the min. difference between the start time of the two jobs A sequence｛p(1), p(2), p(3), ……. p (n)｝

Definition: A sequence can always start from job 0, end at jobn+1 Objective function of the problem: For total flow time:

Tardiness: To minimize tardiness:

Reference n n n F. T. S. C. CHAN, T. C. WONG AND L. Y. CHAN, Flexible_jobshop_scheduling_problem_under_resource, International Jouurnal of Production Reserch, June, 2006 Akhilesh Kumar, Anuj Prakash, Ravi Shanker, M. K. Tiwari, Psycho. Clonal algorithm based approach to solve continuous flow shop scheduling problem, Expert System with Applications, 2006 Ruey-Maw, Shih-Tang Lo, Yueh-Min Huang, Combining competitive scheme with slack neurons to solve real-time job scheduling problem, Expert System with Applications, 2007