Abstract
Presents a mathematical justification of the technique of force-directed scheduling and propose two modifications of the basic algorithm introduced by Paulin and Knight. The newly presented modifications improve the effectiveness of force-directed scheduling without affecting its time complexity. This is illustrated by an empirical performance analysis based on a number of problem instances
Original language | English |
---|---|
Publisher | Institute of Electrical and Electronics Engineers ( IEEE ) |
Number of pages | 6 |
Place of Publication | Piscataway |
DOIs | |
Publication status | Published - 1991 |
Externally published | Yes |