scientific article

From MaRDI portal

Publication:3033546

Jump to:navigation, search

zbMath0691.90041MaRDI QIDQ3033546

Irina N. Lushchakova, Vitaly A. Strusevich

Publication date: 1989

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

makespan polynomial-time algorithm preemption resource constraints arbitrary processing times two machine open nonpreemptive scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

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

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3033546&oldid=16063742"