An Optimal Control Framework for Online Job Scheduling with General Cost Functions

DOI10.1287/opre.2022.2321zbMath1502.90073arXiv1906.02644OpenAlexW4283267489MaRDI QIDQ5058033

No author found.

Publication date: 1 December 2022

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.02644

zbMATH Keywords

optimal controlcompetitive rationetwork flowonline job schedulinglinear programming dualitygeneralized completion timespeed augmentation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Inventory, storage, reservoirs (90B05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online weighted flow time and deadline scheduling
• (Incremental) priority algorithms
• Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems
• Approximating total flow time on parallel machines
• Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling
• Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions
• The Design of Approximation Algorithms
• Dual Techniques for Scheduling on a Machine with Varying Speed
• Competitive Algorithms from Competitive Equilibria
• Convex programming for scheduling unrelated parallel machines
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Speed is as powerful as clairvoyance
• Primal Dual Gives Almost Optimal Energy-Efficient Online Algorithms
• Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality
• On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost
• Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling
• A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation
• The Geometry of Scheduling
• Algorithms for minimizing weighted flow time
• A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems
• Online Scheduling with General Cost Functions

This page was built for publication: An Optimal Control Framework for Online Job Scheduling with General Cost Functions