Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy

Richard L. Daniels and Rakesh K. Sarin
Additional contact information
Richard L. Daniels: Duke University, Durham, North Carolina
Rakesh K. Sarin: Duke University, Durham, North Carolina

Operations Research, 1989, vol. 37, issue 6, 981-984

Abstract: Most scheduling research has treated individual job processing times as fixed parameters. In many practical situations, however, a manager may exert processing time control through the allocation of a limited resource. We consider the problem of joint sequencing and resource allocation when the scheduling criterion of interest is the number of tardy jobs. Theoretical results are derived that aid in developing the tradeoff curve between the number of tardy jobs and the total amount of allocated resource.

Keywords: production/scheduling: deterministic sequencing; single machine (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.37.6.981 (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:37:y:1989:i:6:p:981-984

Access Statistics for this article

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