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

Two-Agent Single-Machine Scheduling of Jobs with Time-Dependent Processing Times and Ready Times

Author

Listed:
  • Jan-Yee Kung
  • Yuan-Po Chao
  • Kuei-I Lee
  • Chao-Chung Kang
  • Win-Chin Lin

Abstract

Scheduling involving jobs with time-dependent processing times has recently attracted much research attention. However, multiagent scheduling with simultaneous considerations of jobs with time-dependent processing times and ready times is relatively unexplored. Inspired by this observation, we study a two-agent single-machine scheduling problem in which the jobs have both time-dependent processing times and ready times. We consider the model in which the actual processing time of a job of the first agent is a decreasing function of its scheduled position while the actual processing time of a job of the second agent is an increasing function of its scheduled position. In addition, each job has a different ready time. The objective is to minimize the total completion time of the jobs of the first agent with the restriction that no tardy job is allowed for the second agent. We propose a branch-and-bound and several genetic algorithms to obtain optimal and near-optimal solutions for the problem, respectively. We also conduct extensive computational results to test the proposed algorithms and examine the impacts of different problem parameters on their performance.

Suggested Citation

  • Jan-Yee Kung & Yuan-Po Chao & Kuei-I Lee & Chao-Chung Kang & Win-Chin Lin, 2013. "Two-Agent Single-Machine Scheduling of Jobs with Time-Dependent Processing Times and Ready Times," Mathematical Problems in Engineering, Hindawi, vol. 2013, pages 1-13, July.
    • Handle: RePEc:hin:jnlmpe:806325
    DOI: 10.1155/2013/806325
    as

    Download full text from publisher

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