ES08.04 Management Algorithms
نویسندگان
چکیده
منابع مشابه
review of heuristic algorithms for water resources management
according to the current state of water resources and the increasing demand for water, the supply of future needs will be faced with serious constraints. on the one hand, the failure to supply sometimes causes social and political problems. on the other hand, improper exploitation of water resources will lead to irreparable damages. therefore, the use of optimization models for the planning of ...
متن کاملAlgorithms for railway crew management
Crew management is concerned with building the work schedules of crews needed to cover a planned timetable. This is a well-known problem in Operations Research and has been historically associated with airlines and mass-transit companies. More recently, railway applications have also come on the scene, especially in Europe. In practice, the overall crew management problem is decomposed into two...
متن کاملGenetic Algorithms in Aquifer Management
A new genetic algorithm based on multi niche crowding is capable of efficiently locating all the peaks of a multi-modal function. By associating these peaks with the utility accrued from different sets of decision variables it is possible to extend the use of genetic algorithms to multi criteria decision making problems. This concept is applied to address the problems arising in the context of ...
متن کاملGenetic Algorithms for Project Management
The scheduling of tasks and the allocation of resource in medium to large-scale development projects is an extremely hard problem and is one of the principal challenges of project management due to its sheer complexity. As projects evolve any solutions, either optimal or near optimal, must be continuously scrutinized in order to adjust to changing conditions. Brute force exhaustive or branch-an...
متن کاملBounds on Contention Management Algorithms
We present two new algorithms for contention management in transactional memory, the deterministic algorithm CommitRounds and the randomized algorithm RandomizedRounds. Our randomized algorithm is efficient: in some notorious problem instances (e.g., dining philosophers) it is exponentially faster than prior work from a worst case perspective. Both algorithms are (i) local and (ii) starvation-f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Thoracic Oncology
سال: 2019
ISSN: 1556-0864
DOI: 10.1016/j.jtho.2019.08.102