On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs

K. D. Glazebrook and J. C. Gittins
Additional contact information
K. D. Glazebrook: University of Newcastle upon Tyne, Newcastle upon Tyne, England
J. C. Gittins: University of Oxford, Oxford, England

Operations Research, 1981, vol. 29, issue 1, 161-173

Abstract: Some results of Sidney (Sidney, J. B. 1975. Decomposition algorithms for single machine sequencing with precedence relations and deferral costs. Opns. Res. 23 283–298.) concerning order-constrained deterministic scheduling with linear costs are extended to the more complex discounted costs case. Further, certain order-constrained stochastic scheduling problems are shown to have optimal strategies which are nonpreemptive. When this is so, results for the deterministic case may be utilized to obtain these optimal strategies. The models discussed are of interest in computer and job-shop scheduling and research planning.

Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.29.1.161 (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:29:y:1981:i:1:p:161-173

Access Statistics for this article

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