Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
type: Item
instance of: scholarly article
title: Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
zbMATH Open document ID: 0938.90030
DOI: 10.1016/S0377-2217(97)00442-6
author: Yanyan Li
published in: European Journal of Operational Research
publication date: 1999-11-08T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1358472
zbMATH Keywords: scheduling theory
zbMATH Keywords: project management
zbMATH Keywords: bounding techniques
describes a project that uses: PSPLIB
describes a project that uses: Algorithm 520
describes a project that uses: Bison
MaRDI profile type: Publication
cites work: Some efficient multi-heuristic procedures for resource-constrained project scheduling
cites work: A branch and bound algorithm for the resource-constrained project scheduling problem
cites work: Une méthode arborescente pour résoudre les problèmes cumulatifs
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: New Benchmark Results for the Resource-Constrained Project Scheduling Problem
cites work: On the use of the complexity index as a measure of complexity in activity networks
cites work: A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
cites work: An Additive Bounding Procedure for Combinatorial Optimization Problems
cites work: Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
cites work: Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
cites work: Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
cites work: An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
cites work: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
cites work: An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
cites work: An investigation into the relationship of heuristic performance with network-resource characteristics
cites work: Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
description: scientific article; zbMATH DE number 1358472