| Article ID: | iaor1989513 |
| Country: | Germany |
| Volume: | 33 |
| Start Page Number: | 297 |
| End Page Number: | 313 |
| Publication Date: | Oct 1989 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Werra D. de, Cochand M., Slowinsku R. |
Some variations are presented for the preemptive scheduling problem on unrelated processors, one shows how nonrenewable resources with a time-varying supply may be taken into account in an extension of the two-phase method; phase 1 consists in solving an LP problem and phase 2 is the construction of the schedule; such a construction reduces to the determination of integral vectors in polyhedra defined by totally unimodular matrices. In special cases, this is simply a compatible flow problem.