IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v63y2012i6p821-825.html
   My bibliography  Save this article

A note on parallel-machine due-window assignment

Author

Listed:
  • D Xu

    (Sun Yat-sen University, Guangzhou, China)

  • C-L Li

    (The Hong Kong Polytechnic University, Kowloon, Hong Kong)

  • Q Han

    (Zhejiang University of Finance and Economics, Hangzhou, China)

Abstract

We consider a due-window assignment problem on identical parallel machines, where the jobs have equal processing times and job-dependent earliness-tardiness costs. We would like to determine a ‘due window’ during which the jobs can be completed at no cost and to obtain a job schedule in which the jobs are penalized if they finish before or after the due window. The objective is to minimize the total earliness and tardiness job penalty, plus the cost associated with the size of the due window. We present an algorithm that can solve this problem in O(n3) time, which is an improvement of the O(n4) solution procedure developed by Mosheiov and Sarig.

Suggested Citation

  • D Xu & C-L Li & Q Han, 2012. "A note on parallel-machine due-window assignment," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 63(6), pages 821-825, June.
    • Handle: RePEc:pal:jorsoc:v:63:y:2012:i:6:p:821-825
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v63/n6/pdf/jors201175a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v63/n6/full/jors201175a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:pal:jorsoc:v:63:y:2012:i:6:p:821-825. 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.