Order-based neighborhoods for project scheduling with nonregular objective functions.
type: Item
instance of: scholarly article
title: Order-based neighborhoods for project scheduling with nonregular objective functions.
zbMATH Open document ID: 1040.90018
DOI: 10.1016/S0377-2217(02)00765-8
author: Christoph Schwindt
author: Jürgen Zimmermann
author: Klaus Neumann
published in: European Journal of Operational Research
publication date: 2003-07-30T00:00:00Z
review text: The resource-constrained project scheduling problem with general temporal constraints (minimal and maximal time-lags) and nonregular objective functions is studied. It is shown that for certain objective functions the search for an optimal solution can be restricted to special types of schedules. Based on these results appropriate neighborhoods (based on spanning trees of order networks) are developed, which are shown to be weakly connected.
reviewed by: Sigrid Knust
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1957041
zbMATH Keywords: resource-constrained project scheduling
zbMATH Keywords: nonregular objective functions
zbMATH Keywords: neighborhoods
MaRDI profile type: Publication
cites work: Q4339078
cites work: Q3056948
cites work: Q4495168
cites work: Optimal resource leveling using non-serial dynamic programming
cites work: Q3468865
cites work: A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
cites work: Resource-constrained project scheduling: Notation, classification, models, and methods
cites work: A simulated annealing algorithm for resource constrained project scheduling problems
cites work: Minimizing Resource Availability Costs in Time-Limited Project Networks
cites work: An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations
cites work: Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling
cites work: Project network models with discounted cash flows a guided tour through recent developments
cites work: A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows
cites work: A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash Flows
cites work: Search Heuristics for Resource Constrained Project Scheduling
cites work: Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling
cites work: Problem space search algorithms for resource-constrained project scheduling
cites work: Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
cites work: Resource levelling for projects with schedule-dependent time windows
cites work: Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints
cites work: Exact and truncated branch-and-bound procedures for resource-constrained project scheduling with discounted cash flows and general temporal constraints.
cites work: Active and stable project scheduling
cites work: Project scheduling with time windows and scarce resources. Temporal and resource-constrained project scheduling with regular and nonregular objective functions
cites work: Cash Flows in Networks
cites work: Q4201451
cites work: Q2712371
cites work: A steepest ascent approach to maximizing the net present value of projects
cites work: A comparison of stochastic scheduling rules for maximizing project net present value
cites work: Q4943557
cites work: Q2712374
full work available at URL: s0377-2217(02)00765-8
OpenAlex ID: W2002341966
description: scientific article; zbMATH DE number 1957041