Multitasking scheduling with alternate periods

DOI10.1007/S10878-023-01020-XMaRDI QIDQ2697142zbMATH OpenOpenAlexFDO

Authors Yujia Huo, Cuixia Miao, Fanyu Kong, Yuzhong Zhang

Publication date 18 April 2023

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-023-01020-x

zbMATH Keywords

approximation algorithmstrongly NP-hardpseudo-polynomial-time algorithmmultitasking scheduling

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• Multitasking via alternate and shared processing: algorithms and complexity
• Scheduling Periodic Tasks
• Multitasking scheduling problems with two competitive agents
• Due date assignment and two-agent scheduling under multitasking environment
• Scheduling jobs on a single machine with periodic release date/deadline intervals

Cites work

• Approximation algorithms for the single-machine scheduling with a period of maintenance
• Due date assignment and two-agent scheduling under multitasking environment
• Machine scheduling with an availability constraint
• Multitasking via alternate and shared processing: algorithms and complexity

Cited in

(4)

• Multitasking via alternate and shared processing: algorithms and complexity
• scientific article; zbMATH DE number 2119734 (Why is no real title available?)
• Scheduling independent tasks with multiple modes
• Scheduling Periodic Tasks with Slack

This page was built for publication: Multitasking scheduling with alternate periods

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