Critical path in an activity network with time constraints

Article Abstract:

A linear time algorithm was developed for analyzing the flow time of each arc that is developed within the time-window constraint and the time-schedule constraint affecting project management. The linear algorithm was developed by incorporating the two types of constraint in the traditional activity network. Furthermore, the solution method was characterized as a modification of the forward pass, backward pass algorithm used for traditional activity networks.

Research, Project management, Linear programming, Scheduling (Management)

---

An overlapping cluster algorithm to provide non-exhaustive clustering

Article Abstract:

A new overlapping partitioning cluster algorithm to provide non-exhaustive and overlapping of objects in data mining is presented.

China, Clustering (Computers), Data warehousing/data mining, Data mining, Server clustering

---

Minimization of travel time and weighted number of stops in a traffic-light network

Article Abstract:

Application of heuristics for simulation of traffic management system in a city based on traffic control model is discussed.

Taiwan, Other Communications Equipment Manufacturing, Communications equipment, not elsewhere classified, Controllers, Signal, Models, Usage, Traffic controls, Traffic engineering, Heuristic, Heuristics, Electronic traffic controls

Similar abstracts:

• Abstracts: Data mining with genetic algorithms on binary trees. Using genetic algorithm for dynamic and multiple criteria web-site optimizations
• Abstracts: On the global optimal solution to an integrated inventory system with general time varying demand, production and deterioration rates
• Abstracts: A genetic algorithm for service level based vehicle scheduling. Algorithm for minimizing weighted earliness penalty in single-machine problem
• Abstracts: Pot-maker on export trail. Blue whiting trawls for top ships. Cutter frees fouled propellers
• Abstracts: Variance of throughput of an N-station production line with no intermediate buffers and time dependent failures

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