IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v150y2014icp155-162.html
   My bibliography  Save this article

Online scheduling of two job types on a set of multipurpose machines

Author

Listed:
  • Karhi, Shlomo
  • Shabtay, Dvir

Abstract

We study an online-list scheduling problem on a set of m multipurpose machines for which the objective is to minimize the makespan. It is assumed that there are two different job types, and each job type can be processed on a unique subset of machines. We provide an online algorithm with a competitive ratio of 1+k(m−1)/(k(m−s)+s2) where M1={M1,…,Mk} is the set of machines eligible to process jobs of type 1 and where M2={Ms+1,…,Mm} is the set of machines eligible to process jobs of type 2 with k≥s. By analyzing the competitive ratio function, we show that the worst competitive ratio is obtained for an inclusive processing set structure in which the number of machines (m) is even, the first job type can be processed on any of the m machines and the second job type can be processed only on a subset of m/2 machines. Moreover, we provide a lower bound as a function of the processing set structure.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:proeco:v:150:y:2014:i:c:p:155-162
    DOI: 10.1016/j.ijpe.2013.12.015
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527313005744
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2013.12.015?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. 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.
    2. Yiwei Jiang, 2008. "Online scheduling on parallel machines with two GoS levels," Journal of Combinatorial Optimization, Springer, vol. 16(1), pages 28-38, July.
    3. 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.
    4. Epstein, Leah & Levin, Asaf, 2011. "Scheduling with processing set restrictions: PTAS results for several variants," International Journal of Production Economics, Elsevier, vol. 133(2), pages 586-595, October.
    5. Lin, Yixun & Li, Wenhua, 2004. "Parallel machine scheduling of machine-dependent jobs with unit-length," European Journal of Operational Research, Elsevier, vol. 156(1), pages 261-266, July.
    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. Hark-Chin Hwang & Soo Y. Chang & Yushin Hong, 2004. "A Posterior Competitiveness For List Scheduling Algorithm On Machines With Eligibility Constraints," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 21(01), pages 117-125.
    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. Leung, Joseph Y.-T. & Li, Chung-Lun, 2016. "Scheduling with processing set restrictions: A literature update," International Journal of Production Economics, Elsevier, vol. 175(C), pages 1-11.
    2. Goldberg, Noam & Karhi, Shlomo, 2019. "Online packing of arbitrary sized items into designated and multipurpose bins," European Journal of Operational Research, Elsevier, vol. 279(1), pages 54-67.
    3. Ma, Ran & Yuan, Jinjiang, 2014. "Online tradeoff scheduling on a single machine to minimize makespan and total weighted completion time," International Journal of Production Economics, Elsevier, vol. 158(C), pages 114-119.
    4. Goldberg, Noam & Karhi, Shlomo, 2017. "Packing into designated and multipurpose bins: A theoretical study and application to the cold chain," Omega, Elsevier, vol. 71(C), pages 85-92.

    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. 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.
    2. Leung, Joseph Y.-T. & Li, Chung-Lun, 2016. "Scheduling with processing set restrictions: A literature update," International Journal of Production Economics, Elsevier, vol. 175(C), pages 1-11.
    3. 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.
    4. Li, Shuguang, 2017. "Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan," European Journal of Operational Research, Elsevier, vol. 260(1), pages 12-20.
    5. Huo, Yumei & Leung, Joseph Y.-T., 2010. "Parallel machine scheduling with nested processing set restrictions," European Journal of Operational Research, Elsevier, vol. 204(2), pages 229-236, July.
    6. Leung, Joseph Y-T. & Ng, C.T., 2017. "Fast approximation algorithms for uniform machine scheduling with processing set restrictions," European Journal of Operational Research, Elsevier, vol. 260(2), pages 507-513.
    7. 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.
    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. 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.
    10. Xianglai Qi & Jinjiang Yuan, 2019. "Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(01), pages 1-16, February.
    11. 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.
    12. Jinwen Ou & Xueling Zhong & Xiangtong Qi, 2016. "Scheduling parallel machines with inclusive processing set restrictions and job rejection," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(8), pages 667-681, December.
    13. 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.
    14. Xianglai Qi & Jinjiang Yuan, 2017. "Semi-online hierarchical scheduling for $$l_p$$ l p -norm load balancing with buffer or rearrangements," 4OR, Springer, vol. 15(3), pages 265-276, September.
    15. Li, Shuguang, 2017. "Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities," European Journal of Operational Research, Elsevier, vol. 263(3), pages 815-826.
    16. 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.
    17. 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.
    18. Epstein, Leah & Levin, Asaf, 2011. "Scheduling with processing set restrictions: PTAS results for several variants," International Journal of Production Economics, Elsevier, vol. 133(2), pages 586-595, October.
    19. Chou, Yon-Chun & Lin, Yue-Lan & Chun, King-Fai, 2014. "A construction of knowledge rules for reactive planning of job-mix assignment to homogeneous serial batch machines," International Journal of Production Economics, Elsevier, vol. 151(C), pages 56-66.
    20. André Rossi & Alexis Aubry & Mireille Jacomino, 2011. "A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty," Annals of Operations Research, Springer, vol. 191(1), pages 219-249, November.

    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:eee:proeco:v:150:y:2014:i:c:p:155-162. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.