### Abstract

A multiprocessor job scheduling problem is discussed. The scheduling problem has been transformed into a graph partitioning problem. It has been shown that for a general graph the problem is NP-complete. An integer linear programming formulation is given for the graph partitioning problem. The scheduling problem can then be solved using one of the several methods for solving integer linear programming problems. A linear time algorithm is also given for the case when the graph is a tree. This problem is a generalization of the chromatic sum problem.

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

Title of host publication | Conference Record - Asilomar Conference on Circuits, Systems & Computers |

Publisher | Publ by Maple Press, Inc |

Pages | 735-739 |

Number of pages | 5 |

Volume | 2 |

State | Published - 1991 |

Event | 24th Asilomar Conference on Signals, Systems and Computers Part 2 (of 2) - Pacific Grove, CA, USA Duration: Nov 5 1990 → Nov 7 1990 |

### Other

Other | 24th Asilomar Conference on Signals, Systems and Computers Part 2 (of 2) |
---|---|

City | Pacific Grove, CA, USA |

Period | 11/5/90 → 11/7/90 |

### ASJC Scopus subject areas

- Engineering(all)

## Fingerprint Dive into the research topics of 'On a multiprocessor job scheduling problem'. Together they form a unique fingerprint.

## Cite this

Sen, A. (1991). On a multiprocessor job scheduling problem. In

*Conference Record - Asilomar Conference on Circuits, Systems & Computers*(Vol. 2, pp. 735-739). Publ by Maple Press, Inc.