NETWORK SCHEDULING LIMITED BY SPECIAL CONSTRAINT AS A FUNCTION OF TIME COST

Abstract

The paper deals with the application of mathematical programming techniques to network analysis and network management in general. The authors show the application of linear programming to network scheduling when the problem is to minimize the total crashing cost and the required completion time is given. Finally the application of goal programming is presented in network scheduling in tha case, when all kinds of constraints (time, resource, etc.) are introduced into the problem and the manager has to deal with multiple objectives which may be in conflict. All kinds of network scheduling problems mentioned above are illustrated through a detailed numerical example.