The problem of one machine with equal processing time and preemption

DOI10.33048/DAIO.2024.31.750MaRDI QIDQ7005946zbMATH OpenFDO

Authors Kseniya Andreevna Lyashkova, V. V. Servakh

Publication date 31 March 2025

Published in Diskretnyĭ Analiz i Issledovanie Operatsiĭ (Search for Journal in Brave)

Full work available at URL https://doi.org/10.33048/DAIO.2024.31.750

zbMATH Keywords

one machinepreemptionschedule theory

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3883931 (Why is no real title available?)
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• Lower and upper bounds for the preemptive single machine scheduling problem with equal processing times
• Modeling single machine preemptive scheduling problems for computational efficiency
• Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
• Scheduling
• Scheduling equal-length jobs on identical parallel machines
• Single machine scheduling with release dates

This page was built for publication: The problem of one machine with equal processing time and preemption

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