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

Group Scheduling with Two Competing Agents on a Single Machine

Author

Listed:
  • Shi-Sheng Li

    (College of Science, Zhongyuan University of Technology, Zhengzhou 450007, P. R. China)

  • Ren-Xia Chen

    (College of Science, Zhongyuan University of Technology, Zhengzhou 450007, P. R. China)

Abstract

We consider the scheduling problem in which two agents, each with a set of jobs, compete to perform their respective jobs on a single machine under a group technology (GT) environment. The jobs of agents are classified into groups according to their production similarities in advance, all jobs of the same group are required to be processed contiguously on the machine. A sequence-independent setup time precedes the processing of each group. We propose a polynomial time solution for the problem of minimizing the maximum regular cost of one agent, subject to an upper bound on the maximum regular cost of the second agent. We also show that the problem of minimizing the total completion time of the first agent, subject to an upper bound on the maximum lateness of the second agent is strongly $\mathcal {NP}$-hard. The case where all groups of the first agent have the same number of jobs is shown to be polynomially solvable.

Suggested Citation

  • Shi-Sheng Li & Ren-Xia Chen, 2014. "Group Scheduling with Two Competing Agents on a Single Machine," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 31(06), pages 1-13.
    • Handle: RePEc:wsi:apjorx:v:31:y:2014:i:06:n:s0217595914500432
    DOI: 10.1142/S0217595914500432
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595914500432
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595914500432?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. Shisheng Li & T.C.E. Cheng & C.T. Ng & Jinjiang Yuan, 2017. "Two‐agent scheduling on a single sequential and compatible batching machine," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(8), pages 628-641, December.

    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:31:y:2014:i:06:n:s0217595914500432. 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.