A MAXIMUM UTILITY SOLUTION TO A VEHICLE CONSTRAINED TANKER SCHEDULING PROBLEM

Abstract

A modification to the Dantzig and Fulkerson tanker scheduling problem is described. An insufficient number of vehicles and a utility associated with each vehicle delivery are assumed. The new problem is shown to be equivalent to a transshipment problem, the solution of which is the same as the maximal utility solution of the modified tanker scheduling problem. An example is given.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1968
Accession Number
AD0684708

Entities

People

  • Gerald Bennington
  • M. Bellmore
  • Stephan Lubore

Organizations

  • MITRE Corporation

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Construction
  • Contracts
  • Corporations
  • Linear Programming
  • Network Science
  • Notation
  • Numbers
  • Parametric Analysis
  • Rational Numbers
  • Scheduling (Production)
  • Security
  • Shipping
  • Transportation
  • Travel Time

Readers

  • Naval Architecture and Marine Engineering.
  • Operations Research