A tight lower bound for the best-α algorithm

The problem of nonpreemptive scheduling with release dates on one machine to minimize a certain total completion time is considered.

Saved in:
Bibliographic Details
Published in:Information processing letters 1999-07, Vol.71 (1), p.17-22
Main Authors: TORNG, E, UTHAISOMBUT, P
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Exact sciences and technology
Information processing
Operational research and scientific management
Operational research. Management science
Scheduling
Scheduling, sequencing
Studies
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The problem of nonpreemptive scheduling with release dates on one machine to minimize a certain total completion time is considered.
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(99)00082-4