Готові списки джерел за темами / Minimization of task time

Добірка наукової літератури з теми "Minimization of task time"

Автор: Grafiati
Опубліковано: 30 травня 2022
Оновлено: 31 травня 2022

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Minimization of task time".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Minimization of task time"

1

Maqsood, Maria, Saima Anwar Lashari, Murtaja Ali Saare, Sari Ali Sari, Yaqdhan Mahmood Hussein, and Hatem Oday Hatem. "Minimization Response Time Task scheduling Algorithm." IOP Conference Series: Materials Science and Engineering 705 (December 2, 2019): 012008. http://dx.doi.org/10.1088/1757-899x/705/1/012008.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Hemamalini, M., and M. V. "Response Time Minimization Task Scheduling Algorithm." International Journal of Computer Applications 145, no. 1 (July 15, 2016): 9–14. http://dx.doi.org/10.5120/ijca2016910532.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Kasprowicz, T. "Methods of Allocation of Task Teams to the Planned Works." Archives of Civil Engineering 65, no. 2 (June 1, 2019): 91–105. http://dx.doi.org/10.2478/ace-2019-0021.

Повний текст джерела
Анотація:
Abstract Small construction objects are often built by standard task teams. The problem is, how to allocate these teams to individual works? To solve the problem of allocation three methods have been developed. The first method allows to designate optimal allocation of teams to the individual works in deterministic conditions of implementation. As a criterion of the optimal allocation can be applied: “the minimization of time” or “the minimization of costs” of works execution. The second method has been developed analogously for both criteria but for stochastic conditions and for the stochastic data. The third method allows to appoint a compromise allocation of teams. In this case, the criteria “the minimization of time” and “the minimization of costs” are considered simultaneously. The method can be applied in deterministic or stochastic conditions of works implementation. The solutions of the allocation problems which have been described allow to designate the optimal allocation of task teams and to determine the schedule and cost of works execution.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Kumar, Arvind, and Bashir Alam. "Task Scheduling in Real Time Systems with Energy Harvesting and Energy Minimization." Journal of Computer Science 14, no. 8 (August 1, 2018): 1126–33. http://dx.doi.org/10.3844/jcssp.2018.1126.1133.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Maravelias, Christos T., and Ignacio E. Grossmann. "Minimization of the Makespan with a Discrete-Time State−Task Network Formulation." Industrial & Engineering Chemistry Research 42, no. 24 (November 2003): 6252–57. http://dx.doi.org/10.1021/ie034053b.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Asim, Muhammad, Wali Khan Mashwani, and Ahmed A. Abd El-Latif. "Energy and task completion time minimization algorithm for UAVs-empowered MEC SYSTEM." Sustainable Computing: Informatics and Systems 35 (September 2022): 100698. http://dx.doi.org/10.1016/j.suscom.2022.100698.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Zhou, Junlong, Tongquan Wei, Mingsong Chen, Jianming Yan, Xiaobo Sharon Hu, and Yue Ma. "Thermal-Aware Task Scheduling for Energy Minimization in Heterogeneous Real-Time MPSoC Systems." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 35, no. 8 (August 2016): 1269–82. http://dx.doi.org/10.1109/tcad.2015.2501286.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Meng, Kaitao, Deshi Li, Xiaofan He, and Mingliu Liu. "Space Pruning Based Time Minimization in Delay Constrained Multi-Task UAV-Based Sensing." IEEE Transactions on Vehicular Technology 70, no. 3 (March 2021): 2836–49. http://dx.doi.org/10.1109/tvt.2021.3061243.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Zhang, Bingxin, Guopeng Zhang, Shuai Ma, Kun Yang, and Kezhi Wang. "Efficient Multitask Scheduling for Completion Time Minimization in UAV-Assisted Mobile Edge Computing." Mobile Information Systems 2020 (June 17, 2020): 1–11. http://dx.doi.org/10.1155/2020/8791030.

