IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/732437.html
   My bibliography  Save this article

Single-Machine Scheduling with Workload-Dependent Maintenance Duration to Minimize Maximum Lateness

Author

Listed:
  • Ting Wang
  • Dehua Xu

Abstract

A single-machine scheduling problem with a mandatory maintenance whose duration is workload-dependent is considered. The start time of the maintenance is restricted to a time window. The objective is to determine the start time of the maintenance and schedule all the jobs to the machine such that the maximum lateness is minimized. An approximation algorithm based on the classical Earliest Due Date first rule is proposed. It is showed that the proposed algorithm is optimal for some special cases and that it has a tight bound for the scheduling problem under consideration.

Suggested Citation

  • Ting Wang & Dehua Xu, 2015. "Single-Machine Scheduling with Workload-Dependent Maintenance Duration to Minimize Maximum Lateness," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-5, July.
    • Handle: RePEc:hin:jnlmpe:732437
    DOI: 10.1155/2015/732437
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2015/732437.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2015/732437.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/732437?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. Alexander A. Lazarev & Nikolay Pravdivets & Frank Werner, 2020. "On the Dual and Inverse Problems of Scheduling Jobs to Minimize the Maximum Penalty," Mathematics, MDPI, vol. 8(7), pages 1-15, July.

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:732437. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.