2000•Operations Research LettersRequires access

Semi-online scheduling with decreasing job sizes

Steve S. Seiden, Jiřı́ Sgall, Gerhard J. Woeginger

Open publisher page 103 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 103 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Competitive analysis, Online algorithm, Upper and lower bounds, Scheduling (production processes), Computer science, Preemption, Job shop scheduling, Flow shop scheduling

Back to paper search Browse research topics Original source

Semi-online scheduling with decreasing job sizes — Research Paper | ScholarLens