IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v260y2017i2p507-513.html
   My bibliography  Save this article

Fast approximation algorithms for uniform machine scheduling with processing set restrictions

Author

Listed:
  • Leung, Joseph Y-T.
  • Ng, C.T.

Abstract

We consider the problem of nonpreemptively scheduling a set of independent jobs on a set of uniform machines, where each job has a set of machines to which it can be assigned. This kind of restriction is called the processing set restriction. In the literature there are many kinds of processing set restrictions that have been studied. In this paper we consider two kinds: the “inclusive processing set” and the “tree-hierarchical processing set”. Epstein and Levin (2011) have given Polynomial Time Approximation Schemes (PTAS) to solve both classes. However, the running times of their PTAS are rather high. In this paper, we give fast approximation algorithms for both cases and show that they both have a worst-case performance bound of 4/3. Moreover, we show that the bounds are achievable.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:260:y:2017:i:2:p:507-513
    DOI: 10.1016/j.ejor.2017.01.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722171730036X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2017.01.013?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. 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.
    2. Chung-Lun Li & Kangbok Lee, 2016. "A note on scheduling jobs with equal processing times and inclusive processing set restrictions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(1), pages 83-86, January.
    3. 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.
    4. 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.
    5. Chung-Lun Li & Qingying Li, 2015. "Scheduling jobs with release dates, equal processing times, and inclusive processing set restrictions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(3), pages 516-523, March.
    6. 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.
    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. Chi To Ng & T. C. E. Cheng & Eugene Levner & Boris Kriheli, 2021. "Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm," Annals of Operations Research, Springer, vol. 296(1), pages 407-420, January.

    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. 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. 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.
    3. 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.
    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. 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.
    6. 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.
    7. 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.
    8. 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.
    9. Huiqiao Su & Michael Pinedo & Guohua Wan, 2017. "Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(3), pages 249-267, April.
    10. 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.
    11. Baoyu Liao & Qingru Song & Jun Pei & Shanlin Yang & Panos M. Pardalos, 2020. "Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration," Journal of Global Optimization, Springer, vol. 78(4), pages 717-742, December.
    12. 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.
    13. Ferreira, Cristiane & Figueira, Gonçalo & Amorim, Pedro, 2021. "Scheduling Human-Robot Teams in collaborative working cells," International Journal of Production Economics, Elsevier, vol. 235(C).
    14. Jia, Zhao-hong & Li, Kai & Leung, Joseph Y.-T., 2015. "Effective heuristic for makespan minimization in parallel batch machines with non-identical capacities," International Journal of Production Economics, Elsevier, vol. 169(C), pages 1-10.
    15. Chuleeporn Kusoncum & Kanchana Sethanan & Richard F. Hartl & Thitipong Jamrus, 2022. "Modified differential evolution and heuristic algorithms for dump tippler machine allocation in a typical sugar mill in Thailand," Operational Research, Springer, vol. 22(5), pages 5863-5895, November.
    16. Xu, Dongsheng & Li, Chung-Lun & Leung, Joseph Y.-T., 2012. "Berth allocation with time-dependent physical limitations on vessels," European Journal of Operational Research, Elsevier, vol. 216(1), pages 47-56.
    17. Xueling Zhong & Jinwen Ou, 2017. "Improved approximation algorithms for parallel machine scheduling with release dates and job rejection," 4OR, Springer, vol. 15(4), pages 387-406, December.
    18. 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.
    19. Giorgi Tadumadze & Simon Emde & Heiko Diefenbach, 2020. "Exact and heuristic algorithms for scheduling jobs with time windows on unrelated parallel machines," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(2), pages 461-497, June.
    20. 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.

    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:ejores:v:260:y:2017:i:2:p:507-513. 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/eor .

    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.