IDEAS home Printed from https://ideas.repec.org/a/hin/jjmath/8886388.html
   My bibliography  Save this article

A Combinatorial Approximation Algorithm for the Vector Scheduling with Submodular Penalties on Parallel Machines

Author

Listed:
  • Bihui Cheng
  • Wencheng Wang
  • Ji Gao

Abstract

In this paper, we focus on solving the vector scheduling problem with submodular penalties on parallel machines. We are given n jobs and m parallel machines, where each job is associated with a d-dimensional vector. Each job can either be rejected, incurring a rejection penalty, or accepted and processed on one of the m parallel machines. The objective is to minimize the sum of the maximum load overall dimensions of the total vector for all accepted jobs, along with the total penalty for rejected jobs. The penalty is determined by a submodular function. Our main work is to design a 2−1/mminr,d-approximation algorithm to solve this problem. Here, r denotes the maximum ratio of the maximum load to the minimum load on the d-dimensional vectors among all jobs.

Suggested Citation

  • Bihui Cheng & Wencheng Wang & Ji Gao, 2023. "A Combinatorial Approximation Algorithm for the Vector Scheduling with Submodular Penalties on Parallel Machines," Journal of Mathematics, Hindawi, vol. 2023, pages 1-8, November.
    • Handle: RePEc:hin:jjmath:8886388
    DOI: 10.1155/2023/8886388
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/jmath/2023/8886388.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/jmath/2023/8886388.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2023/8886388?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jjmath:8886388. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.