2022•Computers & Operations ResearchRequires access

Complexity and approximation of open shop scheduling to minimize the makespan: A review of models and approaches

Vitaly A. Strusevich

Open publisher page 22 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 22 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: Job shop scheduling, Flow shop scheduling, Computer science, Open shop, Mathematical optimization, Scheduling (production processes), Job shop, Operations research