Scheduling preemptive jobs to specific time intervals of uniform parallel machines
碩士 === 國立交通大學 === 工業工程與管理系所 === 103 === We consider the scheduling problem of uniform parallel machines with preemptive jobs, where machines have specific available time intervals. Our study considers arbitrary time intervals, Integer and Rational job processing time, and then formulates the Mixed...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/5h4na3 |