Time Priority Based Resource Leveling for Shifting Bottleneck Procedure

• Main Authors: Tai-ying Chiang, 江岱穎
• Other Authors: Chih-Sen Wu
• Format: Others
• Language: zh-TW
• Published: 2007
• Online Access: http://ndltd.ncl.edu.tw/handle/68428956325040824506

碩士 === 國立成功大學 === 工業與資訊管理學系碩博士班 === 95 === Solutions for Job Shop Scheduling problems are in most demand in production systems. Job Shop has high production variability and usually applies to special products. It is difficult to solve the scheduling problems because of a variety of products passed through different sequences of machines and operations. The Shifting Bottleneck Procedure is one of effective heuristic algorithms to resolve Job Shop Scheduling problems. The main purpose of this research is to obtain minimum makespan for Job Shop Scheduling problems using Modified Shifting Bottleneck Procedure and Resource Leveling technique, combined with several time-priority indexes. The study shows that this approach can improve scheduling results.