Order-based neighborhoods for project scheduling with nonregular objective functions.
From MaRDI portal
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.
Recommendations
Cites work
- A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash Flows
- A comparison of stochastic scheduling rules for maximizing project net present value
- A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
- A simulated annealing algorithm for resource constrained project scheduling problems
- A steepest ascent approach to maximizing the net present value of projects
- A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows
- Active and stable project scheduling
- Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
- An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations
- Cash Flows in Networks
- Exact and truncated branch-and-bound procedures for resource-constrained project scheduling with discounted cash flows and general temporal constraints.
- scientific article; zbMATH DE number 1594562 (Why is no real title available?)
- scientific article; zbMATH DE number 1594565 (Why is no real title available?)
- scientific article; zbMATH DE number 4135692 (Why is no real title available?)
- scientific article; zbMATH DE number 370525 (Why is no real title available?)
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- scientific article; zbMATH DE number 1488068 (Why is no real title available?)
- scientific article; zbMATH DE number 1416513 (Why is no real title available?)
- Minimizing Resource Availability Costs in Time-Limited Project Networks
- Network flows. Theory, algorithms, and applications.
- Optimal resource leveling using non-serial dynamic programming
- Problem space search algorithms for resource-constrained project scheduling
- Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints
- Project network models with discounted cash flows a guided tour through recent developments
- Project scheduling with time windows and scarce resources. Temporal and resource-constrained project scheduling with regular and nonregular objective functions
- Resource levelling for projects with schedule-dependent time windows
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Search Heuristics for Resource Constrained Project Scheduling
- Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling
- Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling
Cited in
(6)- Simulated annealing and tabu search for multi-mode project payment scheduling
- Scheduling under the network of temporo-spatial proximity relationships
- Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems
- Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars
- The total adjustment cost problem: applications, models, and solution algorithms
- A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags
This page was built for publication: Order-based neighborhoods for project scheduling with nonregular objective functions.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399577)
