scientific article; zbMATH DE number 370525

DOI<665::AID-NAV3220400509>3.0.CO;2-J 10.1002/1520-6750(199308)40:5<665::AID-NAV3220400509>3.0.CO;2-JzbMath0776.90039MaRDI QIDQ4201451

Elliott N. Weiss, Scott E. Sampson

Publication date: 25 August 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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)

Related Items

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, Experimental investigation of heuristics for resource-constrained project scheduling: an update, Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling, Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem, A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems, Order-based neighborhoods for project scheduling with nonregular objective functions., Scheduling and constraint propagation, Resource-constrained project scheduling: Notation, classification, models, and methods, Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem, Tabu search for resource-constrained scheduling

Cites Work

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