IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v47y2024i4d10.1007_s10878-024-01122-0.html
   My bibliography  Save this article

Computational complexity and algorithms for two scheduling problems under linear constraints

Author

Listed:
  • Kameng Nip

    (Shenzhen University)

  • Peng Xie

    (Xiamen University)

Abstract

This paper considers two different types of scheduling problems under linear constraints. The first is the single-machine scheduling problem with minimizing total completion time, while the second is the no-wait two-machine flow shop scheduling problem with minimizing makespan. For these two problems, a set of jobs is required to be scheduled to one or two machines. In contrast to the classic scheduling problems, the processing times of jobs are not fixed constants and are not predetermined. The decision-maker only knows that they should satisfy a system of given linear constraints. For both problems, the goal is to determine the processing time for each job and find the schedule that minimizes a particular criterion, namely, the total completion time or the makespan. First, we study the computational complexity and show that both the problems under linear constraints are NP-hard. These hardness results significantly differ from their traditional scheduling counterparts, as both of those are solvable in polynomial time. Then we propose polynomial time exact or approximation algorithms for various special cases. By utilizing the existing scheduling algorithms and the properties of linear programming, we demonstrate that both problems are polynomially solvable when the total number of linear constraints is a fixed constant.

Suggested Citation

  • Kameng Nip & Peng Xie, 2024. "Computational complexity and algorithms for two scheduling problems under linear constraints," Journal of Combinatorial Optimization, Springer, vol. 47(4), pages 1-31, May.
    • Handle: RePEc:spr:jcomop:v:47:y:2024:i:4:d:10.1007_s10878-024-01122-0
    DOI: 10.1007/s10878-024-01122-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-024-01122-0
    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-024-01122-0?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.

    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:47:y:2024:i:4:d:10.1007_s10878-024-01122-0. 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: 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.