Повний текст джерела
Анотація:
Mobile edge computing (MEC) can alleviate the computing resource shortage problem of mobile user equipment (UEs). However, due to long communication distance or the obstruction of big obstacles, the direct communication link may not exist between a UE and a MEC node. It thus hinders the task offloading in MEC. Unmanned aerial vehicles (UAVs) have high degree of mobility and can carry lightweight computation and storage modules. This paper presents a UAV-assisted MEC method, in which the UAV can relay the task-input data of a UE to the MEC node and can also utilize the airborne computation and storage resource to shorten the execution time of the offloaded tasks. Considering the strict order dependency among multiple offloaded tasks, this paper optimizes the task scheduling and the UAV flight path in a joint manner. A heuristic algorithm based on particle swarm optimization (PSO) is also developed to find the optimal solution. The simulation results show that the proposed multitask scheduling method can always find the best tradeoff between the UAV’s position and the wireless channel condition. In comparison to the other three baseline scheduling methods, the proposed method can use the minimum execution time to complete all the offloaded tasks.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Fazal, Nayyer, Muhammad Tahir Khan, Shahzad Anwar, Javaid Iqbal, and Shahbaz Khan. "Task allocation in multi-robot system using resource sharing with dynamic threshold approach." PLOS ONE 17, no. 5 (May 4, 2022): e0267982. http://dx.doi.org/10.1371/journal.pone.0267982.

Повний текст джерела
Анотація:
Task allocation is a fundamental requirement for multi-robot systems working in dynamic environments. An efficient task allocation algorithm allows the robots to adjust their behavior in response to environmental changes such as fault occurrences, or other robots’ actions to increase overall system performance. To address these challenges, this paper presents a Task Allocation technique based on a threshold level which is an accumulative value aggregated by a centralized unit using the Task-Robot ratio and the number of the available resource in the system. The threshold level serves as a reference for task acceptance and the task acceptance occurs despite resource shortage. The deficient resources for the accepted task are acquired through an auction process using objective minimization. Despite resource shortage, task acceptance occurs. The threshold approach and the objective minimization in the auction process reduce the overall completion time and increase the system’s resource utilization up to 96%, which is demonstrated theoretically and validated through simulations and real experimentation.
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Дисертації з теми "Minimization of task time"

1

Мартинюк, Юлія Юріївна. "Інформаційна система планування ресурсів ІТ-проєктів". Master's thesis, КПІ ім. Ігоря Сікорського, 2020. https://ela.kpi.ua/handle/123456789/39853.

