×

Found 9 Documents (Results 1–9)

Complexity of scheduling few types of jobs on related and unrelated machines. (English) Zbl 07765376

Cao, Yixin (ed.) et al., 31st international symposium on algorithms and computation, ISAAC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 181, Article 18, 17 p. (2020).
MSC:  68Wxx

Filter Results by …

Document Type

Year of Publication

Main Field

Software