Skip to main content
Log in

Scheduling activities among conflicting facilities to minimize conflict cost

  • Short Communication
  • Published:
Mathematical Programming Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. R.E. Beckwith, C.M. Jones and L.R. Arnold, “Scheduling the 41st ORSA meeting sessions: The ‘Visiting Fireman’ problem”, presented at the 41st ORSA national meeting, New Orleans, La., April 26–28, 1972.

  2. S. Broder, “Final examination scheduling”,Communications of the ACM 7 (8) (1964) 494–498.

    Google Scholar 

  3. R.C. Carlson and G.L. Nemhauser, “Scheduling to minimize interaction cost”,Operations Research 14 (1) (1966) 52–58.

    Google Scholar 

  4. F.E. Davis, M.D. Devine and R.P. Lutz, “Scheduling activities among conflicting facilities to minimize conflict cost”, presented at the 41st ORSA national meeting, New Orleans, La., April 26–28, 1972.

  5. W.S. Dorn, “On Lagrange multipliers and inequalities”,Operations Research 9 (1961) 95–104.

    Google Scholar 

  6. A.D. Hall, Jr. and F.S. Acton, “Scheduling university course examinations by computer”,Communications of the ACM 10 (4) (1967) 235–238.

    Google Scholar 

  7. R.P. Lutz, M.D. Devine, H.J. Kumin and W.C. Smith, “An application of operations research to school desegregation”,Management Science, Urban Issues II (December, 1972).

  8. R.V. Oakford, D.W. Allen and T. Chatterton, “School scheduling — practice and theory”.Journal of Educational Data Processing 4 (1) (1966) 16–50.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Davis, F.E., Devine, M.D. & Lutz, R.P. Scheduling activities among conflicting facilities to minimize conflict cost. Mathematical Programming 6, 224–228 (1974). https://doi.org/10.1007/BF01580238

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01580238

Keywords

Navigation