Повний текст джерела
Анотація:
Магістерська дисертація: 110 с., 24 рис., 23 табл., 81 джерело, 1 додаток. Актуальність. На сьогодні стрімко зростає рівень складності об'єктів автоматизації підприємств різних сфер діяльності. Це пояснюється тим, що замовники висувають все більш специфічні вимоги до інформаційних систем для задоволення потреб підприємства. На цей час ІТ-галузь є однією з перспективніших сфер людської діяльності. Невід’ємною складовою якої є реалізація різних ІТ-проєктів від замовників з усього світу. Успішне виконання проєктів залежить від їх ефективного управління. Успішність проєкту залежить від низки показників, що визначають його сутність та впливають на стан проєкту протягом його життєвого циклу. Ця сукупність елементів проєкту по суті є об'єктами управління. Історія різноманітних підходів до питання управління проектами має вже п'ять тисяч років за своєю тривалістю, хоча перша згадка про управління проектами була наведена ще на початку 20 століття. Основоположниками управління проєктами можна назвати таких трьох вчених: Генрі Гант (1861–1919) — американський інженер, який у 1910 році створив та впровадив підхід календарного планування, де основою побудови діаграм стали горизонтальні елементи. Власне, його винахід такого планування пізніше стали називати діаграмою Ганта. Фредерік Уінслоу Тейлор (1856–1915) – американський інженер, математик та фізик, його роботи і досі використовують як прототипи сучасних різних інструментів, куди також входить ієрархічна структура його робіт. Анрі Файоль (1841–1925) — французький інженер, засновник головної класичної моделі управління проєктом. Став доволі відомим завдяки тому, що саме він описав 5 головних функцій управління (менеджменту), які, власне, і стали основою теорії управління проєктами. Теоретичні аспекти досліджень щодо управління проєктами містяться у працях таких українських та зарубіжних вчених, як, зокрема О.О. Кулінич, С.Д. Бушуєв, Ю.С. Грисюк, І.В. Кононенко, В.І. Максимова, В.Б. Силова, Є.К. Корноушенко, О.Г. Тімінський, В.І. Прангішвілі, Долорес Шервуд Стайгер, Ю.М. Теслі, Паула Мартін, Карел Тейт, Л.А. Заде, Деніз Колонна д’Істріа. У своїх працях вони висвітлювали питання розробки інформаційних технологій в проєктному менеджменті. Причиною актуальності ефективного процесу планування є необхідність збільшення людського потенціалу для вирішення унікальних задач. Доволі часто компанії реалізовують одночасно одразу декілька проектів, в яких задіяні одні й ті самі людські чи технічні ресурси. Автоматизація цього процесу може збільшити ефективність роботи компанії в цілому. На сьогоднішній день існує безліч прикладів підвищення ефективності, шляхом автоматизації монотонної ручної роботи. Зв'язок роботи з науковими програмами, планами, темами. Робота виконувалась на кафедрі автоматизованих систем обробки інформації та управління Національного технічного університету України «Київський політехнічний інститут ім. Ігоря Сікорського» в рамках теми «Ефективні методи розв’язання задач теорії розкладів» (№ ДР 0117U000919). Метою дослідження є підвищення ефективності виконання ІТ-проєктів в компанії, за рахунок створення інформаційної системи планування ресурсів ІТ-проектів, в основу якої покладені методи, що дозволяють мінімізувати час реалізації проєкту. Для досягнення поставленої мети необхідно виконати наступні завдання: − виконати аналітичний огляд та провести детальний аналіз існуючих систем планування ресурсів, управління проєктами, керування обмеженнями та ризиками у рамках проєкту, методів планування розкладів виконання завдань у межах ресурсних обмежень; − розробити алгоритми розв’язання задачі підтримки роботи системи планування ресурсів ІТ-проєктів; − дослідити ефективність розроблених алгоритмів; − розробити програмну реалізацію інформаційної системи планування ресурсів ІТ-проєктів; − виконати експериментальне дослідження розробленої інформаційної системи, методів розв’язання задачі та ефективність використаних алгоритмів. Об’єктом дослідження є процес управління ІТ-проєктами. Предметом дослідження є методи планування ресурсів ІТ-проектів. Методи дослідження. Для виконання поставлених завдань у роботі було використано методи: системного аналізу (при проектуванні інформаційної системи); теорії розкладів, дослідження операцій, теорії складності (при розробленні методів розв’язання задач розподілу ресурсів); комп’ютерного моделювання (при експериментальному дослідженні ефективності методів розв’язання задач розподілу ресурсів). Наукова новизна одержаних результатів полягає у побудові методу планування ресурсів, з урахуванням їх обмеженності, ризиків та аналізу; розробці та вдосконаленню алгоритмів розв’язання задачі за допомогою виконання експериментальних досліджень. Публікації. Матеріали роботи опубліковані у збірнику П’ятнадцятої міжнародної науково-практичної конференції МАТЕМАТИЧНЕ ТА ІМІТАЦІЙНЕ МОДЕЛЮВАННЯ СИСТЕМ (МОДС 2020), а також в матеріалах V всеукраїнської науково-практичної конференції молодих вчених та студентів «Інформаційні системи та технології управління» (ІСТУ-2020).
Master's dissertation: 110 pp., 24 figs., 23 tables, 81 sources, 1 appendix. Topicality. Today, the level of complexity of automation facilities of enterprises in various fields of activity is growing rapidly. This is due to the fact that customers are increasingly specific requirements for information systems to meet the needs of the enterprise. Currently, the IT industry is one of the most promising areas of human activity. An integral part of which is the implementation of various IT projects from customers around the world. Successful project implementation depends on their effective management. The success of a project directly depends on a number of indicators that determine its essence and affect the state of the project during its life cycle. This set of project elements are essentially objects of management. The history of various approaches to project management is five thousand years old, although the first mention of project management was given in the early 20th century. The founders of project management can be called the main three scientists: Henry Gant (1861–1919) was an American engineer who in 1910 created and implemented a calendar planning approach in which horizontal elements became the basis for constructing diagrams. In fact, his invention of such planning was later called the Gantt chart. Frederick Winslow Taylor (1856-1915) - American engineer, mathematician and physicist, his work is still used as prototypes of various modern tools, which includes the hierarchical structure of his work. Henri Fayol (1841–1925) was a French engineer who founded the main classical project management model. He became quite famous due to the fact that he described the 5 main functions of management (management), which, in fact, became the basis of the theory of project management. Theoretical aspects of research on project management are contained in the works of such Ukrainian and foreign scientists as, in particular, OO Kulinich, SD Bushuyev, Yu.S. Грисюк, І.В. Kononenko, VI Максимова, В.Б. Силова, Є.К. Корноушенко, О.Г. Timinsky, VI Prangishvili, Dolores Sherwood Steiger, Yu.M. Tesla, Paula Martin, Karel Tate, L.A. Zade, Denise Colonna d’Istria. In their works, they covered the development of information technology in project management. The reason for the relevance of an effective planning process is the need to increase human capacity to solve unique problems. Quite often companies implement several projects at the same time, which involve the same human or technical resources. Automating this process can increase the efficiency of the company as a whole. To date, there are many examples of efficiency by automating monotonous manual work. Connection of work with scientific programs, plans, themes. The work was performed at the Department of Automated Information Processing and Control Systems of the National Technical University of Ukraine "Kyiv Polytechnic Institute. Igor Sikorsky ”in the framework of the topic "Effective methods for solving problems of schedule theory" (№ DR 0117U000919). The purpose of the study is to increase the efficiency of IT projects in the company, by creating an information system for resource planning of IT projects, which is based on methods that minimize the time of project implementation. To achieve this goal it is necessary to perform the following tasks:  perform an analytical review and conduct a detailed analysis of existing systems of resource planning, project management, management of constraints and risks within the project, methods of planning schedules for tasks within resource constraints;  develop algorithms for solving the problem of supporting the work of the resource planning system of IT projects;  investigate the effectiveness of the developed algorithms;  develop software implementation of information system for resource planning of IT projects;  perform an experimental study of the developed information system, methods of solving the problem and the effectiveness of the algorithms used. The object of research is the process of planning IT project resources. The subject of research - there are methods of automation of resource planning of IT projects. The research methods used in this paper are based on methods for solving the problem of resource planning. The scientific novelty of the obtained results is to build a method of resource planning, taking into account their limitations, risks and analysis; development and improvement of algorithms for solving the problem by performing experimental research. Publications. Materials of the work are published in the collection of the Fifteenth International Scientific and Practical Conference MATHEMATICAL AND SIMULATION MODELING OF SYSTEMS (MODS 2020), as well as in the materials of the V All-Ukrainian Scientific and Practical Conference of Young Scientists and Students "Management and Technology" Information.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Jacobsen, Marianne. "Real Time Drag Minimization." Licentiate thesis, Stockholm : Department of Aeronautical and Vehicle Engineering, Royal Institute of Technology, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4114.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Fergusson, Janel. "Time judgments in dual-task conditions." Thesis, University of British Columbia, 2010. http://hdl.handle.net/2429/27745.

