Logistics and transportation review · 1992 · 40 citations · 0 references
EngineeringDynamic Resource AllocationTransport LogisticComputer ArchitectureOperations ResearchSystems EngineeringLogisticsLogistics ModelParallel ComputingTransportation EngineeringNetwork FlowsScheduling (Computing)Computer ScienceSupply Chain ManagementMacro Level AnalysisMathematical ModelsInteger ProgrammingScheduling AnalysisScheduling ProblemBusinessScheduling (Production Processes)Parallel ProgrammingVehicle Routing ProblemResource AllocationSupply Logistics ProblemResource Optimization
This paper presents mathematical models for a macro level analysis of a supply logistics problem. The problem involves the allocation of a limited number of transport resources (assets) towards the shipment of cargo and personnel (movement requirements) between many origins and destinations within prescribed time windows. The problem has been modeled by three linear programming formulations which can be solved in a personal computer environment in a timely manner. The first and second formulations represent an explicit statement of the problem. These formulations attempt to minimize the amount of cargo which is delivered late by determining the most appropriate assets to be allocated to movement requirements in each time period. A much smaller statement of the problem is achieved in the third formulation by assuming that lateness is distributed evenly over all routes. Thus, the formulations offer a tradeoff between the degree of control to be exercised by the planner and the speed of computation. The paper presents the basic structure of these formulations along with some test results.