Multitasking scheduling with alternate periods

DOI10.1007/S10878-023-01020-XOpenAlexW4362723996MaRDI QIDQ2697142FDOQ2697142

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

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

zbMATH Keywords

approximation algorithmstrongly NP-hardpseudo-polynomial-time algorithmmultitasking scheduling

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

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

Cited In (4)

• Title not available (Why is that?)
• Scheduling Periodic Tasks with Slack
• Multitasking via alternate and shared processing: algorithms and complexity
• Scheduling independent tasks with multiple modes

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)