2013•Journal of SchedulingRequires access

Lower bounds for online makespan minimization on a small number of related machines

JeżŁukasz, SchwartzJarett, SgallJiří, BékésiJózsef

Open publisher page 0 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

A significance statement is not available in the OpenAlex record.

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: Job shop scheduling, Minification, Mathematical optimization, Computer science, Upper and lower bounds, Mathematics, Computer network, Mathematical analysis

Back to paper search Browse research topics Original source

Lower bounds for online makespan minimization on a small number of related machines — Research Paper | ScholarLens