IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v22y2011i4d10.1007_s10878-010-9316-8.html
   My bibliography  Save this article

Optimal semi-online algorithm for scheduling with rejection on two uniform machines

Author

Listed:
  • Xiao Min

    (Jiaxing College)

  • Jing Liu

    (Jiaxing College)

  • Yuqing Wang

    (Jiaxing College)

Abstract

In this paper we consider a semi-online scheduling problem with rejection on two uniform machines with speed 1 and s≥1, respectively. A sequence of independent jobs are given and each job is characterized by its size (processing time) and its penalty, in the sense that, jobs arrive one by one and can be either rejected by paying a certain penalty or assigned to some machine. No preemption is allowed. The objective is to minimize the sum of the makespan of schedule, which is yielded by all accepted jobs and the total penalties of all rejected ones. Further, two rejection strategies are permitted thus an algorithm can propose two different schemes, from which the better solution is chosen. For the above version, we present an optimal semi-online algorithm H that achieves a competitive ratio ρ H (s) as a piecewise function in terms of the speed ratio s.

Suggested Citation

  • Xiao Min & Jing Liu & Yuqing Wang, 2011. "Optimal semi-online algorithm for scheduling with rejection on two uniform machines," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 674-683, November.
    • Handle: RePEc:spr:jcomop:v:22:y:2011:i:4:d:10.1007_s10878-010-9316-8
    DOI: 10.1007/s10878-010-9316-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-010-9316-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-010-9316-8?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. Xiao Min & Yuqing Wang & Jing Liu & Min Jiang, 2013. "Semi-online scheduling on two identical machines with rejection," Journal of Combinatorial Optimization, Springer, vol. 26(3), pages 472-479, 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:spr:jcomop:v:22:y:2011:i:4:d:10.1007_s10878-010-9316-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.