Повний текст джерела
Анотація:
Every day we complete a number of tasks which require us to accurately time events, from estimating how long it will take us to drive to work in the morning to steeping our afternoon tea for the correct duration. Although timing is very important in our everyday lives, we know relatively little about how we process time information. Many models have been proposed to account for human timing, with the most prominent are the attentional gate model (AGM) and the multiple resources model. The AGM and the multiple resources model make many similar predictions about human timing, and it is often difficult to discriminate between the two. Toward this goal, the present research focused on a situation in which the two models make opposing predictions, that is, conditions which require participants two carry out two tasks concurrently with both of them requiring time-related processing.. Three experiments are reported, in which subjects were asked to estimate various shorter or longer intervals while concurrently carrying out a task that either required processing of time-related information or non-time based information. Results of all three studies seem more supportive of the multiple resources model of timing, rather than the AGM.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Ozdemir, Secil. "An Adaptive Fast Time Radar Receiving Filter For Minimization Of Clutter And Time Side-lobes." Master's thesis, METU, 2013. http://etd.lib.metu.edu.tr/upload/12615325/index.pdf.

Повний текст джерела
Анотація:
In this thesis, a maximum likelihood receiver to obtain the target range profile that uses the clutter prediction derived from the target-free previous observations is suggested as a fast time processor for pulse compression radar systems. The maximum likelihood receiver is proposed to overcome the range sidelobe problem, which is introduced by the pulse compression method. Conventional methods, such as the matched filter receiver, as fast time processor result in the targets with high radar cross sec- tion masking the low radar cross section targets at the neighboring range cells
since sidelobes of the matched filter is determined by the autocorrelation of the spreading code and linearly proportional to target signal power. An unbiased estimator, like the maximum likelihood receiver in this thesis work does not su&crarr
er from such issues. In addition to that, to suppress the signal dependent interference, namely the clutter, at the output of fast time processor
the previous target-free observations are col- lected and utilized to predict the clutter signal for next time instant. This prediction is used in the maximum likelihood receiver. The clutter prediction is done for the stationary case and the internal clutter motion case, and their SINR performances with the maximum likelihood receiver are evaluated. In conclusion, such an approach managed to have an unbiased estimation of target range profile and the clutter suppression advantage in the fast time.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Abenius, Erik. "Time-Domain Inverse Electromagnetic Scattering using FDTD and Gradient-based Minimization." Licentiate thesis, KTH, Numerical Analysis and Computer Science, NADA, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-1751.

