Um algoritmo exato para o problema de programação de projetos com custo de disponibilidade de recursos e múltiplos modos

DOI10.1590/S0101-74382007000100003zbMath1161.90401OpenAlexW1971297790MaRDI QIDQ3625796

Denise Sato Yamashita, Reinaldo Morabito

Publication date: 22 May 2009

Published in: Pesquisa Operacional (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1590/s0101-74382007000100003

zbMATH Keywords

project schedulingexact algorithmresource availability costmultiples modestradeoff between cost and deadline

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Uses Software

• PSPLIB

Cites Work

• PSPLIB -- a project scheduling problem library
• Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Project scheduling under limited resources. Models, methods, and applications
• Scatter search for project scheduling with resource availability cost
• Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time
• Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
• Optimization guided lower and upper bounds for the resource investment problem
• Minimizing Resource Availability Costs in Time-Limited Project Networks

This page was built for publication: Um algoritmo exato para o problema de programação de projetos com custo de disponibilidade de recursos e múltiplos modos