scientific article; zbMATH DE number 370525

DOI10.1002/1520-6750(199308)40:5%3C665::AID-NAV3220400509%3E3.0.CO;2-JMaRDI QIDQ4201451zbMATH OpenFDO

Authors Scott E. Sampson, Elliott N. Weiss

Publication date 25 August 1993

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)

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; zbMATH DE number 4091174
• A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem

Cites work

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

Cited in

(15)

• scientific article; zbMATH DE number 7656034 (Why is no real title available?)
• 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
• Scheduling and constraint propagation
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Justification technique generalizations
• An iterated local search algorithm for a place scheduling problem
• Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling
• LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
• Tabu search for resource-constrained scheduling
• scientific article; zbMATH DE number 3856795 (Why is no real title available?)
• 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)