IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v31y2014i01ns0217595914500043.html
   My bibliography  Save this article

Common Due-Window Assignment And Scheduling Of Job-Dependent Deteriorating Jobs And Multiple Deteriorating Maintenance Activities

Author

Listed:
  • XINGONG ZHANG

    (College of Mathematics Science, Chongqing Normal University, Chongqing 400047, P. R. China)

Abstract

Due-window assignment and production scheduling problems are important issues in operations management. In this paper, the problems of common due-window assignment and scheduling of job-dependent deteriorating jobs and multiple deteriorating maintenance activities simultaneously on a single-machine are investigated. We assume that the machine may be subjected to several maintenance activities during the planning horizon. However, due to the restriction of budget of maintenance, the upper bound of the maintenance frequency on the machine is assumed to be known in advance. Moreover, we assume that the duration of each maintenance activity depends on the running time of the machine. Polynomial time algorithms for the all the studied problems are provided, where the objective is to simultaneously minimize the earliness, tardiness, due-window starting time, and due-window size costs.

Suggested Citation

  • Xingong Zhang, 2014. "Common Due-Window Assignment And Scheduling Of Job-Dependent Deteriorating Jobs And Multiple Deteriorating Maintenance Activities," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 31(01), pages 1-19.
    • Handle: RePEc:wsi:apjorx:v:31:y:2014:i:01:n:s0217595914500043
    DOI: 10.1142/S0217595914500043
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595914500043
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595914500043?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:wsi:apjorx:v:31:y:2014:i:01:n:s0217595914500043. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.