Scheduling divisible loads with time and cost constraints

DOI10.1007/s10951-019-00626-6zbMath1480.90130OpenAlexW2991221536WikidataQ128213532 ScholiaQ128213532MaRDI QIDQ2066693

Maciej Drozdowski, Natalia V. Shakhlevich

Publication date: 14 January 2022

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-019-00626-6

zbMATH Keywords

computational complexitylinear programmingdivisible load scheduling

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling for parallel processing
• A geometric view of parametric linear programming
• Distributed processing of divisible jobs with communication startup costs
• An Algorithm for Large Zero-One Knapsack Problems
• Scheduling Position-Dependent Maintenance Operations

This page was built for publication: Scheduling divisible loads with time and cost constraints