scientific article; zbMATH DE number 3744539

MaRDI QIDQ3929043zbMATH OpenFDO

Authors Peter Brucker

Publication date 1981

zbMATH Keywords

algorithms for scheduling tasks in multiprocessor environmentscomplexity of scheduling problemsscheduling independent tasks

Mathematics Subject Classification ID

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

Cited in

(2)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3929043)