scientific article

zbMath0970.90029MaRDI QIDQ2729351

K. N. Kashyrskikh, Alexander V. Kononov, I. D. Chernykh, Sergey Sevast'janov

Publication date: 22 July 2001

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

zbMATH Keywords

polynomial solvabilitytwo-stage problemefficient schedulingthree-machine open shop problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

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: