成本与价格的比较.ppt

排程 排程 定義：決定工作完成日期，以及所需的任務和活動 排程可以協助準時完成 直接影響顧客的價值屬性 排程可以影響資源的利用率 直接影響生產率 前推排程 用於起始日期已知，欲決定完成日期的方法 回溯排程 完成日期或截止日期已知，再決定起始日期 排程 甘特圖 在一個工作流程中各個步驟的佈置 單一資源中分別進行多個工作 傳統工作排序法 排序法則：在單一資源下安排多個工作的方法 先到先服務 最早截止日期(EDD) 工作截止時間最早的優先處理 最短處理時間(SPT) 工作處理時間最短的優先處理 關鍵比例(CR) 計算剩餘時間與完成工作所需時間的比例 比例愈小愈先執行的排序法則 CR 1 表示工作無法準時完成 範例 8.1：採用 EDD 的工作排序(1/2) 範例 8.1：採用 EDD 的工作排序(2/2) 範例 8.2：採用 SPT 的工作排序 範例 8.3：採用 CR 的工作排序 Scheduling hybrid flow shops with parallel batch, release time, and machine eligibility constraints I-Lin Wang*, Yu-Bang Chang** and Taho Yang** *Department of Industrial and Information Management, National Cheng Kung University, Taiwan **Institute of Manufacturing Engineering National Cheng Kung University, Taiwan Introduction Background The case in this research a 12-inch semiconductor Fab in Tainan Technology Park, Taiwan Semiconductor Industry The most important industry of Taiwan Competitive and cutting-edge technology Scheduling Improve efficiency in semiconductor production Problem Definition There two types of process in manufacturing Serial：If a job contains 25 wafers, a serial process will deal with the wafers one by one till all of them are done, and then proceed to the next machine. Batch：a batch process can deal with 2 to 6 jobs with the same recipe at the same time. (In this research, the machines at the second stage can manufacture 2 jobs simultaneously.) Problem Definition Solution Methods Mixed Integer Liner Programming (MIP) Model Exact optimal solution Time consuming Usually not feasible for real-world applications Heuristics Good solution Efficient No guarantee on solution quality Mixed Integer Programming Models Decision variables in the model Mixed Integer Programming Models Objective Constrains Mixed Integer Programming Models constrains Mixed Integer Programming Models Problem Scale（job=J, machine=M） The number of decision variables： The number of constrains： Skills to Reduce Variables Prob