Повний текст джерела
Анотація:

The thesis addresses time-domain inverse electromagneticscattering for determining unknown characteristics of an objectfrom observations of the scattered .eld. Applications includenon-destructive characterization of media and optimization ofmaterial properties, for example the design of radar absorbingmaterials.A nother interesting application is the parameteroptimization of subcell models to avoid detailed modeling ofcomplex geometries.

The inverse problem is formulated as an optimal controlproblem where the cost function to be minimized is thedi.erence between the estimated and observed .elds, and thecontrol parameters are the unknown object characteristics. Theproblem is solved in a deterministic gradient-basedoptimization algorithm using a parallel 2D FDTD scheme for thedirect problem.This approach is computationally intensive sincethe direct problem needs to be solved in every optimizationiteration in order to compute an estimated .eld.H ighlyaccurate analytical gradients are computed from the adjointformulation.In addition to giving better accuracy than .nitedi.erences, the analytical gradients also have the advantage ofonly requiring one direct and one adjoint problem to be solvedregardless of the number of parameters.

When absorbing boundary conditions are used to truncate thecomputational domain, the equations are non-reversible and theentire time-history of the direct solution needs to be storedfor the gradient computation.Ho wever, using an additionaldirect simulation and a restart procedure it is possible tokeep the storage at an acceptable level.

The inverse method has been successfully applied to a widerange of industrial problems within the European project,IMPACT (Inverse Methods for Wave Propagation Applications inTime-Domain).T he results presented here includecharacterization of layered dispersive media, determination ofparameters in subcell models for thin sheets and narrow slotsand optimization problems where the observed .eld is given bydesign objectives.

Стилі APA, Harvard, Vancouver, ISO та ін.
6

Cordes, Brian G. "Modeling-based minimization of time-to-uniformity in microwave heating systems." Link to electronic thesis, 2007. http://www.wpi.edu/Pubs/ETD/Available/etd-050607-202823/.

Повний текст джерела
Анотація:
Thesis (M.S.) -- Worcester Polytechnic Institute.
Keywords: uniformity of heating; optimization; optimal process; modeling; microwave pulsing; microwave heating; FDTD method; coupled problem. Includes bibliographical references (leaves 50-59).
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Mudrova, Lenka. "Task scheduling and merging in space and time." Thesis, University of Birmingham, 2017. http://etheses.bham.ac.uk//id/eprint/7872/.

Повний текст джерела
Анотація:
Every day, robots are being deployed in more challenging environments, where they are required to perform complex tasks. In order to achieve these tasks, robots rely on intelligent deliberation algorithms. In this thesis, we study two deliberation approaches – task scheduling and task planning. We extend these approaches in order to not only deal with temporal and spatial constraints imposed by the environment, but also exploit them to be more efficient than the state-of-the-art approaches. Our first main contribution is a scheduler that exploits a heuristic based on Allen’s interval algebra to prune the search space to be traversed by a mixed integer program. We empirically show that the proposed scheduler outperforms the state of the art by at least one order of magnitude. Furthermore, the scheduler has been deployed on several mobile robots in long-term autonomy scenarios. Our second main contribution is the POPMERX algorithm, which is based on merging of partially ordered temporal plans. POPMERX first reasons with the spatial and temporal structure of separately generated plans. Then, it merges these plans into a single final plan, while optimising the makespan of the merged plan. We empirically show that POPMERX produces better plans that the-state-ofthe- art planners on temporal domains with time windows.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Buckman, Noam (Noam M. ). "Decentralized task allocation for dynamic, time-sensitive tasks." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/120195.

