Scheduling coupled tasks with exact delays for minimum total job completion time-Reference-Cited by-同舟云学术

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

Published:2020-11-03 Issue:2 Volume:24 Page:209-221
ISSN:1094-6136
Container-title:Journal of Scheduling
language:en
Short-container-title:J Sched

Author:

Chen Bo^ORCID,Zhang Xiandong^ORCID

Abstract

AbstractIn 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.

Funder

National Natural Science Foundation of China

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Management Science and Operations Research,General Engineering,Software

Link

http://link.springer.com/content/pdf/10.1007/s10951-020-00668-1.pdf

Reference21 articles.

1. Ahr, D., Bekesi, J., Galambos, G., Oswald, M., & Reinelt, G. (2004). An exact algorithm for scheduling identical coupled tasks. Mathematical Methods of Operations Research, 59, 193–203.

2. Baptiste, P. (2010). A note on scheduling identical coupled tasks in logarithmic time. Discrete Applied Mathematics, 158, 583–587.

3. Bessy, S., & Giroudeau, R. (2019). Parameterized complexity of a coupled-task scheduling problem. Journal of Scheduling, 22, 305–313.