scientific article; zbMATH DE number 3333906
From MaRDI portal
Publication:5611549
zbMath0209.51802MaRDI QIDQ5611549
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (10)
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ A result on generalized Latin rectangles ⋮ Time slot scheduling of compatible jobs ⋮ Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs ⋮ Partially concurrent open shop scheduling with integral preemptions ⋮ A survey on the existence ofG-Designs ⋮ Edge Coloring and Decompositions of Weighted Graphs ⋮ A language and a program for stating and solving combinatorial problems ⋮ Short solution of Kotzig's problem for bipartite graphs ⋮ A generalized class-teacher model for some timetabling problems
This page was built for publication:
