Using Constraint Programming To Solve Identical Parallel Machine Preemptive Scheduling
碩士 === 大同大學 === 資訊經營學系(所) === 92 === This research is aimed to study identical parallel machine preemptive scheduling problem. This issue was only studied with either release time or deadline in previous literatures. And that cannot fulfill the scheduling request of current production system. Theref...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2004
|
Online Access: | http://ndltd.ncl.edu.tw/handle/19884481821468266958 |