Parallel Machine Scheduling with Uncertain Processing times
碩士 === 國立清華大學 === 工業工程與工程管理學系 === 88 === This study solves the static unrelated parallel machine problem with uncertain processing time. We assume due date of each job is known and deterministic and the processing time of each job is normally distributed with known parameters of mean and variance ....
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2000
|
Online Access: | http://ndltd.ncl.edu.tw/handle/84310240172388294604 |