Scheduling coupled tasks with exact delays for minimum total job completion time

Bo Chen () and Xiandong Zhang ()
Additional contact information
Bo Chen: University of Warwick
Xiandong Zhang: Fudan University

Journal of Scheduling, 2021, vol. 24, issue 2, No 5, 209-221

Abstract: Abstract In this paper, we fill in a conspicuous gap in research on scheduling coupled tasks. We draw a full complexity picture for single-machine scheduling of coupled tasks with exact time delays in between with the objective of minimizing the total of job completion times.

Keywords: Scheduling; Coupled task; Exact delay (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-020-00668-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jsched:v:24:y:2021:i:2:d:10.1007_s10951-020-00668-1

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-020-00668-1

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().