IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v12y1964i4p519-526.html
   My bibliography  Save this article

An Application of Symbolic Logic to a Selection Problem

Author

Listed:
  • James G. Root

    (The Ohio State University, Columbus)

Abstract

Given a set of jobs that must be performed, although not necessarily concurrently, a set of resources to perform the jobs, a set of cost measures for the resources, and a set of restrictions on the resources that may be used, the selection problem is to find a least-cost subset of resources that satisfies the restrictions and is capable of performing all the jobs. This selection problem is generalized into minimizing a linear function of Boolean variables subject to Boolean restriction equations. A “smallest” complete set of solutions is found that contains all optimal solutions.

Suggested Citation

  • James G. Root, 1964. "An Application of Symbolic Logic to a Selection Problem," Operations Research, INFORMS, vol. 12(4), pages 519-526, August.
    • Handle: RePEc:inm:oropre:v:12:y:1964:i:4:p:519-526
    DOI: 10.1287/opre.12.4.519
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.12.4.519
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.12.4.519?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sarin, Subhash C. & Aggarwal, Sanjay, 2001. "Modeling and algorithmic development of a staff scheduling problem," European Journal of Operational Research, Elsevier, vol. 128(3), pages 558-569, February.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:12:y:1964:i:4:p:519-526. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.