Skip to main content
SpringerLink
Log in

Some Extensions of Akers-Friedman Production Scheduling Problem

  • Conference paper
Book cover Symposium on the Theory of Scheduling and Its Applications

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 86))

  • 118 Accesses

Abstract

The paper introduces a general solution methodology for the deterministic N jobs and M machines scheduling-sequencing problems. In particular, the logical constraints of the problem are transformed into a set of Boolean equations. The reduced set of dominant programs are determined by the solution of these Boolean equations. The optimal program is selected from among these dominant programs.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akers, Jr., S.E. and J. Friedman, “A Non-numerical Approach to Production Scheduling Problems”, Operations Research Journal, Vol. III, 429–442, (1955).

    Article  Google Scholar 

  2. Akers, Jr., S.E., “A Graphical Approach to Production Scheduling Problems”, Operations Research Journal Vol. 4, No.2, 244–245, (1956).

    Article  Google Scholar 

  3. Szwarc, W., “Solution of the Akers-Friedman Scheduling Problem”, Operations Research Journal, Vol. 8, No.6, (1960).

    Google Scholar 

  4. Turksen, I.B., “Boolean Transformation in a Scheduling Model”, M.S. Thesis, University of Pittsburgh, 1962.

    Google Scholar 

  5. Holzman, A.G., and I.B. Turksen, “Boolean Isomorphic Structures in an Educational Scheduling Model”, Monograph No. 1. The Automation of School Information System, Edited by Don D. Bushnell, System Development Corporation, Department of Audio Visual Instruction of the National Education Association of U.S.A., 1964, Chapter 2, pp. 43–48.

    Google Scholar 

  6. Turksen, I.B., “The Set of Solutions for the Boolean Equations”, Discrete Mathematics (to appear).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, University of Toronto, Toronto, Ontario, Canada

    Ismail B. Turksen & Ravindra Shankar

Authors
  1. Ismail B. Turksen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ravindra Shankar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Grad. Program in Operations Research, North Carolina State University, Box 5511, 27607, Raleigh, NC, USA

    Salah E. Elmaghraby

Rights and permissions

Reprints and permissions

Copyright information

© 1973 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Turksen, I.B., Shankar, R. (1973). Some Extensions of Akers-Friedman Production Scheduling Problem. In: Elmaghraby, S.E. (eds) Symposium on the Theory of Scheduling and Its Applications. Lecture Notes in Economics and Mathematical Systems, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80784-8_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-80784-8_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06437-4

  • Online ISBN: 978-3-642-80784-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation