Metaheuristics for multi-mode capital-constrained project payment scheduling (Q2253378): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 16:57, 17 December 2024

scientific article

Language	Label	Description	Also known as
English	Metaheuristics for multi-mode capital-constrained project payment scheduling	scientific article

Statements

scholarly article

0 references

Metaheuristics for multi-mode capital-constrained project payment scheduling (English)

0 references

0 references

0 references

0 references

European Journal of Operational Research

0 references

publication date

27 July 2014

0 references

zbMATH Keywords

project scheduling

0 references

payments

0 references

net present value

0 references

capital constraint

0 references

metaheuristics

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

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

0 references

Handbook on Scheduling

0 references

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

0 references

Resource-constrained project scheduling: Notation, classification, models, and methods

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

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

0 references

Scheduling projects to maximize net present value -- the case of time-dependent, contingent cash flows

0 references

Future paths for integer programming and links to artificial intelligence

0 references

Interactive analysis of multiple-criteria project scheduling problems

0 references

A survey of variants and extensions of the resource-constrained project scheduling problem

0 references

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

0 references

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

0 references

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

0 references

Resource-constrained project scheduling: A survey of recent developments.

0 references

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

0 references

Simulated annealing for multi-mode resource-constrained project scheduling

0 references

Client‐contractor bargaining on net present value in project scheduling with limited resources

0 references

PSPLIB -- a project scheduling problem library

0 references

Equation of State Calculations by Fast Computing Machines

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

A flexible heuristic for a multi-mode capital constrained project scheduling problem with probabilistic cash inflows

0 references

Cash Flows in Networks

0 references

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

0 references

DSS for multiobjective project scheduling

0 references

An exact algorithm for project scheduling with multiple modes

0 references

The Impact of Contractor Behavior on the Client’s Payment-Scheduling 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

Using metaheuristics in multiobjective resource constrained project scheduling

0 references

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

0 references

Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation

0 references

Project scheduling with finite or infinite number of activity processing modes -- a survey

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.EJOR.2012.07.014

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2253378

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