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

A Posterior Competitiveness For List Scheduling Algorithm On Machines With Eligibility Constraints

Author

Listed:
  • HARK-CHIN HWANG

    (Department of Industrial Engineering, Chosun University, 375 Susuk-Dong, Dong-Gu, Gwangju 501-709, South Korea)

  • SOO Y. CHANG

    (Industrial Engineering Department, Division of Electrical and Computer Engineering, Pohang University of Science and Technology, San 31 Hyoja-Dong, Pohang, Kyungbook 790-784, South Korea)

  • YUSHIN HONG

    (Industrial Engineering Department, Division of Electrical and Computer Engineering, Pohang University of Science and Technology, San 31 Hyoja-Dong, Pohang, Kyungbook 790-784, South Korea)

Abstract

We consider the on-line problem of schedulingnindependent jobs onmidentical machines under the machine eligibility constraints, where each job has its own specified subset of machines which are eligible for processing it. We investigate a greedy algorithm LS and prove its posterior competitiveness ratio is$\log_2\frac{4}{\lambda}m-\frac{1}{\lambda}$, where λ is the number of machines eligible for processing the job with the latest completion time.

Suggested Citation

  • Hark-Chin Hwang & Soo Y. Chang & Yushin Hong, 2004. "A Posterior Competitiveness For List Scheduling Algorithm On Machines With Eligibility Constraints," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 21(01), pages 117-125.
    • Handle: RePEc:wsi:apjorx:v:21:y:2004:i:01:n:s0217595904000084
    DOI: 10.1142/S0217595904000084
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595904000084
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595904000084?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. Karhi, Shlomo & Shabtay, Dvir, 2014. "Online scheduling of two job types on a set of multipurpose machines," International Journal of Production Economics, Elsevier, vol. 150(C), pages 155-162.
    2. Leung, Joseph Y.-T. & Li, Chung-Lun, 2008. "Scheduling with processing set restrictions: A survey," International Journal of Production Economics, Elsevier, vol. 116(2), pages 251-262, December.
    3. Li, Shuguang, 2017. "Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan," European Journal of Operational Research, Elsevier, vol. 260(1), pages 12-20.
    4. Kangbok Lee & Joseph Leung & Michael Pinedo, 2013. "Makespan minimization in online scheduling with machine eligibility," Annals of Operations Research, Springer, vol. 204(1), pages 189-222, April.

    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:21:y:2004:i:01:n:s0217595904000084. 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.