Scheduling jobs to minimize a convex function of resource usage
From MaRDI portal
Cites work
- A Class of Nonlinear Integer Programs Solvable by a Single Linear Program
- Deadline scheduling of tasks with ready times and resource constraints
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- Minimizing the number of machines for scheduling jobs with equal processing times
- Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
- Network flows. Theory, algorithms, and applications.
- Non-preemptive scheduling in a smart grid model and its implications on machine minimization
- On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals
- Optimising makespan and energy consumption in task scheduling for parallel systems
- Parallel machine problems with equal processing times: a survey
- Performance of global load balancing by local adjustment
- Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
- Resource leveling in a machine environment
- Scheduling equal-length jobs on identical parallel machines
- Scheduling for electricity cost in a smart grid
- Scheduling jobs with equal processing times and time windows on identical parallel machines
- Semi-matchings for bipartite graphs and load balancing
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
This page was built for publication: Scheduling jobs to minimize a convex function of resource usage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979403)
