Single Facility Sequencing with Random Execution Times

B. P. Banerjee
Additional contact information
B. P. Banerjee: International Business Machines Corporation, Advanced Systems Development Division, Yorktown Heights, New York

Operations Research, 1965, vol. 13, issue 3, 358-364

Abstract: A single facility sequencing problem where the execution time for each job at the facility is random with known probability distribution, is formulated and solved. The solution is shown to be easily extended to situations where further jobs arrive while the program is in operation. Further extensions are discussed, where (a) the facility is taken to consist of multiple (identical or otherwise) units of equipment and, (b) special priorities are attached to some of the jobs.

Date: 1965
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.13.3.358 (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:13:y:1965:i:3:p:358-364

Access Statistics for this article

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