113年第2學期-5568 排程方法論 課程資訊

評分方式

評分項目 配分比例 說明
平時成績 20
Literature review presentation 35
Final project presentation 45

選課分析

本課程名額為 70人,已有0 人選讀,尚餘名額70人。
本課程可網路登記,目前已登記人數為 2 人,選上機率為99.9%




登入後可進行最愛課程追蹤 [按此登入]。

授課教師

藍坤銘

教育目標

本課程將使學生瞭解排程基本理論及其應用,課程內容包含確定性和不確定性排程中的單機、多機平行機台、多機非平行機台、零工型、流線型和開放型排程、以及常用的派工法則與萬用啟發式演算法,如模擬退火法、塔布搜尋法、基因演算法和螞蟻演算法等,並以程式實作讓學生撰寫實際排程問題,使學生具備求解實務問題的能力。 Scheduling consists of planning and prioritizing activities that need to be performed in an orderly sequence of operations. It is a tool that optimizes use of available resources. Scheduling leads to increased efficiency and capacity utilization, reducing time required to complete jobs and consequently increasing the profitability of an organization. The purpose of this course is to help students gain a comprehensive view of scheduling problems and the technique of problem analysis. Students should learn the basic models of scheduling problems and their applications in various types of areas. Main goals of this course 'Theory of Scheduling': help students get knowledge of basic model in scheduling theory; get knowledge on basic solution techniques for models; and learn about application of scheduling models.

課程資訊

參考書目

Pinedo, Michael, Scheduling Theory, Algorithms, and Systems, Springer, 4th edition, 2012.
相關論文文獻與自製教材

開課紀錄

您可查詢過去本課程開課紀錄。 排程方法論歷史開課紀錄查詢