scientific article; zbMATH DE number 1560545

zbMath1030.90024MaRDI QIDQ4527315

E. Kh. Gimadi, V. V. Zalyubovskij, Sergey Sevast'janov

Publication date: 4 February 2001

Full work available at URL: http://math.nsc.ru/publishing/DAOR/daor.html

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

zbMATH Keywords

schedulingpolynomial decidabilitydirective periodswarehousing resources

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources ⋮ Complexity of the project scheduling problem with credits ⋮ Genetic algorithm for the resource-constrained project scheduling problem ⋮ Financing and reliability analysis for schedules in the project calendar planning problem ⋮ An Improved Genetic Algorithm for the Resource-Constrained Project Scheduling Problem ⋮ Unnamed Item ⋮ Complexity of Project Scheduling Problem with Nonrenewable Resources ⋮ On some implementations of solving the resource constrained project scheduling problems ⋮ Application of idempotent algebra methods in genetic algorithm for solving the scheduling problem

This page was built for publication: