scientific article; zbMATH DE number 1534501

zbMath0958.90068MaRDI QIDQ4517279

Vladimir V. Servakh

Publication date: 21 November 2000

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

zbMATH Keywords

scheduling problemNP-hardness problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (8)

Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources ⋮ The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable ⋮ Multi-core processor scheduling with respect to data bus bandwidth ⋮ On the calendar planning problem with renewable resource ⋮ Construction of cyclic schedules in presence of parallel machines ⋮ On scheduling credited projects ⋮ Computational complexity of some scheduling problems with multiprocessor tasks ⋮ On some implementations of solving the resource constrained project scheduling problems

This page was built for publication: