The Schedule-Sequencing Problem

Edward H. Bowman
Additional contact information
Edward H. Bowman: Massachusetts Institute of Technology, Cambridge, Massachusetts

Operations Research, 1959, vol. 7, issue 5, 621-624

Abstract: A tentative solution to the general schedule-sequencing problem is presented in a linear-programming form. Feasible solutions hinge on work recently presented on integer solutions to linear-programming problems. As yet, the computation involved for a practical problem would be quite large.

Date: 1959
References: Add references at CitEc
Citations: View citations in EconPapers (28)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.7.5.621 (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:7:y:1959:i:5:p:621-624

Access Statistics for this article

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