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

Parallel Machine Scheduling With A Simultaneity Constraint And Unit-Length Jobs To Minimize The Makespan

Author

Listed:
  • LIN LIN

    (State Key Laboratory of Wireless Mobile Communications, China Academy of Telecommunications Technology (CATT), Beijing, 100191, P. R. China)

  • YIXUN LIN

    (Department of Mathematics, Zhengzhou University, Zhengzhou, Henan, 450052, P. R. China)

  • XIANWEI ZHOU

    (Department of Communication Engineering, School of Information Engineering, University of Science and Technology Beijing, Beijing, 100083, P. R. China)

  • RUYAN FU

    (School of Sciences, China University of Mining and Technology, Xuzhou, Jiangsu 221116, P. R. China)

Abstract

In this paper, we consider the parallel machine scheduling with a simultaneity constraint and unit-length jobs. The problem can be described as follows. There are givenmparallel machines and a graphG, whose vertices represent jobs. Simultaneity constraint means that we can process a vertex jobvif and only if there exists at leastdG(v)idle machines, wheredG(v)is the degree of vertexvin graphG. Once a vertex job is completed, we delete the vertex and its incident edges from the graph. The number of machines that a vertex job needing depends on its degree in current graph. Changes of graph result in changes of vertex degree. Here, we consider a special case that all jobs in the original graph are unit-length. Letpvdenote the processing time of vertex jobv, we definepv= 0ifd(v) = 0, andpv= 1, otherwise. The objective is to minimize the time by which each vertex job is completed, i.e., the time by which the graph becomes an empty graph. We show that this problem is strongly NP-hard and provide a$(2-\frac{1}{m})$-approximation algorithm.

Suggested Citation

  • Lin Lin & Yixun Lin & Xianwei Zhou & Ruyan Fu, 2010. "Parallel Machine Scheduling With A Simultaneity Constraint And Unit-Length Jobs To Minimize The Makespan," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 27(06), pages 669-676.
    • Handle: RePEc:wsi:apjorx:v:27:y:2010:i:06:n:s0217595910002934
    DOI: 10.1142/S0217595910002934
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595910002934
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595910002934?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.

    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:06:n:s0217595910002934. 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.