Online Scheduling with Machine Cost and a Quadratic Objective Function

DOI10.1007/978-3-030-38919-2_17zbMath1440.68338OpenAlexW2999061814MaRDI QIDQ3297768

Dávid Kószó, György Dósa, János A. Csirik

Publication date: 20 July 2020

Published in: SOFSEM 2020: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-38919-2_17

zbMATH Keywords

schedulingonline algorithmsanalysis of algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• The generalization of scheduling with machine cost
• New upper and lower bounds for online scheduling with machine cost
• Online algorithms for scheduling with machine activation cost on two uniform machines
• Online scheduling with general machine cost functions
• Semi-online scheduling with machine cost.
• Scheduling with machine cost and rejection
• Online scheduling with machine cost and rejection
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• Better Online Algorithms for Scheduling with Machine Cost
• Minimizing a Quadratic Cost Function of Waiting Times in Single-Machine Scheduling

This page was built for publication: Online Scheduling with Machine Cost and a Quadratic Objective Function