Simulated annealing and tabu search for multi-mode project payment scheduling (Q1042041)

From MaRDI portal

Revision as of 05:44, 2 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Simulated annealing and tabu search for multi-mode project payment scheduling	scientific article

Statements

scholarly article

0 references

Simulated annealing and tabu search for multi-mode project payment scheduling (English)

0 references

0 references

0 references

0 references

0 references

European Journal of Operational Research

0 references

publication date

7 December 2009

0 references

zbMATH Keywords

project scheduling

0 references

progress payments

0 references

net present value

0 references

simulated annealing

0 references

tabu search

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2008.10.005

0 references

Network decomposition-based benchmark results for the discrete time-cost tradeoff problem

0 references

0 references

Resource-constrained project scheduling by simulated annealing

0 references

A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.

0 references

Project Scheduling with Discounted Cash Flows and Progress Payments

0 references

A simulated annealing algorithm for resource constrained project scheduling problems

0 references

Decision CPM: Network Reduction and Solution

0 references

On modelling payments in projects

0 references

A two stage search heuristic for scheduling payments in projects

0 references

Project Contracts and Payment Schedules: The Client's Problem

0 references

The discrete time-cost tradeoff problem revisited

0 references

Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks

0 references

Optimal procedures for the discrete time/cost trade-off problem in project networks

0 references

New computational results on the discrete time/cost trade-off problem in project networks

0 references

An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations

0 references

Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach

0 references

The scheduling of activities to maximize the net present value of projects

0 references

The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)

0 references

Solving time/cost trade-off problems with discounted cash flows using generalized benders decomposition

0 references

Scheduling project activities to maximize the net present value the case of linear time-dependent cash flows

0 references

The payment scheduling problem

0 references

Multi-mode project payment scheduling problems with bonus-penalty structure

0 references

Computational experience with an optimal procedure for the scheduling of activities to maximize the net present value of projects

0 references

Project network models with discounted cash flows a guided tour through recent developments

0 references

A Dynamic Programming Algorithm for Decision CPM Networks

0 references

A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows

0 references

A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash Flows

0 references

Maximizing the net present value of a project under resource constraints using a Lagrangian relaxation based heuristic with tight upper bounds

0 references

PSPLIB -- a project scheduling problem library

0 references

Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems

0 references

Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models

0 references

Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times

0 references

Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints

0 references

Order-based neighborhoods for project scheduling with nonregular objective functions.

0 references

Early-tardy cost trade-offs in resource constrained projects with cash flows: An optimization-guided heuristic approach

0 references

Heuristic scheduling of resource-constrained projects with cash flows

0 references

0 references

Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems

0 references

A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling

0 references

A Dynamic Programming Solution to Cost-Time Tradeoff for CPM

0 references

Cash Flows in Networks

0 references

A steepest ascent approach to maximizing the net present value of projects

0 references

A branch and bound algorithm for scheduling projects to maximize net present value: The case of time dependent, contingent cash flows

0 references

Scheduling programs with repetitive projects: A comparison of a simulated annealing, a genetic and a pair-wise swap algorithm

0 references

Tabu Search Applied to the Quadratic Assignment Problem

0 references

Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem

0 references

The Impact of Contractor Behavior on the Client’s Payment-Scheduling Problem

0 references

On the discrete time, cost and quality trade-off problem

0 references

Using tabu search to schedule activities of stochastic resource-constrained projects

0 references

An equitable approach to the payment scheduling problem in project management

0 references

Four payment models for the multi-mode resource constrained project scheduling problem with discounted cash flows

0 references

New computational results for the discrete time/cost trade-off problem with time-switch constraints

0 references

Maximizing the net present value of a project with linear time-dependent cash flows

0 references

On Maximizing the Net Present Value of a Project Under Renewable Resource Constraints

0 references

Progress payments in project scheduling problems.

0 references

Discrete-continuous project scheduling with discounted cash flows - a tabu search approach

0 references

Scheduling a project to maximize its net present value: An integer programming approach

0 references

A comparison of stochastic scheduling rules for maximizing project net present value

0 references

Connectionist approaches for solver selection in constrained project scheduling

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.ejor.2008.10.005

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1042041

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1042041&oldid=35141521"