AN INTEGER PROGRAMMING APPROACH TO SCHEDULING. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT

The formulation of crew scheduling as set-partitioning of set-covering integer programs usually gives rise to integer programming problems of excessive size and computational complexity. By imposing sensible additional structure not inherent in the integer programming model, overconstrained integer programming subproblems can be formed. Optimal solutions to these subproblems can be found using reasonable computing resources, since the additional structure has a strongly integerizing effect on the associated Linear Program model. Some applications of this approach to a New Zealand metropolitan bus operation are presented.

  • Availability:
  • Supplemental Notes:
    • Papers based on presentations at the International Workshop held at the University of Leeds, 16-18 July, 1980.
  • Corporate Authors:

    Elsevier

    Radarweg 29
    Amsterdam,   Netherlands  1043 NX
  • Authors:
    • Ryan, D M
    • Foster, B A
  • Publication Date: 1981

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00482844
  • Record Type: Publication
  • ISBN: 0-444-86170-X
  • Files: TRIS
  • Created Date: Apr 30 1990 12:00AM