IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v16y2008i1d10.1007_s10878-007-9095-z.html
   My bibliography  Save this article

Online scheduling on parallel machines with two GoS levels

Author

Listed:
  • Yiwei Jiang

    (Zhejiang Sci-Tech University)

Abstract

This paper investigates the online scheduling problem on parallel and identical machines with a new feature that service requests from various customers are entitled to many different grade of service (GoS) levels. Hence each job and machine are labeled with the GoS levels, and each job can be processed by a particular machine only when the GoS level of the job is not less than that of the machine. The goal is to minimize the makespan. In this paper, we consider the problem with two GoS levels. It assumes that the GoS levels of the first k machines and the last m−k machines are 1 and 2, respectively. And every job has a GoS level of 1 alternatively or 2. We first prove the lower bound of the problem under consideration is at least 2. Then we discuss the performance of algorithm AW presented in Azar et al. (J. Algorithms 18:221–237, 1995) for the problem and show it has a tight bound of 4−1/m. Finally, we present an approximation algorithm with competitive ratio $\frac{12+4\sqrt{2}}{7}\approx 2.522$ .

Suggested Citation

  • Yiwei Jiang, 2008. "Online scheduling on parallel machines with two GoS levels," Journal of Combinatorial Optimization, Springer, vol. 16(1), pages 28-38, July.
    • Handle: RePEc:spr:jcomop:v:16:y:2008:i:1:d:10.1007_s10878-007-9095-z
    DOI: 10.1007/s10878-007-9095-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-007-9095-z
    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-007-9095-z?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.

    References listed on IDEAS

    as
    1. T C E Cheng & L Y Kang & C T Ng, 2007. "Due-date assignment and parallel-machine scheduling with deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(8), pages 1103-1108, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhiyi Tan & An Zhang, 2010. "A note on hierarchical scheduling on two uniform machines," Journal of Combinatorial Optimization, Springer, vol. 20(1), pages 85-95, July.
    2. Shlomo Karhi & Dvir Shabtay, 2013. "On the optimality of the TLS algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 198-222, July.
    3. Ming Liu & Chengbin Chu & Yinfeng Xu & Feifeng Zheng, 2011. "Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times," Journal of Combinatorial Optimization, Springer, vol. 21(1), pages 138-149, January.
    4. Karhi, Shlomo & Shabtay, Dvir, 2014. "Online scheduling of two job types on a set of multipurpose machines," International Journal of Production Economics, Elsevier, vol. 150(C), pages 155-162.
    5. Kangbok Lee & Joseph Leung & Michael Pinedo, 2013. "Makespan minimization in online scheduling with machine eligibility," Annals of Operations Research, Springer, vol. 204(1), pages 189-222, April.
    6. Wu, Yong & Ji, Min & Yang, Qifan, 2012. "Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision," International Journal of Production Economics, Elsevier, vol. 135(1), pages 367-371.
    7. An Zhang & Yiwei Jiang & Lidan Fan & Jueliang Hu, 2015. "Optimal online algorithms on two hierarchical machines with tightly-grouped processing times," Journal of Combinatorial Optimization, Springer, vol. 29(4), pages 781-795, May.
    8. Leung, Joseph Y.-T. & Li, Chung-Lun, 2008. "Scheduling with processing set restrictions: A survey," International Journal of Production Economics, Elsevier, vol. 116(2), pages 251-262, December.
    9. Jueliang Hu & Yiwei Jiang & Ping Zhou & An Zhang & Qinghui Zhang, 2017. "Total completion time minimization in online hierarchical scheduling of unit-size jobs," Journal of Combinatorial Optimization, Springer, vol. 33(3), pages 866-881, April.
    10. Li, Chung-Lun & Wang, Xiuli, 2010. "Scheduling parallel machines with inclusive processing set restrictions and job release times," European Journal of Operational Research, Elsevier, vol. 200(3), pages 702-710, February.
    11. Islam Akaria & Leah Epstein, 2023. "Bin stretching with migration on two hierarchical machines," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 98(1), pages 111-153, August.
    12. Li-ying Hou & Liying Kang, 2012. "Online scheduling on uniform machines with two hierarchies," Journal of Combinatorial Optimization, Springer, vol. 24(4), pages 593-612, November.
    13. Lee, Kangbok & Hwang, Hark-Chin & Lim, Kyungkuk, 2014. "Semi-online scheduling with GoS eligibility constraints," International Journal of Production Economics, Elsevier, vol. 153(C), pages 204-214.
    14. Zhenbo Wang & Wenxun Xing, 2010. "Worst-case analysis for on-line service policies," Journal of Combinatorial Optimization, Springer, vol. 19(1), pages 107-122, January.
    15. Islam Akaria & Leah Epstein, 2022. "Online scheduling with migration on two hierarchical machines," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3535-3548, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Li, Shisheng & Ng, C.T. & Yuan, Jinjiang, 2011. "Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine," International Journal of Production Economics, Elsevier, vol. 131(2), pages 747-751, June.
    2. L-H Sun & L-Y Sun & J-B Wang, 2011. "Single-machine scheduling to minimize total absolute differences in waiting times with deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 768-775, April.

    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:16:y:2008:i:1:d:10.1007_s10878-007-9095-z. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.