IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v75y2024i7p1343-1346.html
   My bibliography  Save this article

Single machine scheduling with resource constraints: Equivalence to two-machine flow-shop scheduling for regular objectives

Author

Listed:
  • Sergey Kovalev
  • Isabelle Chalamon
  • Audrey Bécuwe

Abstract

A number of results have been reported in the literature for a single machine job scheduling problem with resource constraints. We demonstrate that many of these results and some new results follow from an equivalence of this problem and the classical two-machine flow-shop scheduling problem. We further refine computational complexity of the problem with resource constraints by presenting new NP-hardness proofs.

Suggested Citation

  • Sergey Kovalev & Isabelle Chalamon & Audrey Bécuwe, 2024. "Single machine scheduling with resource constraints: Equivalence to two-machine flow-shop scheduling for regular objectives," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 75(7), pages 1343-1346, July.
    • Handle: RePEc:taf:tjorxx:v:75:y:2024:i:7:p:1343-1346
    DOI: 10.1080/01605682.2023.2244529
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2023.2244529
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2023.2244529?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.

    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:taf:tjorxx:v:75:y:2024:i:7:p:1343-1346. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.