skip to main content
article

A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis

Published:31 December 2001Publication History
Skip Abstract Section

Abstract

We describe a program that schedules physician attending teams at Denver Health Medical Center. The program uses network flow techniques to prune an exponentially sized search space. We describe the program design, its performance history at the hospital, and experiments on a simplified version of the program.

Skip Supplemental Material Section

Supplemental Material

References

  1. 1 Dimacs implementation challenges. ftp://dimacs.rutgers.edu/pub/challenge.Google ScholarGoogle Scholar
  2. 2 R.K. Ahuja, T.L.Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 A. Itai, M. Rodesh, and S.L. Tanimoto. Some matching problems for bipartite graphs. J. ACM, 25(4):517-525, 1978. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 T. Kohno. Experiments on an exhaustive search algorithm. University of Colorado Undergraduate Thesis, 1999.Google ScholarGoogle Scholar

Index Terms

  1. A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in

              Full Access

              • Published in

                cover image ACM Journal of Experimental Algorithmics
                ACM Journal of Experimental Algorithmics  Volume 6, Issue
                2001
                313 pages
                ISSN:1084-6654
                EISSN:1084-6654
                DOI:10.1145/945394
                Issue’s Table of Contents

                Copyright © 2001 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 31 December 2001
                Published in jea Volume 6, Issue

                Qualifiers

                • article

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader