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

Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects

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 a single machine scheduling with both deterioration and positional effects and due-window assignment problem. The job-dependent due-windows are obtained by the common flow allowance criterion. The objective is to schedule the jobs, and the due-windows so as to minimize the sum of earliness, tardiness, and due-window starting time and due-window size costs. We introduce a polynomial solution for the problem. Furthermore, we show how the solutions can be extended to the setting with job rejection.

Suggested Citation

  • Chuanli Zhao & Hengyong Tang, 2015. "Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(03), pages 1-11.
    • Handle: RePEc:wsi:apjorx:v:32:y:2015:i:03:n:s0217595915500141
    DOI: 10.1142/S0217595915500141
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595915500141
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595915500141?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. Zhenyou Wang & Cai-Min Wei & Yuan-Yuan Lu, 2016. "Permutation Flow Shop Problem with Shortening Job Processing Times," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(04), pages 1-14, August.
    2. Yue, Qing & Zhou, Shenghai, 2021. "Due-window assignment scheduling problem with stochastic processing times," European Journal of Operational Research, Elsevier, vol. 290(2), pages 453-468.

    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:32:y:2015:i:03:n:s0217595915500141. 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.