Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques

Shioura, A., Strusevich, V.A. and Shakhlevich, N.V. orcid.org/0000-0002-5225-4008 (2024) Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques. Networks, 83 (3). pp. 527-546. ISSN 0028-3045

Abstract

Metadata

Item Type: Article
Authors/Creators:
Copyright, Publisher and Additional Information:

© 2023 The Authors. Networks published by Wiley Periodicals LLC. This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.

Keywords: maximum-flow problem; minimum-cut problem; optimality conditions; parallel-machine scheduling; preemption; scheduling under resource constraints; scheduling with controllable processing times
Dates:
  • Published: April 2024
  • Published (online): 20 December 2023
  • Accepted: 17 November 2023
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Funding Information:
Funder
Grant number
EPSRC (Engineering and Physical Sciences Research Council)
EP/T01461X/1
Depositing User: Symplectic Publications
Date Deposited: 21 Nov 2023 10:43
Last Modified: 15 Oct 2024 13:20
Status: Published
Publisher: Wiley
Identification Number: 10.1002/net.22202
Open Archives Initiative ID (OAI ID):

Export

Statistics