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

Some Improved Algorithms On The Single Machine Hierarchical Scheduling With Total Tardiness As The Primary Criterion

Author

Listed:
  • CHENG HE

    (Institute of Science, Information Engineering University of PLA, Zhengzhou, Henan 450001, People's Republic of China;
    Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, People's Republic of China)

  • YIXUN LIN

    (Institute of Science, Information Engineering University of PLA, Zhengzhou, Henan 450001, People's Republic of China)

  • JINJIANG YUAN

    (Institute of Science, Information Engineering University of PLA, Zhengzhou, Henan 450001, People's Republic of China)

Abstract

It is well-known that a single machine scheduling problem of minimizing the total tardiness is NP-hard. Recently, Liu, Ng and Cheng solved some special hierarchical minimization problems with total tardiness as the primary criterion by the Algorithm TAP (Two Assignment Problems) inO(n3)time. And in this paper we present some algorithms for these problems with running timeO(n log n).

Suggested Citation

  • Cheng He & Yixun Lin & Jinjiang Yuan, 2010. "Some Improved Algorithms On The Single Machine Hierarchical Scheduling With Total Tardiness As The Primary Criterion," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 27(05), pages 577-585.
    • Handle: RePEc:wsi:apjorx:v:27:y:2010:i:05:n:s0217595910002867
    DOI: 10.1142/S0217595910002867
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595910002867
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595910002867?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. Cheng He & Hao Lin, 2016. "Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness," 4OR, Springer, vol. 14(2), pages 153-164, June.

    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:27:y:2010:i:05:n:s0217595910002867. 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.