scientific article; zbMATH DE number 1305102
From MaRDI portal
Publication:4252045
zbMath0929.90040MaRDI QIDQ4252045
Ilya Tchernykh, Sergey Sevast'janov
Publication date: 17 June 1999
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
Some positive news on the proportionate open shop problem ⋮ Exponential tightness for integral-type functionals of centered independent differently distributed random variables ⋮ The three-machine proportionate open shop and mixed shop minimum makespan problems ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ The Open Shop Scheduling Problem ⋮ Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Irreducible bin packing and normality in routing open shop ⋮ A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network ⋮ Linear time approximation scheme for the multiprocessor open shop problem ⋮ Polynomial time approximation algorithms for proportionate open‐shop scheduling ⋮ Two-machine routing open shop: How long is the optimal makespan?
