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

An improved approximation algorithm for scheduling monotonic moldable tasks

Author

Listed:
  • Wu, Fangfang
  • Zhang, Xiandong
  • Chen, Bo

Abstract

We are concerned with the problem of scheduling monotonic moldable tasks on identical processors to minimize the makespan. We focus on the natural case where the number m of processors as resources is fixed or relatively small compared with the number n of tasks. We present an efficient (3/2)-approximation algorithm with time complexity O(nmlog(nm)) (for m>n) and O(n2logn) (for m≤n). To the best of our knowledge, the best relevant known results are: (a) a (3/2+ϵ)-approximation algorithm with time complexity O(nmlog(n/ϵ)), (b) a fully polynomial-time approximation scheme for the case of m≥16n/ϵ, and (c) a polynomial-time approximation scheme with time complexity O(ng(1/ϵ)) when m is bounded by a polynomial in n, where g(·) is a super-exponential function. On the other hand, the novel general technique developed in this paper for removing the ϵ-term in the worst-case performance ratio can be applied to improving the performance guarantee of certain dual algorithms for other combinatorial optimization problems.

Suggested Citation

  • Wu, Fangfang & Zhang, Xiandong & Chen, Bo, 2023. "An improved approximation algorithm for scheduling monotonic moldable tasks," European Journal of Operational Research, Elsevier, vol. 306(2), pages 567-578.
    • Handle: RePEc:eee:ejores:v:306:y:2023:i:2:p:567-578
    DOI: 10.1016/j.ejor.2022.08.034
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221722006762
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2022.08.034?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. Delorme, Xavier & Dolgui, Alexandre & Kovalev, Sergey & Kovalyov, Mikhail Y., 2019. "Minimizing the number of workers in a paced mixed-model assembly line," European Journal of Operational Research, Elsevier, vol. 272(1), pages 188-194.
    2. Dolgui, Alexandre & Kovalev, Sergey & Kovalyov, Mikhail Y. & Malyutin, Sergey & Soukhal, Ameur, 2018. "Optimal workforce assignment to operations of a paced assembly line," European Journal of Operational Research, Elsevier, vol. 264(1), pages 200-211.
    3. J Blazewicz & T C E Cheng & M Machowiak & C Oguz, 2011. "Berth and quay crane allocation: a moldable task scheduling model," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(7), pages 1189-1197, July.
    4. Claire Kenyon & Eric Rémila, 2000. "A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem," Mathematics of Operations Research, INFORMS, vol. 25(4), pages 645-656, November.
    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. Wu, Xiaohu & Loiseau, Patrick, 2023. "Efficient approximation algorithms for scheduling moldable tasks," European Journal of Operational Research, Elsevier, vol. 310(1), pages 71-83.

    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. Hashemi-Petroodi, S. Ehsan & Thevenin, Simon & Kovalev, Sergey & Dolgui, Alexandre, 2023. "Markov decision process for multi-manned mixed-model assembly lines with walking workers," International Journal of Production Economics, Elsevier, vol. 255(C).
    2. Fangfang Wu & Zhongyi Jiang & Run Zhang & Xiandong Zhang, 2023. "Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms," Journal of Scheduling, Springer, vol. 26(4), pages 383-398, August.
    3. Hashemi-Petroodi, S. Ehsan & Thevenin, Simon & Kovalev, Sergey & Dolgui, Alexandre, 2022. "Model-dependent task assignment in multi-manned mixed-model assembly lines with walking workers," Omega, Elsevier, vol. 113(C).
    4. Jiayin Pan & Yinfeng Xu & Guiqing Zhang, 2018. "Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead," Journal of Combinatorial Optimization, Springer, vol. 36(2), pages 617-636, August.
    5. Alberto Caprara, 2008. "Packing d -Dimensional Bins in d Stages," Mathematics of Operations Research, INFORMS, vol. 33(1), pages 203-215, February.
    6. Delorme, Xavier & Dolgui, Alexandre & Kovalev, Sergey & Kovalyov, Mikhail Y., 2019. "Minimizing the number of workers in a paced mixed-model assembly line," European Journal of Operational Research, Elsevier, vol. 272(1), pages 188-194.
    7. Battaïa, Olga & Dolgui, Alexandre, 2022. "Hybridizations in line balancing problems: A comprehensive review on new trends and formulations," International Journal of Production Economics, Elsevier, vol. 250(C).
    8. Agra, Agostinho & Oliveira, Maryse, 2018. "MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem," European Journal of Operational Research, Elsevier, vol. 264(1), pages 138-148.
    9. 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.
    10. Fang, Kan & Wang, Shijin & Pinedo, Michael L. & Chen, Lin & Chu, Feng, 2021. "A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions," European Journal of Operational Research, Elsevier, vol. 291(1), pages 128-146.
    11. Yong Wu & Wenkai Li & Matthew E. H. Petering & Mark Goh & Robert de Souza, 2015. "Scheduling Multiple Yard Cranes with Crane Interference and Safety Distance Requirement," Transportation Science, INFORMS, vol. 49(4), pages 990-1005, November.
    12. Heiner Ackermann & Erik Diessel, 2020. "A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 263-288, October.
    13. 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.
    14. Türkoğulları, Yavuz B. & Taşkın, Z. Caner & Aras, Necati & Altınel, İ. Kuban, 2014. "Optimal berth allocation and time-invariant quay crane assignment in container terminals," European Journal of Operational Research, Elsevier, vol. 235(1), pages 88-101.
    15. Alberto Caprara & Andrea Lodi & Michele Monaci, 2005. "Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing," Mathematics of Operations Research, INFORMS, vol. 30(1), pages 150-172, February.
    16. Shaojie Tang & Jing Yuan & Zhao Zhang & Ding-zhu Du, 2017. "iGreen: green scheduling for peak demand minimization," Journal of Global Optimization, Springer, vol. 69(1), pages 45-67, September.
    17. Correcher, Juan F. & Alvarez-Valdes, Ramon & Tamarit, Jose M., 2019. "New exact methods for the time-invariant berth allocation and quay crane assignment problem," European Journal of Operational Research, Elsevier, vol. 275(1), pages 80-92.
    18. Jean-François Côté & Mauro Dell'Amico & Manuel Iori, 2014. "Combinatorial Benders' Cuts for the Strip Packing Problem," Operations Research, INFORMS, vol. 62(3), pages 643-661, June.
    19. Simon Emde & Hamid Abedinnia & Anne Lange & Christoph H. Glock, 2020. "Scheduling personnel for the build-up of unit load devices at an air cargo terminal with limited space," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(2), pages 397-426, June.
    20. Mosadegh, H. & Fatemi Ghomi, S.M.T. & Süer, G.A., 2020. "Stochastic mixed-model assembly line sequencing problem: Mathematical modeling and Q-learning based simulated annealing hyper-heuristics," European Journal of Operational Research, Elsevier, vol. 282(2), pages 530-544.

    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:306:y:2023:i:2:p:567-578. 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.