Scheduling for a processor sharing system with linear slowdown

DOI10.1007/s00186-017-0583-3zbMath1380.90126arXiv1508.03136OpenAlexW1876329877MaRDI QIDQ2408895

Yoni Nazarathy, Liron Ravner

Publication date: 10 October 2017

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

global optimizationschedulingroad traffic

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

A strategic timing of arrivals to a linear slowdown processor sharing system ⋮ Fluid queues with synchronized output

Cites Work

• Unnamed Item
• Unnamed Item
• A strategic timing of arrivals to a linear slowdown processor sharing system
• Mixed-integer quadratic programming is in NP
• Near optimal control of queueing networks over a finite time horizon
• A simplex based algorithm to solve separated continuous linear programs
• The multiple phase service network with generalized processor sharing
• ?/M/1: On the equilibrium distribution of customer arrivals
• Scheduling with batching: A review
• Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
• A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
• Rational Queueing
• Sequencing with Earliness and Tardiness Penalties: A Review
• Some NP-complete problems in quadratic and nonlinear programming
• Road congestion
• Introduction to Queueing
• Integer Polynomial Optimization in Fixed Dimension
• Scheduling
• Convergence of a block coordinate descent method for nondifferentiable minimization

This page was built for publication: Scheduling for a processor sharing system with linear slowdown