Повний текст джерела
Анотація:
Thesis: S.M., Massachusetts Institute of Technology, Department of Mechanical Engineering, 2018.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 103-110).
In time-sensitive and dynamic missions, autonomous vehicles must respond quickly to new information and objectives. In the case of dynamic task allocation, a team of agents are presented with a new, unknown task that must be allocated with their original allocations. This is exacerbated further in decentralized settings where agents are limited to utilizing local information during the allocation process. This thesis presents a fully decentralized, dynamic task allocation algorithm that extends the Consensus-Based Bundle Algorithm (CBBA) to allow for allocating new tasks. Whereas static CBBA requires a full resetting of previous allocations, CBBA with Partial Replanning (CBBA-PR) enables the agents to only partially reset their allocations to efficiently and quickly allocate a new task. By varying the number of existing tasks that are reset during replan, the team can trade-off convergence speed with amount of coordination. By specifically choosing the lowest bid tasks for resetting, CBBA-PR is shown to converge linearly with the number of tasks reset and the network diameter of the team. In addition, limited replanning methods are presented for scenarios without sufficient replanning time. These include a single reset bidding procedure for agents at capacity, a no-replanning heuristic that can identify scenarios that does not require replanning, and a subteam formation algorithm for reducing the network diameter. Finally, this thesis describes hardware and simulation experiments used to explore the effects of ad-hoc, decentralized communication on consensus algorithms and to validate the performance of CBBA-PR.
by Noam Buckman.
S.M.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Mshololo, Felix Hlanganani Engelbert. "The time management task of the school principal." Thesis, University of Zululand, 2014. http://hdl.handle.net/10530/1408.

Повний текст джерела
Анотація:
A thesis submitted to the Faculty of Education in partial fulfilment of the requirements for the Degree of Master of Education in the Department of Social Science Education at the University of Zululand, South Africa, 2014
Effective time utilisation leads to greater freedom to use time as one would like to: to do more of the things one has always wanted to do; in short to enjoy life more. Like in any other business organisation, time for planning, organising, leading and controlling is managed carefully. The principal needs time to perform all the above mentioned tasks. In this study, the author accentuates that it is disconcerting that from time to time, there are schools that do not even have a time table when the schools open at the beginning of the year. It would be interesting to know how much time might be wasted as a result of a lack of planning, lack of priorities, paperwork and reading, meetings, unclear objectives, procrastination, lack of delegation, incompetent subordinates and many other time wasters. The purpose of the study was to determine the school principal’s understanding of the time management task and explore how effective school principals manage time in performing their different tasks. Fifty principals from Phumelela and Umbumbulu Circuits, under the Umlazi District completed a survey questionnaire and semi structured interviews were conducted. The researcher was able to determine the pattern of time usage. The findings revealed that factors hampering time management include among other things meetings that principals have to attend, departmental expectations, visitors, the organisational stress, administrative obligations and inability to differentiate between urgent and important matters to attend to hampers the principal’s time management tasks. The study among other things recommended that the provincial education departments need to provide appropriate training for school governing bodies that a well organised and goal directed system should operate to control school visitors in the schools’ interest.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Incera, Burkert Sara. "THE TIME COURSE OF A BILINGUAL STROOP TASK." Cleveland State University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=csu1393608029.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Книги з теми "Minimization of task time"

1

Brummet, Dave. Trash talk: An inspirational guide to saving time and money through better waste and resource management. Baltimore: PublishAmerica, 2004.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Peg, Ballard, ed. Task time: The sound of "t". [Chanhassen, Minn.]: Child's World, Inc., 2000.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

The critical legal studies movement: Another time, a greater task. London: Verso, 2015.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Shukla, Shridhar B. Real-time execution control of task-level data-flow graphs using a compile-time approach. Monterey, Calif: Naval Postgraduate School, 1992.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Shaeffer, Blanca A. Refining a task-execution time prediction model for use in MSHN. Monterey, Calif: Naval Postgraduate School, 2000.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

McTarnaghan, Roy E. On task, on time: The development of Florida Gulf Coast University. Fort Myers, Fla: Florida Gulf Coast University, 2003.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Entropy generation minimization: The method of thermodynamic optimization of finite-size systems and finite-time processes. Boca Raton: CRC Press, 1996.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Task Force on Learning Technologies. A time to sow: Report from the Task Force on Learning technologies. Toronto, Ont: Council of Ontario Universities, 2000.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Guha, Krishnendu, Sangeet Saha, and Amlan Chakrabarti. Self Aware Security for Real Time Task Schedules in Reconfigurable Hardware Platforms. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79701-0.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Brown, Gerald J. Dynamic task scheduling for the Knowledge Worker System. Champaign, IL: U.S. Army Construction Engineering Research Laboratory, 1996.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Частини книг з теми "Minimization of task time"

1

