An Application of Symbolic Logic to a Selection Problem

James G. Root
Additional contact information
James G. Root: The Ohio State University, Columbus

Operations Research, 1964, vol. 12, issue 4, 519-526

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.

Date: 1964
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.12.4.519 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:12:y:1964:i:4:p:519-526

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().