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

Online Parallel Machine Scheduling to Maximize the Number of Early Jobs

Author

Listed:
  • Feifeng Zheng
  • Ming Liu
  • Chengbin Chu
  • Yinfeng Xu

Abstract

We study a maximization problem: online scheduling on m identical machines to maximize the number of early jobs. The problem is online in the sense that all jobs arrive over time. Each job's characteristics, such as processing time and due date, become known at its arrival time. We consider the preemption-restart model , in which preemption is allowed, while once a job is restarted, it loses all the progress that has been made on this job so far. If in some schedule a job is completed before or at its due date, then it is called early (or on time ). The objective is to maximize the number of early jobs. For m identical machines, we prove an upper bound of competitive ratio and show that ECT (earliest completion time) algorithm is -competitive.

Suggested Citation

  • Feifeng Zheng & Ming Liu & Chengbin Chu & Yinfeng Xu, 2012. "Online Parallel Machine Scheduling to Maximize the Number of Early Jobs," Mathematical Problems in Engineering, Hindawi, vol. 2012, pages 1-7, January.
    • Handle: RePEc:hin:jnlmpe:939717
    DOI: 10.1155/2012/939717
    as

    Download full text from publisher

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