Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource

DOI10.1515/amcs-2016-0048zbMath1347.90049OpenAlexW2525377510MaRDI QIDQ328919

Grzegorz Waligóra, Rafal Rózycki, Jan Weglarz

Publication date: 21 October 2016

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/amcs-2016-0048

zbMATH Keywords

machine schedulingmakespanmathematical programmingcontinuous resourcepreemptable jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (1)

A hybrid scheduler for many task computing in big data systems

Cites Work

• Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines
• Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan
• Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results
• A new polynomial-time algorithm for linear programming
• Resource level minimization in the discrete-continuous scheduling
• Single machine scheduling problem with a common deadline and resource dependent release dates
• A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
• Multiple resource leveling in construction systems through variation of activity intensities
• Time-Optimal Control of Resource Allocation in a Complex of Operations Framework
• Handbook on Scheduling

This page was built for publication: Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource