scientific article; zbMATH DE number 370525

DOI10.1002/1520-6750(199308)40:5%3C665::AID-NAV3220400509%3E3.0.CO;2-JzbMATH Open0776.90039MaRDI QIDQ4201451FDOQ4201451

Elliott N. Weiss, Scott E. Sampson

Publication date: 25 August 1993

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 7656034
• A local constraint based analysis approach to project scheduling under general resource constraints
• Local search methods for the discrete time/resource trade-off problem in project networks
• Problem space search algorithms for resource-constrained project scheduling
• PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem
• Genetic local search for resource-constrained project scheduling under uncertainty
• scientific article
• A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem

zbMATH Keywords

local searchprecedence and resource constraintssingle project network

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Tabu Search Applied to the Quadratic Assignment Problem
• Simulated annealing: A tool for operational research

Cited In (14)

• Title not available (Why is that?)
• Experimental investigation of heuristics for resource-constrained project scheduling: an update
• The impact of solution representations on heuristic net present value optimization in discrete time/cost trade-off project scheduling with multiple cash flow and payment models
• Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
• Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Scheduling and constraint propagation
• Justification technique generalizations
• Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling
• LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
• Title not available (Why is that?)
• Tabu search for resource-constrained scheduling
• Order-based neighborhoods for project scheduling with nonregular objective functions.
• A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4201451)