Order-based neighborhoods for project scheduling with nonregular objective functions.
From MaRDI portal
Publication:1399577
DOI10.1016/S0377-2217(02)00765-8zbMath1040.90018OpenAlexW2002341966MaRDI QIDQ1399577
Jürgen Zimmermann, Christoph Schwindt, Klaus Neumann
Publication date: 30 July 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00765-8
Related Items (5)
Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars ⋮ A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags ⋮ The total adjustment cost problem: applications, models, and solution algorithms ⋮ Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems ⋮ Simulated annealing and tabu search for multi-mode project payment scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A comparison of stochastic scheduling rules for maximizing project net present value
- An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations
- Project network models with discounted cash flows a guided tour through recent developments
- Optimal resource leveling using non-serial dynamic programming
- A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows
- Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
- Problem space search algorithms for resource-constrained project scheduling
- A steepest ascent approach to maximizing the net present value of projects
- A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
- Active and stable project scheduling
- Exact and truncated branch-and-bound procedures for resource-constrained project scheduling with discounted cash flows and general temporal constraints.
- Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Resource levelling for projects with schedule-dependent time windows
- Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling
- A simulated annealing algorithm for resource constrained project scheduling problems
- A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash Flows
- Search Heuristics for Resource Constrained Project Scheduling
- Cash Flows in Networks
- Minimizing Resource Availability Costs in Time-Limited Project Networks
- Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling
- Project scheduling with time windows and scarce resources. Temporal and resource-constrained project scheduling with regular and nonregular objective functions
This page was built for publication: Order-based neighborhoods for project scheduling with nonregular objective functions.
