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

Single Machine Scheduling with an Availability Constraint and Rejection

Author

Listed:
  • Chuanli Zhao

    (School of Mathematics and Systems Science, Shenyang Normal University, Shenyang, Liaoning 110034, P. R. China)

  • Hengyong Tang

    (School of Mathematics and Systems Science, Shenyang Normal University, Shenyang, Liaoning, 110034, P. R. China)

Abstract

This paper considers single machine scheduling with an availability constraint and rejection. It is assumed that the machine is not available for processing during a given time interval. A job is either rejected, in which case a rejection penalty has to be paid, or accepted and processed on the machine. The objective is to minimize the sum of the weighted total completion time of the accepted jobs and the total rejection penalty of the rejected jobs. For this NP-hard problem, we present a pseudo-polynomial dynamic programming algorithm and a fully polynomial-time approximation scheme (FPTAS).

Suggested Citation

  • Chuanli Zhao & Hengyong Tang, 2014. "Single Machine Scheduling with an Availability Constraint and Rejection," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 31(05), pages 1-15.
    • Handle: RePEc:wsi:apjorx:v:31:y:2014:i:05:n:s0217595914500377
    DOI: 10.1142/S0217595914500377
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595914500377
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595914500377?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.

    Citations

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


    Cited by:

    1. Shi-Sheng Li & Ren-Xia Chen, 2017. "Scheduling with Rejection and a Deteriorating Maintenance Activity on a Single Machine," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(02), pages 1-17, April.
    2. Lili Zuo & Zhenxia Sun & Lingfa Lu & Liqi Zhang, 2019. "Single-Machine Scheduling with Rejection and an Operator Non-Availability Interval," Mathematics, MDPI, vol. 7(8), pages 1-8, July.

    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:05:n:s0217595914500377. 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.