Scheduling coupled tasks on parallel identical machines

DOI10.1007/S11590-023-02014-8MaRDI QIDQ6492456zbMATH OpenFDO

Authors Mostafa Khatami, Daniel Oron, Amir Salehipour

Publication date 25 April 2024

Published in Optimization Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11590-023-02014-8

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• Coupled task scheduling with time-dependent processing times
• Approximating coupled-task scheduling problems with equal exact delays
• Approximation algorithms for coupled task scheduling minimizing the sum of completion times
• An exact algorithm for scheduling identical coupled tasks
• Identical coupled task scheduling: polynomial complexity of the cyclic case

Cites work

• A binary search algorithm for the general coupled task scheduling problem
• A note on scheduling identical coupled tasks in logarithmic time
• Coupled task scheduling with exact delays: literature review and models
• Coupled task scheduling with time-dependent processing times
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On the complexity of coupled-task scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Patient scheduling in hemodialysis service
• Scheduling coupled tasks
• Scheduling coupled-operation jobs with exact time-lags

Cited in

(2)

• On the inapproximability of two-machine open shop scheduling with exact delays
• On the inapproximability of two-machine open shop scheduling with exact delays

This page was built for publication: Scheduling coupled tasks on parallel identical machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6492456)