Finta, Lucian, and Zhen Liu. "Makespan minimization of task graphs with random task running times." In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 125–38. Providence, Rhode Island: American Mathematical Society, 1995. http://dx.doi.org/10.1090/dimacs/021/10.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Manohara, H. T., and B. P. Harish. "Geometric Programming (GP) Based Processor Energy Minimization Model for DVS Enabled Real-Time Task Set System." In Communications in Computer and Information Science, 438–52. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-91244-4_35.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Bianco, L., and P. Dell'Olmo. "The minimization of resource costs in scheduling independent tasks with fixed completion time." In System Modelling and Optimization, 783–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/bfb0035528.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Zgurovsky, Michael Z., and Alexander A. Pavlov. "The Total Weighted Completion Time of Tasks Minimization with Precedence Relations on a Single Machine." In Combinatorial Optimization Problems in Planning and Decision Making, 291–344. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-98977-8_7.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Becchetti, Luca, Stefano Leonardi, Alberto Marchetti-Spaccamela, and Kirk Pruhs. "Flow Time Minimization." In Encyclopedia of Algorithms, 320–22. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_146.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Becchetti, Luca, Stefano Leonardi, Alberto Marchetti-Spaccamela, and Kirk Pruhs. "Flow Time Minimization." In Encyclopedia of Algorithms, 766–68. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_146.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Wolter, Katinka. "Task Completion Time." In Stochastic Models for Fault Tolerance, 13–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11257-7_2.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Tang, Yue, Nan Guan, and Wang Yi. "Real-Time Task Models." In Handbook of Real-Time Computing, 1–19. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-4585-87-3_29-1.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Buttazzo, Giorgio C. "Aperiodic Task Scheduling." In Hard Real-Time Computing Systems, 53–78. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4614-0676-1_3.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Buttazzo, Giorgio C. "Periodic Task Scheduling." In Hard Real-Time Computing Systems, 79–118. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4614-0676-1_4.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Minimization of task time"

1

Chen, Jian-Jia. "Task Set Synthesis with Cost Minimization for Sporadic Real-Time Tasks." In 2013 IEEE 34th Real-Time Systems Symposium (RTSS). IEEE, 2013. http://dx.doi.org/10.1109/rtss.2013.42.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Wang, Jai-Ping, and Carl W. Steidley. "Task allocation model for minimization of completion time in distributed computer systems." In Optical Tools for Manufacturing and Advanced Automation, edited by David P. Casasent. SPIE, 1993. http://dx.doi.org/10.1117/12.150221.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Ariffin, W. N. M., and S. Salleh. "Bi-partition approach of directed cyclic task graph onto multicolumn processors for total completion time minimization task assignment problem." In INTERNATIONAL CONFERENCE ON MATHEMATICS, ENGINEERING AND INDUSTRIAL APPLICATIONS 2016 (ICoMEIA2016): Proceedings of the 2nd International Conference on Mathematics, Engineering and Industrial Applications 2016. Author(s), 2016. http://dx.doi.org/10.1063/1.4965192.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Sundar, Sowndarya, Jaya Prakash Champati, and Ben Liang. "Completion Time Minimization in Multi-User Task Scheduling with Heterogeneous Processors and Budget Constraints." In 2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS). IEEE, 2018. http://dx.doi.org/10.1109/iwqos.2018.8624150.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Ozkan, Metin, Ahmet Yazici, Muzaffer Kapanoglu, and Osman Parlaktuna. "A genetic algorithm for task completion time minimization for multi-robot sensor-based coverage." In 2009 IEEE International Conference on Control Applications (CCA). IEEE, 2009. http://dx.doi.org/10.1109/cca.2009.5281055.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Zhong, Xiliang, and Cheng-Zhong Xu. "System-wide energy minimization for real-time tasks." In the 2006 IEEE/ACM international conference. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1233501.1233606.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Shriyam, Shaurya, and Satyandra K. Gupta. "Task Assignment and Scheduling for Mobile Robot Teams." In ASME 2018 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/detc2018-86007.

