Time Priority Based Resource Leveling for Shifting Bottleneck Procedure
碩士 === 國立成功大學 === 工業與資訊管理學系碩博士班 === 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 t...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2007
|
Online Access: | http://ndltd.ncl.edu.tw/handle/68428956325040824506 |