IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v50y1999i10d10.1057_palgrave.jors.2600791.html
   My bibliography  Save this article

Scheduling the maintenance on a single machine

Author

Listed:
  • X Qi

    (Nankai University)

  • T Chen

    (Nankai University)

  • F Tu

    (Nankai University)

Abstract

This paper considers a single machine scheduling problem with preventive maintenance. In many cases, a machine must be maintained after it continuously works for a period of time. But most papers in the literature ignore non-availability of the machine. For this reason, this paper studies the problem of scheduling processing of jobs and maintenance of machine simultaneously. The objective is to minimise total completion time of jobs. The problem is proved to be NP-hard in the strong sense. Three heuristic algorithms and a branch and bound algorithm are proposed. Computational experiments are done to evaluate the effectiveness of the algorithms.

Suggested Citation

  • X Qi & T Chen & F Tu, 1999. "Scheduling the maintenance on a single machine," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(10), pages 1071-1078, October.
    • Handle: RePEc:pal:jorsoc:v:50:y:1999:i:10:d:10.1057_palgrave.jors.2600791
    DOI: 10.1057/palgrave.jors.2600791
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2600791
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2600791?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:pal:jorsoc:v:50:y:1999:i:10:d:10.1057_palgrave.jors.2600791. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.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.