𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A mathematical model and a heuristic procedure for the turbine balancing problem

✍ Scribed by Yahya Fathi; Krishna K. Ginjupalli

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
512 KB
Volume
65
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A heuristic network procedure for the as
A heuristic network procedure for the assembly line balancing problem
✍ Peter A. Pinto; David G. Dannenbring; Basheer M. Khumawala πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 417 KB

## Abstract Proposed is a Heuristic Network (HN) Procedure for balancing assembly lines. The procedure uses simple heuristic rules to generate a network which is then traversed using a shortest route algorithm to obtain a heuristic solution. The advantages of the HN Procedure are: a) it generally y

Models and heuristics for a minimum arbo
Models and heuristics for a minimum arborescence problem
✍ Christophe Duhamel; Luis Gouveia; Pedro Moura; Mauricio Souza πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 194 KB

## Abstract The Minimum Arborescence problem (MAP) consists of finding a minimum cost arborescence in a directed graph. This problem is NP‐Hard and is a generalization of two well‐known problems: the Minimum Spanning Arborescence Problem (MSAP) and the Directed Node Weighted Steiner Tree Problem (D