IDEAS home Printed from https://ideas.repec.org/a/hin/jnddns/932680.html
   My bibliography  Save this article

Two-Agent Scheduling to Minimize the Maximum Cost with Position-Dependent Jobs

Author

Listed:
  • Long Wan

Abstract

This paper investigates a single-machine two-agent scheduling problem to minimize the maximum costs with position-dependent jobs. There are two agents, each with a set of independent jobs, competing to perform their jobs on a common machine. In our scheduling setting, the actual position-dependent processing time of one job is characterized by variable function dependent on the position of the job in the sequence. Each agent wants to fulfil the objective of minimizing the maximum cost of its own jobs. We develop a feasible method to achieve all the Pareto optimal points in polynomial time.

Suggested Citation

  • Long Wan, 2015. "Two-Agent Scheduling to Minimize the Maximum Cost with Position-Dependent Jobs," Discrete Dynamics in Nature and Society, Hindawi, vol. 2015, pages 1-4, April.
    • Handle: RePEc:hin:jnddns:932680
    DOI: 10.1155/2015/932680
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/DDNS/2015/932680.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/DDNS/2015/932680.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/932680?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnddns:932680. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.