z-logo
open-access-imgOpen Access
A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times
Author(s) -
Jiping Tao,
Zhijun Chao,
Yugeng Xi
Publication year - 2010
Publication title -
journal of industrial and management optimization
Language(s) - English
Resource type - Journals
eISSN - 1553-166X
pISSN - 1547-5816
DOI - 10.3934/jimo.2010.6.269
Subject(s) - competitive analysis , scheduling (production processes) , online algorithm , single machine scheduling , computer science , bounded function , upper and lower bounds , algorithm , simple (philosophy) , job shop scheduling , combinatorics , mathematical optimization , mathematics , mathematical analysis , philosophy , schedule , epistemology , operating system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom