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

Sergey Kovalev, Isabelle Chalamon and Audrey Bécuwe

Journal of the Operational Research Society, 2024, vol. 75, issue 7, 1343-1346

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.

Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2023.2244529 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tjorxx:v:75:y:2024:i:7:p:1343-1346

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1080/01605682.2023.2244529

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().