On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost

DOI10.1007/978-3-642-29344-3_41zbMath1252.68048OpenAlexW1817173252MaRDI QIDQ2894490

Wiebke Höhn, Tobias Jacobs

Publication date: 29 June 2012

Published in: LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29344-3_41

Mathematics Subject Classification ID

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

Related Items (5)

The local-global conjecture for scheduling with non-linear cost ⋮ Optimal Algorithms and a PTAS for Cost-Aware Scheduling ⋮ On the complexity of the single machine scheduling problem minimizing total weighted delay penalty ⋮ For the airplane refueling problem local precedence implies global precedence ⋮ A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems

This page was built for publication: On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost