A note on scheduling coupled tasks for minimum total completion time

DOI10.1007/S10479-022-04706-3zbMath1506.90105OpenAlexW4224296565MaRDI QIDQ2678608

Wiesław X. Kubiak

Publication date: 23 January 2023

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-022-04706-3

zbMATH Keywords

complexitytotal completion timecoupled tasks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

On the complexity of open shop scheduling with time lags

Cites Work

• Scheduling coupled tasks with exact delays for minimum total job completion time
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on scheduling coupled tasks for minimum total completion time