### 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 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

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

**On a multiprocessor job scheduling problem.** / Sen, Arunabha.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Conference Record - Asilomar Conference on Circuits, Systems & Computers.*vol. 2, Publ by Maple Press, Inc, pp. 735-739, 24th Asilomar Conference on Signals, Systems and Computers Part 2 (of 2), Pacific Grove, CA, USA, 11/5/90.

}

TY - GEN

T1 - On a multiprocessor job scheduling problem

AU - Sen, Arunabha

PY - 1991

Y1 - 1991

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0026396404&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026396404&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0026396404

VL - 2

SP - 735

EP - 739

BT - Conference Record - Asilomar Conference on Circuits, Systems & Computers

PB - Publ by Maple Press, Inc

ER -