On a multiprocessor job scheduling problem

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationConference Record - Asilomar Conference on Circuits, Systems & Computers
PublisherPubl by Maple Press, Inc
Pages735-739
Number of pages5
Volume2
StatePublished - 1991
Event24th Asilomar Conference on Signals, Systems and Computers Part 2 (of 2) - Pacific Grove, CA, USA
Duration: Nov 5 1990Nov 7 1990

Other

Other24th Asilomar Conference on Signals, Systems and Computers Part 2 (of 2)
CityPacific Grove, CA, USA
Period11/5/9011/7/90

Fingerprint

Scheduling
Linear programming
Computational complexity

ASJC Scopus subject areas

  • Engineering(all)

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.

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

Conference Record - Asilomar Conference on Circuits, Systems & Computers. Vol. 2 Publ by Maple Press, Inc, 1991. p. 735-739.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sen, A 1991, On a multiprocessor job scheduling problem. in 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.
Sen A. On a multiprocessor job scheduling problem. In Conference Record - Asilomar Conference on Circuits, Systems & Computers. Vol. 2. Publ by Maple Press, Inc. 1991. p. 735-739
Sen, Arunabha. / On a multiprocessor job scheduling problem. Conference Record - Asilomar Conference on Circuits, Systems & Computers. Vol. 2 Publ by Maple Press, Inc, 1991. pp. 735-739
@inproceedings{09378b5372cb444d9f45c82eefeaa3ea,
title = "On a multiprocessor job scheduling problem",
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.",
author = "Arunabha Sen",
year = "1991",
language = "English (US)",
volume = "2",
pages = "735--739",
booktitle = "Conference Record - Asilomar Conference on Circuits, Systems & Computers",
publisher = "Publ by Maple Press, Inc",

}

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 -