IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v37y1989i6p981-984.html
   My bibliography  Save this article

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

Author

Listed:
  • Richard L. Daniels

    (Duke University, Durham, North Carolina)

  • Rakesh K. Sarin

    (Duke University, Durham, North Carolina)

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.

Suggested Citation

  • Richard L. Daniels & Rakesh K. Sarin, 1989. "Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy," Operations Research, INFORMS, vol. 37(6), pages 981-984, December.
  • Handle: RePEc:inm:oropre:v:37:y:1989:i:6:p:981-984
    DOI: 10.1287/opre.37.6.981
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.37.6.981
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.37.6.981?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Liu Guiqing & Li Kai & Cheng Bayi, 2015. "Preemptive Scheduling with Controllable Processing Times on Parallel Machines," Journal of Systems Science and Information, De Gruyter, vol. 3(1), pages 68-76, February.
    2. Carrasco, Rodrigo A. & Iyengar, Garud & Stein, Cliff, 2018. "Resource cost aware scheduling," European Journal of Operational Research, Elsevier, vol. 269(2), pages 621-632.
    3. Faramroze G. Engineer & George L. Nemhauser & Martin W. P. Savelsbergh & Jin-Hwa Song, 2012. "The Fixed-Charge Shortest-Path Problem," INFORMS Journal on Computing, INFORMS, vol. 24(4), pages 578-596, November.
    4. Maruev, Aleksey (Маруев, Алексей), 2018. "Development of a System for Ensuring the Integrated Security of Transboundary Transport Corridors in the Far East and the Arctic Zone of the Russian Federation [Разработка Системы Обеспечения Компл," Working Papers 041833, Russian Presidential Academy of National Economy and Public Administration.
    5. Moshe Zofi & Ron Teller & Moshe Kaspi, 2017. "Maximizing the profit per unit of time for the TSP with convex resource-dependent travelling times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(10), pages 1177-1182, October.
    6. Dvir Shabtay & Moshe Kaspi, 2006. "Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(3), pages 204-216, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:37:y:1989:i:6:p:981-984. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.