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

Single Machine Family Scheduling With Two Competing Agents To Minimize Makespan

Author

Listed:
  • GUOSHENG DING

    (School of Science, Nantong University, Nantong 226007, People's, Republic of China)

  • SHIJIE SUN

    (Department of Mathematics, Shanghai University, Shanghai 200444, People's, Republic of China)

Abstract

We consider two-agent scheduling on a single machine, where there are job families and setup requirements exist between these families. Each agent's objective function is to minimize his own makespan. One of our goals is to find the optimal solution for one agent with a constraint on the other agent's makespan (constrained optimization). This problem is equivalent to the caudate Knapsack problem that we define in the paper. The other goal is to find single nondominated schedules (i.e., such that a better schedule for one of the two agents necessarily result in a worse schedule of the other agent), and to enumerate all nondominated schedules. Finally, two special cases, one with equal job processing times and the other with equal family setups are studied. We prove that the constrained optimization problems in both cases can be solved in polynomial time and that the cases have a polynomial number of nondominated schedules.

Suggested Citation

  • Guosheng Ding & Shijie Sun, 2011. "Single Machine Family Scheduling With Two Competing Agents To Minimize Makespan," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 28(06), pages 773-785.
    • Handle: RePEc:wsi:apjorx:v:28:y:2011:i:06:n:s021759591100334x
    DOI: 10.1142/S021759591100334X
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S021759591100334X
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S021759591100334X?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. Perez-Gonzalez, Paz & Framinan, Jose M., 2014. "A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems," European Journal of Operational Research, Elsevier, vol. 235(1), pages 1-16.

    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:28:y:2011:i:06:n:s021759591100334x. 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.