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

Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times

Author

Listed:
  • Peng Liu
  • Xiaoyu Tian

Abstract

We consider several two-agent scheduling problems with resource consumption on a single machine, where each of the agents wants to minimize a measure dependent on its own jobs. The starting time of each job of the first agent is related to the amount of resource consumed. The objective is to minimize the total amount of resource consumption of the first agent with the restriction that the makespan or the total completion time of the second agent cannot exceed a given bound . The optimal properties and the optimal polynomial time algorithms are proposed to solve the scheduling problems.

Suggested Citation

  • Peng Liu & Xiaoyu Tian, 2013. "Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times," Mathematical Problems in Engineering, Hindawi, vol. 2013, pages 1-5, August.
    • Handle: RePEc:hin:jnlmpe:805261
    DOI: 10.1155/2013/805261
    as

    Download full text from publisher

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