scientific article

zbMath0474.68052MaRDI QIDQ3929043

Peter Brucker

Publication date: 1981

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

zbMATH Keywords

complexity of scheduling problemsscheduling independent tasksalgorithms for scheduling tasks in multiprocessor environments

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Deterministic scheduling theory in operations research (90B35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items

k-optimal solution sets for some polynomially solvable scheduling problems, The job shop scheduling problem: Conventional and new solution techniques