Повний текст джерела
Анотація:
Most complex missions comprise of spatially separated tasks which have to be finished using teams of mobile robots. The main challenges for planning such missions are forming effective coalitions among available robots and assigning them to tasks in such a way that the expected mission completion time is minimized. Our model allows task execution by a fraction of the assigned team even when the rest of the team has not yet arrived at the task location. We also allow tasks to be interrupted and robots of assigned teams to be rescheduled from an unfinished task to another task. We describe five different heuristic algorithms to compute schedules for all robots assigned to the mission. We compare them and analyze the computational performance of the best performing strategy. We also show how to handle uncertainty that may arise during traveling or task execution and then study the effect of varying uncertainty on the minimization of mission completion time.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Cao, Kun, Junlong Zhou, Min Yin, Tongquan Wei, and Mingsong Chen. "Static Thermal-Aware Task Assignment and Scheduling for Makespan Minimization in Heterogeneous Real-Time MPSoCs." In 2016 International Symposium on System and Software Reliability (ISSSR). IEEE, 2016. http://dx.doi.org/10.1109/isssr.2016.026.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Chen, Jian-Jia, Chia-Mei Hung, and Tei-Wei Kuo. "On the Minimization fo the Instantaneous Temperature for Periodic Real-Time Tasks." In 2007 IEEE Real-Time & Embedded Technology and Applications Symposium. IEEE, 2007. http://dx.doi.org/10.1109/rtas.2007.21.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Gross, João Luiz Grave, and Cláudio Fernando Fernando Resin Geyer. "A cost efficient model for minimizing energy consumption and processing time for IoT tasks in a Mobile Edge Computing environment." In Simpósio Brasileiro de Computação Ubíqua e Pervasiva. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/sbcup.2020.11210.

Повний текст джерела
Анотація:
In a scenario with increasingly mobile devices connected to the Internet, data-intensive applications and energy consumption limited by battery capacity, we propose a cost minimization model for IoT devices in a Mobile Edge Computing (MEC) architecture with the main objective of reducing total energy consumption and total elapsed times from task creation to conclusion. The cost model is implemented using the TEMS (Time and Energy Minimization Scheduler) scheduling algorithm and validated with simulation. The results show that it is possible to reduce the energy consumed in the system by up to 51.61% and the total elapsed time by up to 86.65% in the simulated cases with the parameters and characteristics defined in each experiment.
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Minimization of task time"

1

Scott, Harry D., and Jr. Joint Task Force Headquarters -- Time For Permanency? Fort Belvoir, VA: Defense Technical Information Center, February 1997. http://dx.doi.org/10.21236/ada326623.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Nelson, W. T., Merry M. Roe, Robert S. Bolia, and Rebecca M. Morley. Assessing Simulator Sickness in a See-Through HMD: Effects of Time Delay, Time on Task, and Task Complexity. Fort Belvoir, VA: Defense Technical Information Center, January 2000. http://dx.doi.org/10.21236/ada430344.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Fisher, Donna, Paul Fortier, David Hughes, and Mayford Roark. DBSSG Predictable Real-Time Information Systems Task Group. Fort Belvoir, VA: Defense Technical Information Center, February 1995. http://dx.doi.org/10.21236/ada291950.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Swaminathan, Vishnu, and Krishnendu Chakrabarty. Real-Time Task Scheduling for Energy-Aware Embedded Systems. Fort Belvoir, VA: Defense Technical Information Center, January 2005. http://dx.doi.org/10.21236/ada439593.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Bakhtiari, Sasan. Task 1. Monitoring real time materials degradation. NRC extended In-situ and real-time Monitoring. Office of Scientific and Technical Information (OSTI), March 2012. http://dx.doi.org/10.2172/1252705.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Sousa, Joao P., and David Garlan. Beyond Desktop Management: Scaling Task Management in Space and Time. Fort Belvoir, VA: Defense Technical Information Center, August 2004. http://dx.doi.org/10.21236/ada457874.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Clayton, Alan B. A Standing Joint Task Force: It is Time for a Virtual Solution. Fort Belvoir, VA: Defense Technical Information Center, February 2002. http://dx.doi.org/10.21236/ada400932.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Huang, Hui-Min. Hierarchical real-time control task decomposition for a coal mining automation project. Gaithersburg, MD: National Institute of Standards and Technology, 1990. http://dx.doi.org/10.6028/nist.ir.90-4271.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Borger, Mark W. VAXELN Experimentation: Programming a Real-Time Periodic Task Dispatcher Using VAXELN Ada 1.1. Fort Belvoir, VA: Defense Technical Information Center, November 1987. http://dx.doi.org/10.21236/ada200612.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Zhang, Ying, and Krishnendu Chakrabarty. Task Feasibility Analysis and Dynamic Voltage Scaling in Fault-Tolerant Real-Time Embedded Systems. Fort Belvoir, VA: Defense Technical Information Center, January 2004. http://dx.doi.org/10.21236/ada439598.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Також вас можуть зацікавити розширені добірки на тему "Minimization of task time" для конкретних типів джерел:
Статті в журналах Дисертації Книги
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії