Static and Dynamic Assignment Models with Multiple Objectives, and Some Remarks on Organization Design

Abstract

The assignment model of linear programming is here extended to allow for vector optimizations and dynamic interactions between assigned personnel and positions in each of which a variety of possible measures and approaches are explored. Formulations involving people-to-people as well as people-to-position matchings are also examined from the standpoint of organizations in which jobs may be fitted to people or vice versa as well as in weighted combinations. Possible uses of such models for dealing with the problems of placing disadvantsged or handicapped persons are noted, but the analysis stops short of the still further possibilities offered by new types of machine-technology and information systems designs.

Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems

“…2 ) shown in Figure l(d). (6) The cycle r is shown in Figure l(c) as ((3, 3), (3,4), (2,4), (2,3) ) so that rl= ((3, 4), (2,3 ) ) .…”

“…(4) The set of rows that are connected to row 2 in B1 without using (2,3) are ZR= (2,3 ) . Similarly the set of columns connected to column 3 in B1 without using (2,3) are Jc= (1, 3 ) so t h a t $= ( ( 2 , l ) , (3, l), (3, 3 ) ) . 2 ) shown in Figure l(d).…”

“…Similarly the set of columns connected to column 3 in B1 without using (2,3) are Jc= (1, 3 ) so t h a t $= ( ( 2 , l ) , (3, l), (3, 3 ) ) . 2 ) shown in Figure l(d). (6) The cycle r is shown in Figure l(c) as ((3, 3), (3,4), (2,4), (2,3) ) so that rl= ((3, 4), (2,3 ) ) .…”

“…$ = ( e , f ) = ( ( 2 , 2 ) C3z3 is increased to 9 and 6=5. (6) r= ( (2, a), (3,2), (3,4), (2,4 ) ) (Figure l(e)). 1, 3)).…”

“…If there is no such cell set k=k+l and go to (2). Otherwise choose the cell ( p , q) with the largest x,, (Break ties in any arbitrary way.).…”