scientific article

From MaRDI portal

Publication:3858002

Jump to:navigation, search

zbMath0423.90031MaRDI QIDQ3858002

Alexander H. G. Rinnooy Kan, Jan Karel Lenstra

Publication date: 1980

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

zbMATH Keywords

computational complexity parallel machines multiprocessor scheduling polynomial algorithm precedence constraints approximation algorithms NP-hardness maximum completion time total completion time preemption tutorial survey jobs polynomial optimization algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items (2)

A better lower bound for on-line scheduling ⋮ Unnamed Item

This page was built for publication:

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