Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

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

Article Abstract:

An optimization model for the problem of scheduling a project to maximize its net present value when net cash flow is dependent on the time of realization is introduced. A simulated annealing solution approach is developed and the computational testing of different implementation strategies for this algorithm showed that neighborhood moves must be carefully selected. It is shown that improved solutions are achieved when the neighborhood move is the minimum move causing a change in the net cash flow of the chosen event.

Author: LeBlanc, Larry J., Shtub, Avraham, Etgar, Ran
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
Usage, Cash management

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Formulating and solving production planning problems

Article Abstract:

The assignment problem is a simple model depicting production planning problems on the assignment of jobs to machines. This model can be extended to the generalized assignment (GAP) and the multi-resource generalized assignment problems (MRGAP), which assumes a single agent for each task. The extensions also allow the consideration of many different actual problems and batch splitting conditions. Solution methods based on simulated annealing, genetic algorithm and Lagrangian relaxation showed optimal results.

Author: Anandalingam, G., LeBlanc, Larry J., Shtub, Avraham
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1999
Production planning, Economic lot size

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


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

Article Abstract:

The problem of scheduling the one-time production of several units of a single product is examined. To this end, the problem is modelled using two penalty cost structures to account for trade-off between the need to finish each unit by a certain due date and learning-on-the-job effects. In addition, the performances of a simulated annealing procedure, a genetic algorithm and a pair-wise swap heuristic for solving the problem are compared.

Author: LeBlanc, Larry J., Shtub, Avraham, Cai, Ziyong
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Evaluation, Cases, Algorithms

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Research, Models, Scheduling (Management), Simulated annealing (Mathematics), Operations research, Management science
Similar abstracts:
  • Abstracts: Switzerland: big deals lead to modest recovery. An abundance of deals. Swiss M&A market bucks the upward trend
  • Abstracts: Manufacturer incentives to improve retail service levels. Allocation of warehouse inventory with electronic data interchange and fixed order intervals
  • Abstracts: In fine form: life goes on as usual, only the symbols have changed. Red flag over Hong Kong
  • Abstracts: Young Turks on the move. Indirect intervention
  • Abstracts: Hopewell's canceled deal underscores Asia project woes. Foreigners contest award of Thai subway contract. Bangkok's mass-transit project is late, but Hopewell's contract stands firm
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.