教材 |
1. Industrial Scheduling, D. R. Sule, PWS, 1997. 2. Scheduling: Theory, Algorithms, and Systems, 2nd Edition, Michael Pinedo, Prentice Hall, 2000. |
Teaching Materials |
|
教學內容 |
生產排程問題之型態及複雜度分析、基本排程理論與結果、基本排程方法(最佳解法及近似解法)。 1. Classes of Scheduling Problems 2. Computational Complexity 3. General Solution Methods: (1) Optimization (Integer Programming, Network Programming, Dynamic Programming, Branch-and-bound) (2) Approximation (Dispatching Rules, Local search, Lagrangian Relaxation) 4. Single Machine Models 5. Parallel Machine Models 6. Shop Models: Flow Shops, Job Shops, and Open Shops 7. Other Scheduling Problems |
Syllabus |
1. Classes of Scheduling Problems 2. Computational Complexity 3. General Solution Methods: (1) Optimization (Integer Programming, Network Programming, Dynamic Programming, Branch-and-bound) (2) Approximation (Dispatching Rules, Local search, Lagrangian Relaxation) 4. Single Machine Models 5. Parallel Machine Models 6. Shop Models: Flow Shops, Job Shops, and Open Shops 7. Other Scheduling Problems |