Logo Logo

An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks, Operations Research

Abstract

This paper investigates the assignment of tasks in a network of functionally similar computers. We formulate the problem by a periodic review model with Boolean variables. A computationally efficient, integer-generalized transportation model is applicable because of the existence of relative efficiencies of computers for jobs. Since a lob is to be processed exclusively by one computer, we show that an optimal solution to this problem is a basic feasible solution to a slightly modified generalized transportation problem. A branch- and-bound solution procedure prevents possible splitting of a job among computers. We provide an algorithm and computational results.

Type

Article

Author(s)

Bala Balachandran

Date Published

1976

Citations

Balachandran, Bala. 1976. An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks. Operations Research. 24(4): 742-759.

KELLOGG INSIGHT

Explore leading research and ideas

Find articles, podcast episodes, and videos that spark ideas in lifelong learners, and inspire those looking to advance in their careers.
learn more

COURSE CATALOG

Review Courses & Schedules

Access information about specific courses and their schedules by viewing the interactive course scheduler tool.
LEARN MORE

DEGREE PROGRAMS

Discover the path to your goals

Whether you choose our Full-Time, Part-Time or Executive MBA program, you’ll enjoy the same unparalleled education, exceptional faculty and distinctive culture.
learn more