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

Scheduling Two-Agents with a Time-Dependent Deterioration to Minimize the Minsum Earliness Measures

Author

Listed:
  • Shuenn-Ren Cheng

    (Graduate Institute of Business Administration, Cheng Shiu University, Kaohsiung, Taiwan)

Abstract

This paper considers a new scheduling model in which both two-agents and a time-dependent deterioration exist simultaneously. By the time-dependent deterioration, it means that the actual processing time of a job belonging to the two-agents is defined as a non-decreasing linear function of its starting time. Two-agents compete to perform their respective jobs on a common single-machine and each agent has his own criterion to be optimized. The aim is to focus on minimizing total (weighted) earliness cost of one agent, subject to an upper bound on the maximum earliness cost of the other agent. The main contribution of this paper is to propose the optimal properties and present the complexity results for the problems addressed here.

Suggested Citation

  • Shuenn-Ren Cheng, 2014. "Scheduling Two-Agents with a Time-Dependent Deterioration to Minimize the Minsum Earliness Measures," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 31(05), pages 1-10.
    • Handle: RePEc:wsi:apjorx:v:31:y:2014:i:05:n:s0217595914500407
    DOI: 10.1142/S0217595914500407
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595914500407
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595914500407?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. Enrique Gerstl & Baruch Mor & Gur Mosheiov, 2017. "Scheduling with two competing agents to minimize total weighted earliness," Annals of Operations Research, Springer, vol. 253(1), pages 227-245, June.
    2. Zhenyou Wang & Cai-Min Wei & Yu-Bin Wu, 2016. "Single Machine Two-Agent Scheduling with Deteriorating Jobs," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(05), pages 1-17, October.

    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:05:n:s0217595914500407. 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.