Solving the resource constrained project scheduling problem with optimization subroutine library
type: Item
instance of: scholarly article
title: Solving the resource constrained project scheduling problem with optimization subroutine library
zbMATH Open document ID: 0854.90079
DOI: 10.1016/0305-0548(95)00074-7
author: Oya Icmeli
author: Walter O. Rom
published in: Computers \& Operations Research
publication date: 1997-01-19T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 909737
zbMATH Keywords: partially renewable resources
zbMATH Keywords: optimization subroutine library
zbMATH Keywords: resource constrained project scheduling
zbMATH Keywords: makespan
MaRDI profile type: Publication
full work available at URL: 0305-0548(95)00074-7
OpenAlex ID: W2058090285
cites work: Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
cites work: A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
cites work: Nonpreemptive scheduling of independent tasks with prespecified processor allocations
cites work: Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach
cites work: A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows
cites work: Early-tardy cost trade-offs in resource constrained projects with cash flows: An optimization-guided heuristic approach
cites work: Scheduling a project to maximize its net present value: An integer programming approach
cites work: A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash Flows
cites work: Q3999851
cites work: Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
description: scientific article; zbMATH DE number 909737