### Abstract

For a number of NP-complete sequencing problems [C], the worst-case performance of heuristics has been bounded relative to optimal performance. The bounds are usually shown to be best in the sense that they are achievable. However, when these bounds are based on a single, pathological example, they are not as informative as might be desired. Such is largely the case with Graham's bound [G] of 4/3- 1/3m on the performance of largest-processing-time- first (LPT) sequencing for the classical problem of minimizing schedule lengths, assuming independent tasks on m ≥ 2 identical processors.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the 1976 ACM SIGMETRICS Conference on Computer Performance Modeling Measurement and Evaluation, SIGMETRICS 1976 |

Publisher | Association for Computing Machinery, Inc |

Pages | 306-310 |

Number of pages | 5 |

DOIs | |

State | Published - Mar 29 1976 |

Externally published | Yes |

Event | 1976 ACM SIGMETRICS Conference on Computer Performance Modeling Measurement and Evaluation, SIGMETRICS 1976 - Cambridge, United States Duration: Mar 29 1976 → Mar 31 1976 |

### Other

Other | 1976 ACM SIGMETRICS Conference on Computer Performance Modeling Measurement and Evaluation, SIGMETRICS 1976 |
---|---|

Country | United States |

City | Cambridge |

Period | 3/29/76 → 3/31/76 |

### ASJC Scopus subject areas

- Software
- Hardware and Architecture
- Computer Networks and Communications
- Computational Theory and Mathematics

## Fingerprint Dive into the research topics of 'A generalized bound on Lpt sequencing'. Together they form a unique fingerprint.

## Cite this

Coffman, E. G., & Sethi, R. (1976). A generalized bound on Lpt sequencing. In

*Proceedings of the 1976 ACM SIGMETRICS Conference on Computer Performance Modeling Measurement and Evaluation, SIGMETRICS 1976*(pp. 306-310). Association for Computing Machinery, Inc. https://doi.org/10.1145/800200.806205