A heuristic approach for capacity expansion of packet networks

Article Abstract:

A fast heuristic solution method for multiperiod network capacity expansion is proposed. The method is based on the Flow Deviation routing algorithm. The approach determines a myopic expansion plan based on single period heuristics, which are subsequently rescheduled for economies of scale effects. It enables the focus to be shifted to more realistically sized problems.

Methods, Capacity management (Computers), Capacity management (Information technology)

---

On the open-shop problem with preemption and minimizing the average completion time

Article Abstract:

A study examines an open-shop problem where all machine orders and job orders have to be determined in a way that would minimize the average completion time. New models of scheduling problems with preemption are presented, and computational experiments are used to demonstrate the quality of algorithms.

Genetic algorithms

---

Analysis of heuristic solutions to the best choice problem

Article Abstract:

In the sequential decision-making task known as the best choice problem, n items are presented in a random order one at a time. The Decision makerEs (DM) goal is to select the best of all n items without the possibility of recalling previously observed items.

Decision-making, Decision making, Usage, Optimal stopping (Mathematical statistics)

Similar abstracts:

• Abstracts: The project scheduling polyhedron: dimension, facets and lifting theorems. On the design of a finite-capacity queue with phase-type service times and hysteretic control
• Abstracts: A victory for rationality: homosexuals. Justice in Los Angeles. Inadmissable evidence: the Rodney King case
• Abstracts: First and second order characterizations of pseudolinear functions. Multicriteria optimization of an emulsion polymerization process
• Abstracts: On the existence of a unique price equilibrium for models of product differentiation. Existence of equilibrium and comparative statics in differentiated goods Cournot oligopolies
• Abstracts: Three approximation algorithms for solving the generalized segregated storage problem. The interactive analysis of the multicriteria shortest path problem by the reference point method

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.