Asymptotic Performance Ratio of an Online Algorithm for the Single Machine Scheduling With Release Dates

DOI10.1109/TAC.2004.825984zbMath1365.90134OpenAlexW2110488455MaRDI QIDQ5273759

Cheng-Feng Mabel Chou

Publication date: 12 July 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2004.825984

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (3)

On-line production order scheduling with preemption penalties ⋮ A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection ⋮ An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time

This page was built for publication: Asymptotic Performance Ratio of an Online Algorithm for the Single Machine Scheduling With Release Dates