IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v52y2001i2d10.1057_palgrave.jors.2601074.html
   My bibliography  Save this article

An approximation algorithm for parallel machine scheduling with a common server

Author

Listed:
  • Guoqing Wang

    (Jinan University
    The Hong Kong Polytechnic University)

  • T C Edwin Cheng

    (The Hong Kong Polytechnic University)

Abstract

In this paper we study the scheduling of a given set of jobs on several identical parallel machines tended by a common server. Each job must be processed on one of the machines. Prior to processing, the server has to set up the relevant machine. The objective is to schedule the jobs so as to minimize the total weighted job completion times. We provide an approximation algorithm to tackle this intractable problem and analyze the worst-case performance of the algorithm for the general, as well as a special, case of the problem.

Suggested Citation

  • Guoqing Wang & T C Edwin Cheng, 2001. "An approximation algorithm for parallel machine scheduling with a common server," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(2), pages 234-237, February.
    • Handle: RePEc:pal:jorsoc:v:52:y:2001:i:2:d:10.1057_palgrave.jors.2601074
    DOI: 10.1057/palgrave.jors.2601074
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601074
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601074?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. Yiwei Jiang & Qinghui Zhang & Jueliang Hu & Jianming Dong & Min Ji, 2015. "Single-server parallel-machine scheduling with loading and unloading times," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 201-213, August.
    2. David Füßler & Stefan Fedtke & Nils Boysen, 2019. "The cafeteria problem: order sequencing and picker routing in on-the-line picking systems," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(3), pages 727-756, September.
    3. Jun-Ho Lee & Hyun-Jung Kim, 2021. "A heuristic algorithm for identical parallel machine scheduling: splitting jobs, sequence-dependent setup times, and limited setup operators," Flexible Services and Manufacturing Journal, Springer, vol. 33(4), pages 992-1026, December.
    4. Abdelhak Elidrissi & Rachid Benmansour & Nicolas Zufferey & Mohammed Benbrahim & David Duvivier, 2024. "Minimization of maximum lateness on parallel machines with a single server and job release dates," 4OR, Springer, vol. 22(3), pages 351-385, September.

    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:52:y:2001:i:2:d:10.1057_palgrave.jors.2601074. 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.