Lower bounds for on-line single-machine scheduling

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.299, Iss.1, 2003-04, pp. : 439-450

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Decomposition in single-machine scheduling

By Szwarc W.

Annals of Operations Research, Vol. 83, Iss. 1, 1998-01 ,pp. : 271-287

Springer Publishing Company

Access to resources Recommend Favorite

Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem

By Della Croce Federico Grosso Andrea Paschos Vangelis Th.

Journal of Scheduling, Vol. 7, Iss. 1, 2004-01 ,pp. : 85-91

Springer Publishing Company

Access to resources Recommend Favorite

Scheduling for stability in single-machine production systems

By Leus Roel Herroelen Willy

Journal of Scheduling, Vol. 10, Iss. 3, 2007-06 ,pp. : 223-235

Springer Publishing Company

Access to resources Recommend Favorite

Comments on “Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine”

By Tao Jiping Chao Zhijun Xi Yugeng

Journal of Global Optimization, Vol. 49, Iss. 2, 2011-02 ,pp. : 359-362

Springer Publishing Company

Access to resources Recommend Favorite

Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment

By Brucker P. Knust S.

Annals of Operations Research, Vol. 115, Iss. 1-4, 2002-09 ,pp. : 147-172

Springer Publishing Company

Access to resources Recommend Favorite