scientific article; zbMATH DE number 1008459
From MaRDI portal
Publication:4336213
zbMath0885.90060MaRDI QIDQ4336213
Publication date: 22 April 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (2)
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Vyacheslav Tanaev: contributions to scheduling and related areas
This page was built for publication:
