haku: @indexterm ALGORITHMS / yhteensä: 403
viite: 112 / 403
| Tekijä: | Dondeti, V. R. Emmons, H. |
| Otsikko: | Fixed job scheduling with two types of processors |
| Lehti: | Operations Research
1992 : JAN-FEB, VOL.40:SUP.1, p.S76-S85 |
| Asiasana: | JOB-SHOP SCHEDULING ALGORITHMS NETWORKS COST REDUCTION |
| Kieli: | eng |
| Tiivistelmä: | The scheduling problem considered in the article involves two types of processors , but three types of jobs. Each job has a fixed start time and a fixed completion time, and falls into one of three types. Jobs of the type-1 can be done only by type-1 processors, type-2 jobs only by type-2 processors, and type-0 jobs by either type of processors. A polynomial algorithm is presented for finding the minimal cost combination of the two types of processors required to complete all jobs. The steps of the algorithm consist of constructing a job schedule network, transforming it into a single-commodity flow problem and finding the maximal flow through it. |
SCIMA