scientific article
From MaRDI portal
Publication:2744381
zbMath0983.90018MaRDI QIDQ2744381
Martin Harborth, Per Willenius, Heidemarie Bräsel
Publication date: 19 September 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Orthogonal arrays, Latin squares, Room squares (05B15) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (2)
The representation of partially-concurrent open shop problems ⋮ New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan
This page was built for publication:
