scheduling theory
Recently Published Documents


TOTAL DOCUMENTS

159
(FIVE YEARS 23)

H-INDEX

23
(FIVE YEARS 1)

2021 ◽  
Vol 13 (24) ◽  
pp. 13749
Author(s):  
Natalia Sergeevna Shushunova ◽  
Elena Anatolyevna Korol ◽  
Nikolai Ivanovich Vatin

The research object is the installation process of modular green roofs with planters placed on the concrete roof’s surface. These roofs effectively reduce rainfall disposal, prolong the lifespan of the roof coating, and enhance urban aesthetic and recreational spaces. Green roofs reduce houses’ gas emissions and increase green spaces in densely built areas. The spatial–technological model was developed for the proposed modular green roof based on network planning, scheduling theory, and graph theory. The sequence and composition of technological processes and operations were established for the installation process. The functional model of installing a modular green roof has been developed. The model makes it possible to optimise the principles of saving labour contribution (working hours) and time.


Author(s):  
Frank Slomka ◽  
Mohammadreza Sadeghi

AbstractWe investigate the mathematical properties of event bound functions as they are used in the worst-case response time analysis and utilization tests. We figure out the differences and similarities between the two approaches. Based on this analysis, we derive a more general form do describe events and event bounds. This new unified approach gives clear new insights in the investigation of real-time systems, simplifies the models and will support algebraic proofs in future work. In the end, we present a unified analysis which allows the algebraic definition of any scheduler. Introducing such functions to the real-time scheduling theory will lead two a more systematic way to integrate new concepts and applications to the theory. Last but not least, we show how the response time analysis in dynamic scheduling can be improved.


2021 ◽  
Vol 20 (5s) ◽  
pp. 1-26
Author(s):  
Jinghao Sun ◽  
Nan Guan ◽  
Rongxiao Shi ◽  
Guozhen Tan ◽  
Wang Yi

Research on modeling and analysis of real-time computing systems has been done in two areas, model checking and real-time scheduling theory. In model checking, an expressive modeling formalism such as timed automata (TA) is used to model complex systems, but the analysis is typically very expensive due to state-space explosion. In real-time scheduling theory, the analysis techniques are highly efficient, but the models are often restrictive. In this paper, we aim to exploit the possibility of applying efficient analysis techniques rooted in real-time scheduling theory to analysis of real-time task systems modeled by timed automata with tasks (TAT). More specifically, we develop efficient techniques to analyze the feasibility of TAT-based task models (i.e., whether all tasks can meet their deadlines on single-processor) using demand bound functions (DBF), a widely used workload abstraction in real-time scheduling theory. Our proposed analysis method has a pseudo-polynomial time complexity if the number of clocks used to model each task is bounded by a constant, which is much lower than the exponential complexity of the traditional model-checking based analysis approach (also assuming the number of clocks is bounded by a constant). We apply dynamic programming techniques to implement the DBF-based analysis framework, and propose state space pruning techniques to accelerate the analysis process. Experimental results show that our DBF-based method can analyze a TAT system with 50 tasks within a few minutes, which significantly outperforms the state-of-the-art TAT-based schedulability analysis tool TIMES.


Author(s):  
Jacek Blazewicz ◽  
Benjamin Moseley ◽  
Erwin Pesch ◽  
Denis Trystram ◽  
Guochuan Zhang
Keyword(s):  

2020 ◽  
pp. 90-101
Author(s):  
Андрей Владимирович Байков ◽  
Константин Валерьевич Александров

Применение одного робототехнического средства (РТС) в зоне чрезвычайной ситуации (ЧС) малоэффективно из-за множества выполняемых задач, что обусловливает необходимость привлечения группы РТС для уменьшения времени ликвидации ЧС. В статье представлена математическая модель выбора группы РТС для ликвидации ЧС. Разработанная модель комплексной оценки эффективности проведения аварийно-спасательных работ при групповом применении РТС в техногенной ЧС является научно-методическим аппаратом по обоснованию состава группировки системы РТС МЧС России, необходимых для выполнения задач в ЧС. The use of one robotic in the emergency zone is not very effective due to the multitude of tasks performed in the emergency zone. This determines the need to use the group of robotics to reduce the time for emergency elimination. The relevance of the work is determined by the scattered scientific and methodological system for substantiating the composition of the robotics grouping of the Ministry of Emergency Situations of Russia, as well as by errors in decision making on the use of robotics in emergencies. The paper presents a mathematical model for choosing a group of robotic equipment for emergency response. The model for integrated assessment of the rescue operation effectiveness with application of group of robotics is based on the “scheduling theory”. The paper proposes scientific methods for the development of quantitatively substantiated recommendations for decision-making, where mathematical models of ordering various purposeful actions in time are constructed and analyzed taking into account the objective function and different restrictions. The developed model for integrated assessment of the effectiveness of emergency rescue operations at group application of robotics during technogenic emergency is a scientific and methodological approach for substantiating the structure of robotics grouping of EMERCOM of Russia required to solve tasks in an emergency.


2020 ◽  
Vol 6 (4) ◽  
pp. 499-517
Author(s):  
A. M. Gorbachev ◽  

The analysis of scientifi c publications and timetable models is given. Existing works have been used as a basis of a classification of timetables by the frequency of time values. The urban transport network is presented in the form of a multigraph. The transition from a multigraph of the urban transport network to a network of events characterizing the traffi c process is considered. Constraints on time values have been formalized to solve the main problem of the scheduling theory. The proposed formalization factors in the specifi cs of traffic management planning in Russia and other post-Soviet countries. A mathematical model of aperiodic timetables for the ground urban electric transport traffic based on the theory of linear programming is presented. The optimization criterion for solving the main problem of the scheduling theory has been substantiated. The uniformity of traffi c intervals is used as an optimization criterion for solving the main problem of the scheduling theory. The article provides tabular timetables used in urban transport to describe the traffi c process in the absence of significant events on the line. The implementation of the model presented in this article is exemplified by the automated tram and trolleybus timetable design software being part of the automated urban electric transport control system currently used in Saint Petersburg to form tram and trolleybus timetables. The examples of calculating the vehicle departure interval diagrams have been used to demonstrate the function of aligning the traffi c intervals. In conclusion, the advantages and development paths of the proposed model of aperiodic timetables for the ground urban electric transport traffic are listed


Author(s):  
Aysun Pınarbaşı ◽  
Tareq Babaqi ◽  
Béla Vizvári

ABSTRACT Objectives: The purpose of this study is to analyze a strategy for the assignment and transportation of injured patients to hospital to decrease the demand on transportation, in both predisaster and postdisaster periods, on the Anatolian side of Istanbul. Methods: Two approaches are used in this study: a Voronoi diagram, and a heuristic approach to the problem of scheduling. A Voronoi diagram is used to divide the city into 74 regions, where each hospital has a certain region of responsibility. The transportation strategy of 1 hospital is modeled by minimizing the makespan (ie, the maximal completion time) and the work-in-process, which are used as different objectives in scheduling theory. Results: The total waiting time of 100 injured people was minimized to 13,036 min when a total of 3 vehicles was used in the studied region, on the Asian side of Istanbul. The transportation capacity and total operating capacity of the hospitals should be approximately equal. Conclusions: The people of Istanbul will be in a safer position if the suggested measures are implemented. This is an important consideration, as Istanbul is situated in a region where serious earthquakes are possible at any moment.


Sign in / Sign up

Export Citation Format

Share Document