Multitasking scheduling with shared processing

DOI10.1002/NAV.22167MaRDI QIDQ6537208zbMATH OpenFDO

Authors Bin Fu, Yumei Huo, Hairong Zhao

Publication date 14 May 2024

Published in Naval Research Logistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/NAV.22167

zbMATH Keywords

makespanparallel machinesschedulingshared processingtotal completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Multitasking via alternate and shared processing: algorithms and complexity
• Shared multi-processor scheduling
• Shared processor scheduling of multiprocessor jobs
• Streaming algorithms for multitasking scheduling with shared processing
• scientific article; zbMATH DE number 1271325

Cites work

• Bounds on Multiprocessing Timing Anomalies
• Capacitated two-parallel machines scheduling to minimize sum of job completion times
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Front-office multitasking between service encounters and back-office tasks
• scientific article; zbMATH DE number 3364800 (Why is no real title available?)
• Multitasking via alternate and shared processing: algorithms and complexity
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel machines scheduling with nonsimultaneous machine available time
• Scheduling on machines with variable service rates
• Sequencing independent jobs with a single resource

This page was built for publication: Multitasking scheduling with shared processing

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