subject:(scheduling AND coordination)

Delft University of Technology

1. Steenhuisen, J.R. Coordinated Multi-Agent Planning and Scheduling.

Degree: 2013, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:fc5280fd-27d9-41e1-9b5a-2bc146f1c5ef ; urn:NBN:nl:ui:24-uuid:fc5280fd-27d9-41e1-9b5a-2bc146f1c5ef ; urn:NBN:nl:ui:24-uuid:fc5280fd-27d9-41e1-9b5a-2bc146f1c5ef ; http://resolver.tudelft.nl/uuid:fc5280fd-27d9-41e1-9b5a-2bc146f1c5ef

Subjects/Keywords: coordination; planning; scheduling

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Steenhuisen, J. R. (2013). Coordinated Multi-Agent Planning and Scheduling. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:fc5280fd-27d9-41e1-9b5a-2bc146f1c5ef ; urn:NBN:nl:ui:24-uuid:fc5280fd-27d9-41e1-9b5a-2bc146f1c5ef ; urn:NBN:nl:ui:24-uuid:fc5280fd-27d9-41e1-9b5a-2bc146f1c5ef ; http://resolver.tudelft.nl/uuid:fc5280fd-27d9-41e1-9b5a-2bc146f1c5ef

Chicago Manual of Style (16^th Edition):

Steenhuisen, J R. “Coordinated Multi-Agent Planning and Scheduling.” 2013. Doctoral Dissertation, Delft University of Technology. Accessed March 05, 2021. http://resolver.tudelft.nl/uuid:fc5280fd-27d9-41e1-9b5a-2bc146f1c5ef ; urn:NBN:nl:ui:24-uuid:fc5280fd-27d9-41e1-9b5a-2bc146f1c5ef ; urn:NBN:nl:ui:24-uuid:fc5280fd-27d9-41e1-9b5a-2bc146f1c5ef ; http://resolver.tudelft.nl/uuid:fc5280fd-27d9-41e1-9b5a-2bc146f1c5ef.

MLA Handbook (7^th Edition):

Steenhuisen, J R. “Coordinated Multi-Agent Planning and Scheduling.” 2013. Web. 05 Mar 2021.

Vancouver:

Steenhuisen JR. Coordinated Multi-Agent Planning and Scheduling. [Internet] [Doctoral dissertation]. Delft University of Technology; 2013. [cited 2021 Mar 05]. Available from: http://resolver.tudelft.nl/uuid:fc5280fd-27d9-41e1-9b5a-2bc146f1c5ef ; urn:NBN:nl:ui:24-uuid:fc5280fd-27d9-41e1-9b5a-2bc146f1c5ef ; urn:NBN:nl:ui:24-uuid:fc5280fd-27d9-41e1-9b5a-2bc146f1c5ef ; http://resolver.tudelft.nl/uuid:fc5280fd-27d9-41e1-9b5a-2bc146f1c5ef.

Council of Science Editors:

Steenhuisen JR. Coordinated Multi-Agent Planning and Scheduling. [Doctoral Dissertation]. Delft University of Technology; 2013. Available from: http://resolver.tudelft.nl/uuid:fc5280fd-27d9-41e1-9b5a-2bc146f1c5ef ; urn:NBN:nl:ui:24-uuid:fc5280fd-27d9-41e1-9b5a-2bc146f1c5ef ; urn:NBN:nl:ui:24-uuid:fc5280fd-27d9-41e1-9b5a-2bc146f1c5ef ; http://resolver.tudelft.nl/uuid:fc5280fd-27d9-41e1-9b5a-2bc146f1c5ef

Delft University of Technology

2. Jonker, Tim (author). Coordinated optimization of equipment operations on a container terminal: Gecoordineerde optimalisatie van machine operaties op een container terminal.

Degree: 2018, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:4e4eb02f-abec-4cb2-a2d7-af15a67f01e6

► Increased international marine transport has increased the use of containers. This goes hand in hand with the increased demand for well-functioning container terminals. The speed… (more)

▼ Increased international marine transport has increased the use of containers. This goes hand in hand with the increased demand for well-functioning container terminals. The speed at which containers can be handled on the container terminal is an important performance indicator for container terminals. In particular, the productivity of the Quay Crane (QC)s is used to determine the performance of a container terminal. To achieve a high performance, a well designed schedule of operations is required. This research investigates to what extent a coordinated planning can contribute to increasing the QC productivity. Currently, an uncoordinated scheduling heuristic is used to dispatch the equipment operating on a container terminal. With a coordinated schedule, operations of all equipment working on the terminal can be considered at once to achieve optimal QC productivity. A Hybrid Flow Shop (HFS) model with revolutionary features is used to model the waterside of a container terminal in a coordinated way. The revolutionary features are called: bi-directional and job-pairs. The former enables jobs to move through the HFS in both directions, the latter constrains certain jobs to be performed simultaneously by a single machine. Subsequently, a tailored Simulated Annealing (SA) algorithm is used to obtain a heuristic solution to this mathematical model. The performance of the HFS model in combination with the SA algorithm is evaluated with a sophisticated and validated container terminal simulation model developed by TBA. Therefore, the SA algorithm should balance between both quality and computational time. Computational time should not be excessive since the schedule has to be adjusted frequently since operations on a container terminal vary quickly and predictions with regards to processing times are unreliable. To evaluate the performance of the coordinated schedule, it will be compared with the uncoordinated scheduling heuristic of TBA. Based on the results obtained during this research, the QC productivity whilst using TBA's uncoordinated scheduling heuristic cannot be increased with a coordinated schedule that uses a HFS to model the container terminal and a SA algorithm to solve that model (p-value 0.2731). On the other hand, it can neither be concluded that TBA's uncoordinated scheduling heuristic results in higher productivity compared to the coordinated schedule. Therefore, the coordinated schedule is a solid alternative to TBA's uncoordinated scheduling heuristic. However, it is expected that with certain changes to the coordinated schedule the QC productivity could be increased. Advisors/Committee Members: Duinkerken, Mark (mentor), Yorke-Smith, Neil (mentor), Negenborn, Rudy (mentor), de Waal, A (mentor), Delft University of Technology (degree granting institution).

Subjects/Keywords: Scheduling; Hybrid flowshop; Coordination; Simulated annealing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Jonker, T. (. (2018). Coordinated optimization of equipment operations on a container terminal: Gecoordineerde optimalisatie van machine operaties op een container terminal. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:4e4eb02f-abec-4cb2-a2d7-af15a67f01e6

Chicago Manual of Style (16^th Edition):

Jonker, Tim (author). “Coordinated optimization of equipment operations on a container terminal: Gecoordineerde optimalisatie van machine operaties op een container terminal.” 2018. Masters Thesis, Delft University of Technology. Accessed March 05, 2021. http://resolver.tudelft.nl/uuid:4e4eb02f-abec-4cb2-a2d7-af15a67f01e6.

MLA Handbook (7^th Edition):

Jonker, Tim (author). “Coordinated optimization of equipment operations on a container terminal: Gecoordineerde optimalisatie van machine operaties op een container terminal.” 2018. Web. 05 Mar 2021.

Vancouver:

Jonker T(. Coordinated optimization of equipment operations on a container terminal: Gecoordineerde optimalisatie van machine operaties op een container terminal. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2021 Mar 05]. Available from: http://resolver.tudelft.nl/uuid:4e4eb02f-abec-4cb2-a2d7-af15a67f01e6.

Council of Science Editors:

Jonker T(. Coordinated optimization of equipment operations on a container terminal: Gecoordineerde optimalisatie van machine operaties op een container terminal. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:4e4eb02f-abec-4cb2-a2d7-af15a67f01e6

Delft University of Technology

3. Yadati Narasimha, C. Coordinating autonomous planning and scheduling.

Degree: 2013, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:e7ed020a-ee53-4010-a14c-4db3ae31a01b ; urn:NBN:nl:ui:24-uuid:e7ed020a-ee53-4010-a14c-4db3ae31a01b ; urn:NBN:nl:ui:24-uuid:e7ed020a-ee53-4010-a14c-4db3ae31a01b ; http://resolver.tudelft.nl/uuid:e7ed020a-ee53-4010-a14c-4db3ae31a01b

Subjects/Keywords: coordination; scheduling; planning; decomposition

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Yadati Narasimha, C. (2013). Coordinating autonomous planning and scheduling. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:e7ed020a-ee53-4010-a14c-4db3ae31a01b ; urn:NBN:nl:ui:24-uuid:e7ed020a-ee53-4010-a14c-4db3ae31a01b ; urn:NBN:nl:ui:24-uuid:e7ed020a-ee53-4010-a14c-4db3ae31a01b ; http://resolver.tudelft.nl/uuid:e7ed020a-ee53-4010-a14c-4db3ae31a01b

Chicago Manual of Style (16^th Edition):

Yadati Narasimha, C. “Coordinating autonomous planning and scheduling.” 2013. Doctoral Dissertation, Delft University of Technology. Accessed March 05, 2021. http://resolver.tudelft.nl/uuid:e7ed020a-ee53-4010-a14c-4db3ae31a01b ; urn:NBN:nl:ui:24-uuid:e7ed020a-ee53-4010-a14c-4db3ae31a01b ; urn:NBN:nl:ui:24-uuid:e7ed020a-ee53-4010-a14c-4db3ae31a01b ; http://resolver.tudelft.nl/uuid:e7ed020a-ee53-4010-a14c-4db3ae31a01b.

MLA Handbook (7^th Edition):

Yadati Narasimha, C. “Coordinating autonomous planning and scheduling.” 2013. Web. 05 Mar 2021.

Vancouver:

Yadati Narasimha C. Coordinating autonomous planning and scheduling. [Internet] [Doctoral dissertation]. Delft University of Technology; 2013. [cited 2021 Mar 05]. Available from: http://resolver.tudelft.nl/uuid:e7ed020a-ee53-4010-a14c-4db3ae31a01b ; urn:NBN:nl:ui:24-uuid:e7ed020a-ee53-4010-a14c-4db3ae31a01b ; urn:NBN:nl:ui:24-uuid:e7ed020a-ee53-4010-a14c-4db3ae31a01b ; http://resolver.tudelft.nl/uuid:e7ed020a-ee53-4010-a14c-4db3ae31a01b.

Council of Science Editors:

Yadati Narasimha C. Coordinating autonomous planning and scheduling. [Doctoral Dissertation]. Delft University of Technology; 2013. Available from: http://resolver.tudelft.nl/uuid:e7ed020a-ee53-4010-a14c-4db3ae31a01b ; urn:NBN:nl:ui:24-uuid:e7ed020a-ee53-4010-a14c-4db3ae31a01b ; urn:NBN:nl:ui:24-uuid:e7ed020a-ee53-4010-a14c-4db3ae31a01b ; http://resolver.tudelft.nl/uuid:e7ed020a-ee53-4010-a14c-4db3ae31a01b

4. Ghimire, Jagadish. Heterogeneous Cellular Networks: From Resource Allocation To User Association.

Degree: 2015, University of Waterloo

URL: http://hdl.handle.net/10012/9276

► Heterogeneous networking paradigm addresses the ever growing need for capacity and coverage in wireless networks by deploying numerous low power base stations overlaying the existing… (more)

▼ Heterogeneous networking paradigm addresses the ever growing need for capacity and coverage in wireless networks by deploying numerous low power base stations overlaying the existing macro cellular coverage. Heterogeneous cellular networks encompass many deployment scenarios, with different backhauling techniques (wired versus wireless backhauling), different transmission coordination mechanisms and resource allocation schemes, different types of links operating at different bands and air-interface technologies, and different user association schemes. Studying these deployment scenarios and configurations, and understanding the interplay between different processes is challenging. In the first part of the thesis, we present a flow-based optimization framework that allows us to obtain the throughput performance of a heterogeneous network when the network processes are optimized jointly. This is done under a given system ``snapshot'', where the system parameters like the channel gains and the number of users are fixed and assumed known. Our framework allows us to configure the network parameters to allocate optimal throughputs to these flows in a fair manner. This is an offline-static model and thus is intended to be used at the engineering and planning phase to compare many potential configurations and decide which ones to study further. Using the above-mentioned formulation, we have been able to study a large set of deployment scenarios and different choices of resource allocation, transmission coordination, and user association schemes. This has allowed us to provide a number of important engineering insights on the throughput performance of different scenarios and their configurations. The second part of our thesis focuses on understanding the impact of backhaul infrastructure's capacity limitation on the radio resource management algorithms like user scheduling and user association. Most existing studies assume an ideal backhaul. This assumption, however, needs to be revisited as backhaul considerations are critical in heterogeneous networks due to the economic considerations. In this study, we formulate a global α-fair user scheduling problem under backhaul limitations, and show how this limitation has a fundamental impact on user scheduling. Using results from convex optimization, we characterize the solution of optimal backhaul-aware user scheduling and show that simple heuristics can be used to obtain good throughput performance with relatively low complexity/overhead. We also study the related problem of user association under backhaul-limitations. This study is a departure from our ``snapshot'' approach. We discuss several important design considerations for an online user association scheme. We present a relatively simple backhaul-unaware user association scheme and show that it is very efficient as long as the network has fine-tuned the resource allocation.

Subjects/Keywords: Heterogeneous Cellular Networks; Resource Allocation; Transmission Coordination; User Association; User Scheduling; Global alpha-fair scheduling; backhaul limitations

13 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ghimire, J. (2015). Heterogeneous Cellular Networks: From Resource Allocation To User Association. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9276

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Ghimire, Jagadish. “Heterogeneous Cellular Networks: From Resource Allocation To User Association.” 2015. Thesis, University of Waterloo. Accessed March 05, 2021. http://hdl.handle.net/10012/9276.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Ghimire, Jagadish. “Heterogeneous Cellular Networks: From Resource Allocation To User Association.” 2015. Web. 05 Mar 2021.

Vancouver:

Ghimire J. Heterogeneous Cellular Networks: From Resource Allocation To User Association. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2021 Mar 05]. Available from: http://hdl.handle.net/10012/9276.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ghimire J. Heterogeneous Cellular Networks: From Resource Allocation To User Association. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9276

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

5. Vangerven, Bart. Combinatorial auctions : theory, experiments, and practice.

Degree: 2017, Ghent University

URL: http://hdl.handle.net/1854/LU-8541000

► This doctoral dissertation contributes to theory, experiments, and practice in combinatorial auctions. Combinatorial auctions are multi-object auctions, that enable bidders to bid on packages of… (more)

▼ This doctoral dissertation contributes to theory, experiments, and practice in combinatorial auctions. Combinatorial auctions are multi-object auctions, that enable bidders to bid on packages of items. In Chapter 2, we theoretically investigate the classical winner determination problem in geometrical settings. Specifically, we consider combinatorial auctions of items that can be arranged in rows, and the objective is, given bids on subsets of items, to find a subset of bids that maximizes auction revenue. Possible practical applications include allocating pieces of land for real estate development, or seats in a theater or stadium. We investigate several geometrical structures and bid shapes, and provide either a polynomial dynamic programming algorithm or an NP-hardness proof, filling in several gaps in academic literature. In Chapter 3, we combine theory with experiments, investigating coordination and threshold problems in combinatorial auctions. Bidders on small packages of items are unable to outbid provisionally winning bids on large packages alone; despite free-rider incentives, both coordination and cooperation are required. Coordination because smaller bidders need to bid on disjoint packages, and cooperation because more than one bidder is required to outbid a larger package bid. We propose indices quantifying both the coordination and the threshold problem, that can be used in providing feedback or generating valuations for laboratory experiments. Additionally, we develop coalitional feedback that is specifically aimed at helping bidders to overcome coordination and threshold problems. We test this in an experimental setting using human bidders, varying feedback from provisionally winning bids and prices, to winning and deadness levels, and coalitional feedback. We find that in situations where threshold problems are severe, coalitional feedback increases economic efficiency, but in easy or insurmountable threshold problems that is not always the case. Finally, in Chapter 4, we combine theory with practice. Scheduling a conference, based on preferences expressed by conference participants, can be seen as a combinatorial auction with public goods. In a situation with public goods, the utility of the final selected goods (presentations scheduled in parallel) are "consumed" by all bidders (conference participants). Constructing a good conference schedule is important: they are an essential part of academic research and require significant investments (e.g. time and money) from their participants. We provide computational complexity results, along with a combined approach of assigning talks to rooms and time slots, grouping talks into sessions, and deciding on an optimal itinerary for each participant. Our goal is to maximize attendance, considering the common practice of session hopping. On a secondary level, we accommodate presenters’ availabilities. This personalized conference scheduling approach has been applied to construct the schedule of the MathSport (2013), MAPSP (2015 and 2017) and ORBEL (2017)… Advisors/Committee Members: Goossens, Dries, Spieksma, Frits.

Subjects/Keywords: Business and Economics; Combinatorial auction; computational complexity; coordination and threshold problems; laboratory experiments; conference scheduling

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Vangerven, B. (2017). Combinatorial auctions : theory, experiments, and practice. (Thesis). Ghent University. Retrieved from http://hdl.handle.net/1854/LU-8541000

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Vangerven, Bart. “Combinatorial auctions : theory, experiments, and practice.” 2017. Thesis, Ghent University. Accessed March 05, 2021. http://hdl.handle.net/1854/LU-8541000.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Vangerven, Bart. “Combinatorial auctions : theory, experiments, and practice.” 2017. Web. 05 Mar 2021.

Vancouver:

Vangerven B. Combinatorial auctions : theory, experiments, and practice. [Internet] [Thesis]. Ghent University; 2017. [cited 2021 Mar 05]. Available from: http://hdl.handle.net/1854/LU-8541000.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vangerven B. Combinatorial auctions : theory, experiments, and practice. [Thesis]. Ghent University; 2017. Available from: http://hdl.handle.net/1854/LU-8541000

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Michigan

6. Deglise-Favre-Hawkinson, Jivan. Access and Resource Management for Clinical Care and Clinical Research in Multi-class Stochastic Queueing Networks.

Degree: PhD, Industrial and Operations Engineering, 2015, University of Michigan

URL: http://hdl.handle.net/2027.42/116770

► In healthcare delivery systems, proper coordination between patient visits and the health care resources they rely upon is an area in which important new planning… (more)

▼ In healthcare delivery systems, proper coordination between patient visits and the health care resources they rely upon is an area in which important new planning capabilities are very valuable to provide greater value to all stakeholders. Managing supply and demand, while providing an appropriate service level for various types of care and patients of differing levels of urgency is a difficult task to achieve. This task becomes even more complex when planning for (i) stochastic demand, (ii) multi-class customers (i.e., patients with different urgency levels), and (iii) multiple services/visit types (which includes multi-visit itineraries of clinical care and/or clinical research visits that are delivered according to research protocols). These complications in the demand stream require service waiting times and itineraries of visits that may span multiple days/weeks and may utilize many different resources in the organization (each resource with at least one specific service being provided). The key objective of this dissertation is to develop planning models for the optimization of capacity allocation while considering the coordination between resources and patient demand in these multi-class stochastic queueing networks in order to meet the service/access levels required for each patient class. This control can be managed by allocating resources to specific patient types/visits over a planning horizon. In this dissertation, we control key performance metrics that relate to patient access management and resource capacity planning in various healthcare settings with chapters devoted to outpatient services, and clinical research units. The methods developed forecast and optimize (1) the access to care (in a medical specialty) for each patient class, (2) the Time to First Available Visit for clinical research participants enrolling in clinical trials, and (3) the access to downstream resources in an itinerary of care, which we call the itinerary flow time. We also model and control how resources are managed, by incorporating (4) workload/utilization metrics, as well as (5) blocking/overtime probabilities of those resources. We control how to allocate resource capacity along the various multi-visit resource requirements of the patient itineraries, and by doing so, we capture the key correlations between patient access, and resource allocation, coordination, and utilization. Advisors/Committee Members: Van Oyen, Mark Peter (committee member), Roessler, Blake J (committee member), Daskin, Mark Stephen (committee member), Lavieri, Mariel (committee member).

Subjects/Keywords: Capacity Planning; Access Management; Patient Scheduling; Mixed Integer Programming; Resource and Demand Coordination; Industrial and Operations Engineering; Engineering

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Deglise-Favre-Hawkinson, J. (2015). Access and Resource Management for Clinical Care and Clinical Research in Multi-class Stochastic Queueing Networks. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/116770

Chicago Manual of Style (16^th Edition):

Deglise-Favre-Hawkinson, Jivan. “Access and Resource Management for Clinical Care and Clinical Research in Multi-class Stochastic Queueing Networks.” 2015. Doctoral Dissertation, University of Michigan. Accessed March 05, 2021. http://hdl.handle.net/2027.42/116770.

MLA Handbook (7^th Edition):

Deglise-Favre-Hawkinson, Jivan. “Access and Resource Management for Clinical Care and Clinical Research in Multi-class Stochastic Queueing Networks.” 2015. Web. 05 Mar 2021.

Vancouver:

Deglise-Favre-Hawkinson J. Access and Resource Management for Clinical Care and Clinical Research in Multi-class Stochastic Queueing Networks. [Internet] [Doctoral dissertation]. University of Michigan; 2015. [cited 2021 Mar 05]. Available from: http://hdl.handle.net/2027.42/116770.

Council of Science Editors:

Deglise-Favre-Hawkinson J. Access and Resource Management for Clinical Care and Clinical Research in Multi-class Stochastic Queueing Networks. [Doctoral Dissertation]. University of Michigan; 2015. Available from: http://hdl.handle.net/2027.42/116770

Delft University of Technology

7. Berndt, Alexander (author). Planning and Control of Multiple Mobile Robots for Intralogistics: an optimization-based reordering strategy.

Degree: 2020, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:d70c13ac-a992-4408-a7db-30033eec987d

►

In this thesis we consider multiple Automated Guided Vehicles (AGVs) navigating a common workspace to fulfill intralogistics tasks, typically formulated as the Multi-Agent Path Finding… (more)

Subjects/Keywords: Robust Plan Execution; Scheduling and Coordination; Mixed Integer Programming; Multi-Agent Path Finding; Factory Automation; Receding Horizon Control

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Berndt, A. (. (2020). Planning and Control of Multiple Mobile Robots for Intralogistics: an optimization-based reordering strategy. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:d70c13ac-a992-4408-a7db-30033eec987d

Chicago Manual of Style (16^th Edition):

Berndt, Alexander (author). “Planning and Control of Multiple Mobile Robots for Intralogistics: an optimization-based reordering strategy.” 2020. Masters Thesis, Delft University of Technology. Accessed March 05, 2021. http://resolver.tudelft.nl/uuid:d70c13ac-a992-4408-a7db-30033eec987d.

MLA Handbook (7^th Edition):

Berndt, Alexander (author). “Planning and Control of Multiple Mobile Robots for Intralogistics: an optimization-based reordering strategy.” 2020. Web. 05 Mar 2021.

Vancouver:

Berndt A(. Planning and Control of Multiple Mobile Robots for Intralogistics: an optimization-based reordering strategy. [Internet] [Masters thesis]. Delft University of Technology; 2020. [cited 2021 Mar 05]. Available from: http://resolver.tudelft.nl/uuid:d70c13ac-a992-4408-a7db-30033eec987d.

Council of Science Editors:

Berndt A(. Planning and Control of Multiple Mobile Robots for Intralogistics: an optimization-based reordering strategy. [Masters Thesis]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:d70c13ac-a992-4408-a7db-30033eec987d

Florida International University

8. Zanlongo, Sebastian A. Multi-Robot Coordination and Scheduling for Deactivation & Decommissioning.

Degree: PhD, Computer Science, 2018, Florida International University

URL: https://digitalcommons.fiu.edu/etd/3897 ; FIDC007010

► Large quantities of high-level radioactive waste were generated during WWII. This waste is being stored in facilities such as double-shell tanks in Washington, and… (more)

▼ Large quantities of high-level radioactive waste were generated during WWII. This waste is being stored in facilities such as double-shell tanks in Washington, and the Waste Isolation Pilot Plant in New Mexico. Due to the dangerous nature of radioactive waste, these facilities must undergo periodic inspections to ensure that leaks are detected quickly. In this work, we provide a set of methodologies to aid in the monitoring and inspection of these hazardous facilities. This allows inspection of dangerous regions without a human operator, and for the inspection of locations where a person would not be physically able to enter. First, we describe a robot equipped with sensors which uses a modified A* path-planning algorithm to navigate in a complex environment with a tether constraint. This is then augmented with an adaptive informative path planning approach that uses the assimilated sensor data within a Gaussian Process distribution model. The model's predictive outputs are used to adaptively plan the robot's path, to quickly map and localize areas from an unknown field of interest. The work was validated in extensive simulation testing and early hardware tests. Next, we focused on how to assign tasks to a heterogeneous set of robots. Task assignment is done in a manner which allows for task-robot dependencies, prioritization of tasks, collision checking, and more realistic travel estimates among other improvements from the state-of-the-art. Simulation testing of this work shows an increase in the number of tasks which are completed ahead of a deadline. Finally, we consider the case where robots are not able to complete planned tasks fully autonomously and require operator assistance during parts of their planned trajectory. We present a sampling-based methodology for allocating operator attention across multiple robots, or across different parts of a more sophisticated robot. This allows few operators to oversee large numbers of robots, allowing for a more scalable robotic infrastructure. This work was tested in simulation for both multi-robot deployment, and high degree-of-freedom robots, and was also tested in multi-robot hardware deployments. The work here can allow robots to carry out complex tasks, autonomously or with operator assistance. Altogether, these three components provide a comprehensive approach towards robotic deployment within the deactivation and decommissioning tasks faced by the Department of Energy. Advisors/Committee Members: Leonardo Bobadilla, Mark Finlayson, Monique Ross, Ning Xie, Dwayne McDaniel.

Subjects/Keywords: robotics; motion planning; human-robot-interaction; scheduling; coordination; path-planning; decommissioning; inspection; Artificial Intelligence and Robotics; Other Computer Sciences; Robotics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zanlongo, S. A. (2018). Multi-Robot Coordination and Scheduling for Deactivation & Decommissioning. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/3897 ; FIDC007010

Chicago Manual of Style (16^th Edition):

Zanlongo, Sebastian A. “Multi-Robot Coordination and Scheduling for Deactivation & Decommissioning.” 2018. Doctoral Dissertation, Florida International University. Accessed March 05, 2021. https://digitalcommons.fiu.edu/etd/3897 ; FIDC007010.

MLA Handbook (7^th Edition):

Zanlongo, Sebastian A. “Multi-Robot Coordination and Scheduling for Deactivation & Decommissioning.” 2018. Web. 05 Mar 2021.

Vancouver:

Zanlongo SA. Multi-Robot Coordination and Scheduling for Deactivation & Decommissioning. [Internet] [Doctoral dissertation]. Florida International University; 2018. [cited 2021 Mar 05]. Available from: https://digitalcommons.fiu.edu/etd/3897 ; FIDC007010.

Council of Science Editors:

Zanlongo SA. Multi-Robot Coordination and Scheduling for Deactivation & Decommissioning. [Doctoral Dissertation]. Florida International University; 2018. Available from: https://digitalcommons.fiu.edu/etd/3897 ; FIDC007010

University of Notre Dame

9. Jun Yi. DYNAMIC RESERVATION MEDIUM ACCESS FOR MULTIHOP WIRELESS REAL-TIME COMMUNICATIONS</h1>.

Degree: Computer Science and Engineering, 2012, University of Notre Dame

URL: https://curate.nd.edu/show/jd472v26383

► Various applications, such as battlefield surveillance, industrial process monitoring and control, civil infrastructure monitoring, etc. are enabled by multihop wireless networking technology. Many wireless… (more)

▼ Various applications, such as battlefield surveillance, industrial process monitoring and control, civil infrastructure monitoring, etc. are enabled by multihop wireless networking technology. Many wireless multihop networks carry streams of data with time-critical information (e.g., video streams in surveillance networks, sensor streams in monitoring and actuating applications, or command and control streams in factory automation applications). Such data must reach their destinations in a predictable and timely manner. Providing real-time communications in such a multihop wireless network is critical to their success. However, providing timeliness support is challenging, mainly due to (i) the inherently unreliable nature of the wireless medium, (ii) the distributed nature of multihop wireless networks, and (iii) the resource-constrained (mainly bandwidth and energy) environments. As a result, the design of an effective and efficient medium access control layer is especially important since it lays the foundation to provide actual timeliness support for all upper layers. However, existing solutions are either over-coordinated (fixed-schedule-based schemes) or under-coordinated (prioritized contention-based schemes), failing to address this problem efficiently. This thesis introduces DRAMA, a new distributed, progressive, dynamic slot reservation mechanism, aiming to provide timeliness support at the medium access control layer. In DRAMA, each node progressively and dynamically makes short-term slot reservations according to the timeliness and bandwidth requirements of its outgoing traffic, thereby quickly adapting to traffic and link dynamics. Potentially interfering nodes reserve slots in a serialized and orthogonal manner, which ensures fast, contention-free slot reservations with high bandwidth utilization and low bandwidth overhead. Similar to fixed-schedule-based approaches, nodes in DRAMA can enter a low-power sleep mode when they do not transmit or receive data. Advisors/Committee Members: Christian Poellabauer, Committee Chair, Aaron Striegel, Committee Member, X. Sharon Hu, Committee Member, Michael Lemmon, Committee Member, Liqiang Zhang, Committee Member.

Subjects/Keywords: Scheduling; Access Admission Control; Quality of Service; Distributed Coordination; Medium Access Control; Real-Time Communications; Multihop Wireless Networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Yi, J. (2012). DYNAMIC RESERVATION MEDIUM ACCESS FOR MULTIHOP WIRELESS REAL-TIME COMMUNICATIONS</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/jd472v26383

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Yi, Jun. “DYNAMIC RESERVATION MEDIUM ACCESS FOR MULTIHOP WIRELESS REAL-TIME COMMUNICATIONS</h1>.” 2012. Thesis, University of Notre Dame. Accessed March 05, 2021. https://curate.nd.edu/show/jd472v26383.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Yi, Jun. “DYNAMIC RESERVATION MEDIUM ACCESS FOR MULTIHOP WIRELESS REAL-TIME COMMUNICATIONS</h1>.” 2012. Web. 05 Mar 2021.

Vancouver:

Yi J. DYNAMIC RESERVATION MEDIUM ACCESS FOR MULTIHOP WIRELESS REAL-TIME COMMUNICATIONS</h1>. [Internet] [Thesis]. University of Notre Dame; 2012. [cited 2021 Mar 05]. Available from: https://curate.nd.edu/show/jd472v26383.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yi J. DYNAMIC RESERVATION MEDIUM ACCESS FOR MULTIHOP WIRELESS REAL-TIME COMMUNICATIONS</h1>. [Thesis]. University of Notre Dame; 2012. Available from: https://curate.nd.edu/show/jd472v26383

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

10. Fu, Liangliang. Coordination d'ordonnancement de production et de distribution : Coordination of production and distribution scheduling.

Degree: Docteur es, Informatique, 2014, Paris 9

URL: http://www.theses.fr/2014PA090046

►

Dans cette thèse, nous étudions trois problèmes d'ordonnancement de la chaîne logistique dans le modèle de production à la demande. Le premier problème est un… (more)

▼

Dans cette thèse, nous étudions trois problèmes d'ordonnancement de la chaîne logistique dans le modèle de production à la demande. Le premier problème est un problème d'ordonnancement de production et de distribution intermédiaire dans une chaîne logistique avec un producteur et un prestataire logistique. Le deuxième problème est un problème d'ordonnancement de production et de distribution aval avec des dates de début au plus tôt et des dates limites de livraison dans une chaîne logistique avec un producteur, un prestataire logistique et un client. Le troisième problème est un problème d'ordonnancement de production et de distribution aval avec des temps de réglage et des fenêtres de temps de livraison dans une chaîne logistique avec un producteur, un prestataire logistique et plusieurs clients. Pour les trois problèmes, nous étudions les problèmes d'ordonnancement individuels et les problèmes d'ordonnancement coordonnés. Nous proposons des algorithmes polynomiaux ou prouvons la NP-Complétude de ces problèmes, et développons des algorithmes exacts ou heuristiques pour résoudre les problèmes NP-Difficiles. Nous proposons des mécanismes de coordination et évaluons le bénéfice de la coordination.

In this dissertation, we aim at investigating three supply chain scheduling problems in the make-To-Order business model. The first problem is a production and interstage distribution scheduling problem in a supply chain with a manufacturer and a third-Party logistics (3PL) provider. The second problem is a production and outbound distribution scheduling problem with release dates and deadlines in a supply chain with a manufacturer, a 3PL provider and a customer. The third problem is a production and outbound distribution scheduling problem with setup times and delivery time windows in a supply chain with a manufacturer, a 3PL provider and several customers. For the three problems, we study their individual scheduling problems and coordinated scheduling problems: we propose polynomial-Time algorithms or prove the intractability of these problems, and develop exact algorithms or heuristics to solve the NP-Hard problems. We establish mechanisms of coordination and evaluate the benefits of coordination.

Advisors/Committee Members: Aloulou, Mohamed Ali (thesis director).

Subjects/Keywords: Ordonnancement de la chaîne logistique; Coordination; Ordonnancement de production et de distribution; Programmation dynamique; Algorithme par séparation et évaluation; Heuristique; Supply chain scheduling; Coordination; Production and distribution scheduling; Dynamic programming; Branch-And-Bound algorithm; Heuristic; 003

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Fu, L. (2014). Coordination d'ordonnancement de production et de distribution : Coordination of production and distribution scheduling. (Doctoral Dissertation). Paris 9. Retrieved from http://www.theses.fr/2014PA090046

Chicago Manual of Style (16^th Edition):

Fu, Liangliang. “Coordination d'ordonnancement de production et de distribution : Coordination of production and distribution scheduling.” 2014. Doctoral Dissertation, Paris 9. Accessed March 05, 2021. http://www.theses.fr/2014PA090046.

MLA Handbook (7^th Edition):

Fu, Liangliang. “Coordination d'ordonnancement de production et de distribution : Coordination of production and distribution scheduling.” 2014. Web. 05 Mar 2021.

Vancouver:

Fu L. Coordination d'ordonnancement de production et de distribution : Coordination of production and distribution scheduling. [Internet] [Doctoral dissertation]. Paris 9; 2014. [cited 2021 Mar 05]. Available from: http://www.theses.fr/2014PA090046.

Council of Science Editors:

Fu L. Coordination d'ordonnancement de production et de distribution : Coordination of production and distribution scheduling. [Doctoral Dissertation]. Paris 9; 2014. Available from: http://www.theses.fr/2014PA090046

University of Michigan

11. Clement, Bradley Jefferson. Abstract reasoning for multiagent coordination and planning.

Degree: PhD, Computer science, 2002, University of Michigan

URL: http://hdl.handle.net/2027.42/129322

► As autonomous software and robotic systems (or agents) grow in complexity, they will increasingly need to communicate and coordinate with each other. These agents will… (more)

▼ As autonomous software and robotic systems (or agents) grow in complexity, they will increasingly need to communicate and coordinate with each other. These agents will need planned courses of action to achieve their goals while sharing limited resources. This dissertation addresses the problem of efficiently interleaving planning and coordination for multiple agents. As part of my approach, I represent agents as having hierarchies of tasks that can be decomposed into executable primitive actions. Using task hierarchies, an agent can reason efficiently about its own goals and tasks (and those of others) at multiple levels of abstraction. By exploiting hierarchy, these agents can make planning and coordination decisions while avoiding complex computation involving unnecessary details of their tasks. To reason at abstract levels, agents must be aware of the constraints an abstract task embodies in its potential decompositions. Thus, I provide algorithms that summarize these constraints (represented as propositional state conditions and metric resource us ages) for each abstract task in an agent's library of hierarchical plans. This summary information can be derived offline for a domain of problems and used for any instance of tasks (or plans) assigned to the agents during coordination and planning. I also provide algorithms for reasoning about the concurrent interactions of abstract tasks, for identifying conflicts, and for resolving them. I use these algorithms to build sound and complete refinement-based coordination and planning algorithms. I also integrate summary information with a local search planner/scheduler, showing how the benefits can be extended to different classes of planning algorithms. Complexity analyses and experiments show where abstract reasoning using summary information can reduce computation and communication exponentially along a number of dimensions for coordination, planning, and scheduling in finding a single agent's plan or in optimally coordinating the plans of multiple agents. In addition, I provide pruning techniques and heuristics for decomposition that can further dramatically reduce computation. Overall, the techniques developed in this thesis enable researchers and system designers to scale the capabilities of interleaved coordination, planning, and execution by providing agents with tools to reason efficiently about their plans at multiple levels of abstraction. Advisors/Committee Members: Durfee, Edmund H. (advisor).

Subjects/Keywords: Abstract Reasoning; Artificial Intelligence; Autonomous Software; Coordination; Multiagent; Planning; Robotics; Scheduling

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Clement, B. J. (2002). Abstract reasoning for multiagent coordination and planning. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/129322

Chicago Manual of Style (16^th Edition):

Clement, Bradley Jefferson. “Abstract reasoning for multiagent coordination and planning.” 2002. Doctoral Dissertation, University of Michigan. Accessed March 05, 2021. http://hdl.handle.net/2027.42/129322.

MLA Handbook (7^th Edition):

Clement, Bradley Jefferson. “Abstract reasoning for multiagent coordination and planning.” 2002. Web. 05 Mar 2021.

Vancouver:

Clement BJ. Abstract reasoning for multiagent coordination and planning. [Internet] [Doctoral dissertation]. University of Michigan; 2002. [cited 2021 Mar 05]. Available from: http://hdl.handle.net/2027.42/129322.

Council of Science Editors:

Clement BJ. Abstract reasoning for multiagent coordination and planning. [Doctoral Dissertation]. University of Michigan; 2002. Available from: http://hdl.handle.net/2027.42/129322

12. Gomes, Isaías da Luz Ramos. Metodologia de otimização estocástica para coordenação eólico-fotovoltaica.

Degree: 2016, Universidade de Évora

URL: https://www.rcaap.pt/detail.jsp?id=oai:dspace.uevora.pt:10174/18451

► Esta dissertação incide sobre o tema da coordenação entre sistemas eólicos e fotovoltaicos que participam no mercado de eletricidade. A incerteza da potência eólica e… (more)

▼ Esta dissertação incide sobre o tema da coordenação entre sistemas eólicos e fotovoltaicos que participam no mercado de eletricidade. A incerteza da potência eólica e fotovoltaica é uma caraterística predominante nesta coordenação, devendo ser considerada no planeamento ótimo de sistemas eólico-fotovoltaicos. A fim de modelizar a incerteza é apresentada uma metodologia de otimização estocástica baseada em programação linear para maximizar o lucro esperado de uma empresa produtora de energia elétrica que participa no mercado diário. A coordenação entre sistemas eólicos e fotovoltaicos visa mitigar os desequilíbrios de energia, resultantes das ofertas horárias submetidas no mercado diário e, consequentemente, reduzir as penalizações financeiras. Os resultados da coordenação entre um sistema eólico e um sistema fotovoltaico são comparados com os resultados obtidos para a operação não coordenada. Estes resultados permitem concluir que a metodologia desenvolvida aplicada à coordenação apresenta um lucro esperado superior ao lucro obtido para a operação não coordenada; Abstract Stochastic Optimization Methodology for Wind-Photovoltaic Coordination This dissertation focuses on the issue of coordination between wind and photovoltaic systems participating in electricity markets. The uncertainty of wind and photovoltaic power is a main characteristic of these systems, which must be included in the optimal scheduling of the coordination of wind with photovoltaic systems. In order to model the uncertainty is presented a stochastic approach based on linear programming to maximize the profit of a wind photovoltaic power producer which participates in electricity markets. The coordination of wind with photovoltaic systems aims to mitigate the energy deviations, as a result of the participation in day-ahead market and therefore reducing economic penalties. The results obtained by the coordination are compared to results obtained by the separated operation of wind and photovoltaic systems. The results allow concluding that the proposed approach applied to the coordination presents an expected profit higher than the expected profit without coordination. Advisors/Committee Members: Conceição, Mário Rui Melício da, Pousinho, Hugo Miguel Inácio.

Subjects/Keywords: Potência eólica; Potência fotovoltaica; Coordenação eólico-fotovoltaica; Otimização estocástica; Mercado diário; Planeamento ótimo; Wind power; Photovoltaic power; Wind-photovoltaic coordination; Stochastic optimization; Day-ahead market; Optimal scheduling

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Gomes, I. d. L. R. (2016). Metodologia de otimização estocástica para coordenação eólico-fotovoltaica. (Thesis). Universidade de Évora. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:dspace.uevora.pt:10174/18451

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Gomes, Isaías da Luz Ramos. “Metodologia de otimização estocástica para coordenação eólico-fotovoltaica.” 2016. Thesis, Universidade de Évora. Accessed March 05, 2021. https://www.rcaap.pt/detail.jsp?id=oai:dspace.uevora.pt:10174/18451.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Gomes, Isaías da Luz Ramos. “Metodologia de otimização estocástica para coordenação eólico-fotovoltaica.” 2016. Web. 05 Mar 2021.

Vancouver:

Gomes IdLR. Metodologia de otimização estocástica para coordenação eólico-fotovoltaica. [Internet] [Thesis]. Universidade de Évora; 2016. [cited 2021 Mar 05]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:dspace.uevora.pt:10174/18451.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gomes IdLR. Metodologia de otimização estocástica para coordenação eólico-fotovoltaica. [Thesis]. Universidade de Évora; 2016. Available from: https://www.rcaap.pt/detail.jsp?id=oai:dspace.uevora.pt:10174/18451

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Universidade do Rio Grande do Sul

13. Bez, Jean Luca. Evaluating I/O scheduling techniques at the forwarding layer and coordinating data server accesses.

Degree: 2016, Universidade do Rio Grande do Sul

URL: http://hdl.handle.net/10183/156441

►

In High Performance Computing (HPC) environments, scientific applications rely on Parallel File Systems (PFS) to obtain Input/Output (I/O) performance especially when handling large amounts of… (more)

▼

In High Performance Computing (HPC) environments, scientific applications rely on Parallel File Systems (PFS) to obtain Input/Output (I/O) performance especially when handling large amounts of data. However, I/O is still a bottleneck for an increasing number of applications, due to the historical gap between processing and data access speed. To alleviate the concurrency caused by thousands of nodes accessing a significantly smaller number of PFS servers, intermediate I/O nodes are typically employed between processing nodes and the file system. Each intermediate node forwards requests from multiple clients to the parallel file system, a setup which gives this component the opportunity to perform optimizations like I/O scheduling. The objective of this dissertation is to evaluate different scheduling algorithms, at the I/O forwarding layer, that work to improve concurrent access patterns by aggregating and reordering requests to avoid patterns known to harm performance. We demonstrate that the FIFO (First In, First Out), HBRR (Handle- Based Round-Robin), TO (Time Order), SJF (Shortest Job First) and MLF (Multilevel Feedback) schedulers are only partially effective because the access pattern is not the main factor that affects performance in the I/O forwarding layer, especially for read requests. A new scheduling algorithm, TWINS, is proposed to coordinate the access of intermediate I/O nodes to the parallel file system data servers. Our approach decreases concurrency at the data servers, a factor previously proven to negatively affect performance. The proposed algorithm is able to improve read performance from shared files by up to 28% over other scheduling algorithms and by up to 50% over not forwarding I/O requests.

Em ambientes de Computação de Alto Desempenho, as aplicações científicas dependem dos Sistemas de Arquivos Paralelos (SAP) para obter desempenho de Entrada/Saída (E/S), especialmente ao lidar com grandes quantidades de dados. No entanto, E/S ainda é um gargalo para um número crescente de aplicações, devido à diferença histórica entre a velocidade de processamento e de acesso aos dados. Para aliviar a concorrência causada por milhares de nós que acessam um número significativamente menor de servidores SAP, normalmente nós intermediários de E/S são adicionados entre os nós de processamento e o sistema de arquivos. Cada nó intermediário encaminha solicitações de vários clientes para o sistema, uma configuração que dá a este componente a oportunidade de executar otimizações como o escalonamento de requisições de E/S. O objetivo desta dissertação é avaliar diferentes algoritmos de escalonamento, na camada de encaminhamento de E/S, cuja finalidade é melhorar o padrão de acesso das aplicações, agregando e reordenando requisições para evitar padrões que são conhecidos por prejudicar o desempenho. Demonstramos que os escalonadores FIFO (First In, First Out), HBRR (Handle-Based Round-Robin), TO (Time Order), SJF (Shortest Job First) e MLF (Multilevel Feedback) são apenas parcialmente eficazes porque o padrão de…

Advisors/Committee Members: Navaux, Philippe Olivier Alexandre.

Subjects/Keywords: High performance I/O; Processamento paralelo; Computacao cientifica : Alto desempenho; Parallel file systems; Parallel I/O; I/O forwarding; I/O scheduling; Access coordination

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bez, J. L. (2016). Evaluating I/O scheduling techniques at the forwarding layer and coordinating data server accesses. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/156441

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Bez, Jean Luca. “Evaluating I/O scheduling techniques at the forwarding layer and coordinating data server accesses.” 2016. Thesis, Universidade do Rio Grande do Sul. Accessed March 05, 2021. http://hdl.handle.net/10183/156441.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Bez, Jean Luca. “Evaluating I/O scheduling techniques at the forwarding layer and coordinating data server accesses.” 2016. Web. 05 Mar 2021.

Vancouver:

Bez JL. Evaluating I/O scheduling techniques at the forwarding layer and coordinating data server accesses. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2016. [cited 2021 Mar 05]. Available from: http://hdl.handle.net/10183/156441.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bez JL. Evaluating I/O scheduling techniques at the forwarding layer and coordinating data server accesses. [Thesis]. Universidade do Rio Grande do Sul; 2016. Available from: http://hdl.handle.net/10183/156441

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Northeastern University

14. Mutlu, Serpil. Scheduling models in health care focusing on care coordination and teamwork.

Degree: PhD, Department of Mechanical and Industrial Engineering, 2015, Northeastern University

URL: http://hdl.handle.net/2047/D20194083

► Since the early 1960s scheduling problems in health care have been a focus for industrial engineers and operations researchers, utilizing a wide range of solution… (more)

▼ Since the early 1960s scheduling problems in health care have been a focus for industrial engineers and operations researchers, utilizing a wide range of solution techniques and types of problems. A general area of increasing importance in health care concerns co-scheduling or coordinating the scheduling of teams of care providers, such as for complex procedures, team-based primary care, or integrating specialty and primary care. These new models of care present unique and challenging scheduling needs that lend themselves well to mathematical programming solution approaches. This dissertation applies optimization to three specific care coordination problems focused on team collaboration and care continuity in primary, specialty, and inpatient settings: (1) multidisciplinary team scheduling for co-availability, (2) resident scheduling for continuity of primary care, and (3) integrated scheduling of specialty and primary care using telehealth.; The first area of focus is a co-availability scheduling problem that arises in various healthcare settings in which personnel from different disciplines are required to work together as care teams to perform specific tasks. This problem is characterized by the asynchrony in availability of these personnel, which we optimize to facilitate teamwork and improve timeliness of care by reducing unnecessary delays. Integer and constraint programming techniques are developed to maximize scheduling-rescheduling flexibility, while satisfying coverage, time, resource, and preference constraints. Applications to breast cancer treatment in two different health systems illustrate the potential improvement on team quality and procedure timeliness.; The second problem focuses on optimizing individual scheduling templates of multiple primary care teams in order to increase patient-team continuity and access, typically including the complexity of resident scheduling. This new care model focuses on a small care team instead of a single provider as a consistent source of care for primary care patients. An integer programming model is developed to maximize team coverage by assigning clinicians to their tasks in accordance with various educational and clinical requirements in a way that improves continuity of care. Application of the developed model to a family medicine residency clinic has significantly improved continuity and access leading to its integration into daily practice.; Finally, the third area of focus is the integrated scheduling of primary care with remote specialist availability by utilizing telehealth resources. Under this approach, patients referred to a specialty service receive a consult with a specialist immediately after their primary care visit via medical videoconferencing technology. To optimize specialist scheduling, an integer programming model is developed to maximize the proportion of immediate videoconference consultations that can be satisfied by available resources. Off-line application to the Veteran Health Administration data suggests significant improvements are…

Subjects/Keywords: scheduling models; care coordination; health care; Health care teams; Administration; Medical appointments and schedules; Mathematical models; Medical personnel; Workload; Hospitals; Administration; Mathematical models; Primary care (Medicine); Administration; Telecommunication in medicine

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Mutlu, S. (2015). Scheduling models in health care focusing on care coordination and teamwork. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20194083

Chicago Manual of Style (16^th Edition):

Mutlu, Serpil. “Scheduling models in health care focusing on care coordination and teamwork.” 2015. Doctoral Dissertation, Northeastern University. Accessed March 05, 2021. http://hdl.handle.net/2047/D20194083.

MLA Handbook (7^th Edition):

Mutlu, Serpil. “Scheduling models in health care focusing on care coordination and teamwork.” 2015. Web. 05 Mar 2021.

Vancouver:

Mutlu S. Scheduling models in health care focusing on care coordination and teamwork. [Internet] [Doctoral dissertation]. Northeastern University; 2015. [cited 2021 Mar 05]. Available from: http://hdl.handle.net/2047/D20194083.

Council of Science Editors:

Mutlu S. Scheduling models in health care focusing on care coordination and teamwork. [Doctoral Dissertation]. Northeastern University; 2015. Available from: http://hdl.handle.net/2047/D20194083

15. Daknou, Amani. Architecture distribuée à base d’agents pour optimiser la prise en charge des patients dans les services d’urgence en milieu hospitalier : Distributed agent based architecture to optimize the management of patients at the emergency department in hospitals.

Degree: Docteur es, Automatique et informatique industrielle, 2011, Ecole centrale de Lille

URL: http://www.theses.fr/2011ECLI0011

►

Les établissements de santé sont confrontés à de nouveaux défis tels que le vieillissement de la population, la hausse des coûts des soins et les… (more)

▼

Les établissements de santé sont confrontés à de nouveaux défis tels que le vieillissement de la population, la hausse des coûts des soins et les progrès rapides des technologies médicales. Les nouvelles politiques de contrôle du budget des soins ont été introduites pour augmenter l'efficacité, réduire les déchets et remodeler le système de santé.Ces établissements cibles présentent des réseaux complexes incluant de ressources humaines,financières, structurelles et technologiques visant à garantir les meilleurs soins. Ces enjeux concernent d’autant plus les services d’urgence engorgés par l’afflux massif des passages, qui doivent fournir des décisions rapides et assurer le dimensionnement de ses ressources afin de réduire les délais d’attente des patients sans compromettre la qualité de soin.L’objectif de cette thèse est de proposer des solutions appropriées aux services d’urgences permettant d’améliorer la prise en charge des patients en termes de temps d’attente. Nous avons commencé par analyser les problématiques de la filière des urgences afin d’engager une démarche d’amélioration. Par la suite, nous avons modélisé le processus de prise en charge des patients au service d’accueil des urgences à l’aide d’un système multi-agent ouvert et dynamique. Le système proposé permet de fournir une aide à la décision sur la planification de l’activité médicale et l’affectation des ressources humaines dans une unité où on se trouve souvent face à une situation d’urgence nécessitant une prise en charge rapide et efficace. Dans ce contexte, nous abordons le problème réactif d’optimisation de l’ordonnancement des opérations de soin et le problème de coordination du personnel médical. Nous nous intéressons au dimensionnement des ressources humaines au SU en adoptant une approche de prise en compte des compétences maîtrisées dans le but de trouver une adéquation avec celles requises par l’activité médicale afin avant tout d’accroitre la qualité, réduire les délais d’attente et permettre de dégager des gains de gestion

Health-care organizations are facing new challenges such as the aging population, the rise of health care costs and the rapid progress of medical technologies. New policies of health care budget control have been introduced to increase efficiency, reduce waste and reshape the entire health care system. Targeted organizations are complex networks of human,financial, structural and technological resources aiming at guarantying best public health care.These issues concern all the more Emergency Departments (ED) congested by the massive influx of passages and which must provide quick decisions and ensure the sizing of its resources to reduce waiting times for patients with out compromising quality of care.The objective of this thesis is to propose appropriate solutions to ED to improve carefor patients in terms of waiting time. We began by analyzing the problems of the emergency department in order to initiate a process of improvement. Subsequently, we modeled the process of care for patients at ED by using an open…

Advisors/Committee Members: Hammadi, Slim (thesis director), Hubert, Hervé (thesis director), Zgaya, Hayfa (thesis director).

Subjects/Keywords: Prise en charge des urgences; Système multi-agent; O-MaSE; Optimisation; Affectation du personnel médical; Ordonnancement réactif; Coordination; Aide à la décision; Mangement of emergencies; Multi-agent system; O-MaSE; Optimization; Assignment of medical staff; Reactive scheduling; Coordination; Decision support

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Daknou, A. (2011). Architecture distribuée à base d’agents pour optimiser la prise en charge des patients dans les services d’urgence en milieu hospitalier : Distributed agent based architecture to optimize the management of patients at the emergency department in hospitals. (Doctoral Dissertation). Ecole centrale de Lille. Retrieved from http://www.theses.fr/2011ECLI0011

Chicago Manual of Style (16^th Edition):

Daknou, Amani. “Architecture distribuée à base d’agents pour optimiser la prise en charge des patients dans les services d’urgence en milieu hospitalier : Distributed agent based architecture to optimize the management of patients at the emergency department in hospitals.” 2011. Doctoral Dissertation, Ecole centrale de Lille. Accessed March 05, 2021. http://www.theses.fr/2011ECLI0011.

MLA Handbook (7^th Edition):

Daknou, Amani. “Architecture distribuée à base d’agents pour optimiser la prise en charge des patients dans les services d’urgence en milieu hospitalier : Distributed agent based architecture to optimize the management of patients at the emergency department in hospitals.” 2011. Web. 05 Mar 2021.

Vancouver:

Daknou A. Architecture distribuée à base d’agents pour optimiser la prise en charge des patients dans les services d’urgence en milieu hospitalier : Distributed agent based architecture to optimize the management of patients at the emergency department in hospitals. [Internet] [Doctoral dissertation]. Ecole centrale de Lille; 2011. [cited 2021 Mar 05]. Available from: http://www.theses.fr/2011ECLI0011.

Council of Science Editors:

Daknou A. Architecture distribuée à base d’agents pour optimiser la prise en charge des patients dans les services d’urgence en milieu hospitalier : Distributed agent based architecture to optimize the management of patients at the emergency department in hospitals. [Doctoral Dissertation]. Ecole centrale de Lille; 2011. Available from: http://www.theses.fr/2011ECLI0011

16. Boerkoel Jr, James C. Distributed Approaches for Solving Constraint-based Multiagent Scheduling Problems.

Degree: PhD, Computer Science & Engineering, 2012, University of Michigan

URL: http://hdl.handle.net/2027.42/96046

► This research focuses on building foundational algorithms for scheduling agents that assist people in managing their activities in environments in which tempo and complexity outstrip… (more)

▼ This research focuses on building foundational algorithms for scheduling agents that assist people in managing their activities in environments in which tempo and complexity outstrip people's cognitive capacity. The critical challenge is that, as individuals decide how to act on their scheduling goals, scheduling agents should answer queries regarding the events in their interacting schedules while respecting individual privacy and autonomy to the extent possible. I formally define both the Multiagent Simple Temporal Problem (MaSTP) and Multiagent Disjunctive Temporal Problem (MaDTP) for naturally capturing and reasoning over the distributed but interconnected scheduling problems of multiple individuals. My hypothesis is that combining a bottom-up approach – where an agent externalizes constraints that compactly summarize how its local subproblem affects other agents' subproblems, with a top-down approach – where an agent proactively constructs and internalizes new local constraints that decouple its subproblem from others', will lead to effective solution techniques. I confirm that my hypothesized approach leads to distributed algorithms that calculate summaries of the joint solution space for multiagent scheduling problems, without centralizing or otherwise redistributing the problems. In both the MaSTP and MaDTP domains, the distributed algorithms permit concurrent execution for significant speedup over current art, and also increase the level of privacy and independence in individual agent reasoning. These algorithms are most advantageous for problems where interactions between the agents are sparse compared to the complexity of agents' individual scheduling problems. Moreover, despite the combinatorially-large and unwieldy nature of the MaDTP solution space, I show that agents can use influence spaces, which compactly capture the impact of agents' interacting schedules, to tractably converge on distributed summaries of the joint solution space. Finally, I apply the same basic principle to the Hybrid Scheduling Problem, which combines constraint-based scheduling with a rudimentary level of planning, and show that my Hybrid Constraint Tightening precompilation algorithm can improve the propagation of information between planning and scheduling subproblems, leading to significant search space pruning and execution time reduction. Advisors/Committee Members: Durfee, Edmund H. (committee member), Cohn, Amy Ellen (committee member), Pollack, Martha E. (committee member), Wellman, Michael P. (committee member).

Subjects/Keywords: Multiagent Scheduling; Constraint-based Scheduling; Simple Temporal Problem; Disjunctive Temporal Problem; Temporal Decoupling; Multiagent Coordination; Computer Science; Engineering

…Constraint Satisfaction Problem 4.2.2 Hybrid Scheduling Problem . . . . . . . . . . . . . . Related… …Constraint-based Scheduling Formulations167 5.1.2 Independence Properties of a Multiagent Network… …168 5.1.4 Algorithms for Calculating the Complete Solution Space of Multiagent Scheduling… …Multiagent Scheduling Problems . . . . . . . . . . . 5.1.6 Hybrid Constraint Tightening… …Decoupling Planning and Scheduling Problems . . . 5.2.4 The Multiagent Hybrid Scheduling Problem…

10 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Boerkoel Jr, J. C. (2012). Distributed Approaches for Solving Constraint-based Multiagent Scheduling Problems. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/96046

Chicago Manual of Style (16^th Edition):

Boerkoel Jr, James C. “Distributed Approaches for Solving Constraint-based Multiagent Scheduling Problems.” 2012. Doctoral Dissertation, University of Michigan. Accessed March 05, 2021. http://hdl.handle.net/2027.42/96046.

MLA Handbook (7^th Edition):

Boerkoel Jr, James C. “Distributed Approaches for Solving Constraint-based Multiagent Scheduling Problems.” 2012. Web. 05 Mar 2021.

Vancouver:

Boerkoel Jr JC. Distributed Approaches for Solving Constraint-based Multiagent Scheduling Problems. [Internet] [Doctoral dissertation]. University of Michigan; 2012. [cited 2021 Mar 05]. Available from: http://hdl.handle.net/2027.42/96046.

Council of Science Editors:

Boerkoel Jr JC. Distributed Approaches for Solving Constraint-based Multiagent Scheduling Problems. [Doctoral Dissertation]. University of Michigan; 2012. Available from: http://hdl.handle.net/2027.42/96046

Jönköping University

17. Åkesson, Johanna. Digitala tidsbokningar i sjukvården : Identifiering av brister och förbättringsförslag för en effektivare tidsbokningsprocess.

Degree: Supply Chain and Operations Management, 2020, Jönköping University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-49965

►

Syfte – Syftet med denna studie är att kartlägga hur digitala tidsbokningar i sjukvården används i nuläget, identifiera brister och ta fram förbättringsförslag för… (more)

▼

Syfte – Syftet med denna studie är att kartlägga hur digitala tidsbokningar i sjukvården används i nuläget, identifiera brister och ta fram förbättringsförslag för att skapa en effektivare tidsbokningsprocess. För att uppfylla syftet har tre frågeställningar formulerats: 1. Hur används digitala tidsbokningar i nuläget? 2. Vilka brister finns det i den digitala tidsbokningsprocessen som påverkar effektiviteten? 3. Hur kan den nuvarande digitala tidsbokningsprocessen effektiviseras? Metod – För att kunna uppnå studiens syfte har en fallstudie genomförts på kvinnohälsovården i Jönköping. Fallstudien bestod utav deltagande observationer och dokumentstudier. Även en litteraturstudie har genomförts vilket har legat till grund för det teoretiska ramverket som använts för analys av empiriska data. Resultat – I studien framkom det att kvinnohälsovården till viss del använder sig av digitala tidsbokningar. Fyra brister identifieras i tidsbokningsprocessen som påverkade effektiviteten. Dessa var schemaläggning, begränsat utbud på 1177, bristande användning av prognoser samt samordning. Efter att dessa brister identifierats kunde tre förbättringsförslag formuleras med syfte till att effektivisera tidsbokningsprocessen. Det första förbättringsförslaget gäller ett utökat utbud av tillgängliga tider på 1177. Det andra förbättringsförslaget handlar om hur prognoser kan användas i större utsträckning vid schemaläggning och planering av tillgängliga tider på 1177. Slutligen handlar det tredje förbättringsförslaget om hur en större samordning kan bidra till minskad tid för administration för barnmorskorna. Implikationer – I studien har brister identifierats och förbättringsförslag har tagits fram gällande hur tidsbokningsprocessen ska effektiviseras. Genom användning av förbättringsförslagen kan verksamheten bli mer samordnad och med hjälp av prognoser kunna tillgodose den efterfrågan som finns. Förbättringsförslagen skulle innebära nya arbetsrutiner för kvinnohälsovården. Ingen ny teori har skapats utifrån studien då den är baserad på redan existerande teori. Begränsningar – Studien utfördes endast på ett fallföretag vilket kan påverka studiens generaliserbarhet. Förbättringsförslagen gällande hur tidsbokningsprocessen kan effektiviseras har enbart beskrivits på ett teoretiskt plan och inte testats i praktiken. Studien har även främst varit av kvalitativ karaktär vilket medför att inga mätningar har gjorts gällande hur förbättringsförslagen har bidragit till en effektivare tidsbokningsprocess.

Purpose – The purpose with this study is to chart the using of digital appointment bookings in the health care, identify deficits and to generate suggestions for improvements for a more efficient process regarding appointment bookings. To fulfil the purpose three research questions have been formulated: 1. How are digital appointment bookings currently being used? 2. What…

Subjects/Keywords: Digital appointment booking; women’s health care; health care; scheduling; 1177; forecast; coordination; efficiency; Digitala tidsbokningar; kvinnohälsovård; hälso- och sjukvård; schemaläggning; 1177; prognoser; samordning; effektivitet; Health Care Service and Management, Health Policy and Services and Health Economy; Hälso- och sjukvårdsorganisation, hälsopolitik och hälsoekonomi

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Åkesson, J. (2020). Digitala tidsbokningar i sjukvården : Identifiering av brister och förbättringsförslag för en effektivare tidsbokningsprocess. (Thesis). Jönköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-49965

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Åkesson, Johanna. “Digitala tidsbokningar i sjukvården : Identifiering av brister och förbättringsförslag för en effektivare tidsbokningsprocess.” 2020. Thesis, Jönköping University. Accessed March 05, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-49965.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Åkesson, Johanna. “Digitala tidsbokningar i sjukvården : Identifiering av brister och förbättringsförslag för en effektivare tidsbokningsprocess.” 2020. Web. 05 Mar 2021.

Vancouver:

Åkesson J. Digitala tidsbokningar i sjukvården : Identifiering av brister och förbättringsförslag för en effektivare tidsbokningsprocess. [Internet] [Thesis]. Jönköping University; 2020. [cited 2021 Mar 05]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-49965.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Åkesson J. Digitala tidsbokningar i sjukvården : Identifiering av brister och förbättringsförslag för en effektivare tidsbokningsprocess. [Thesis]. Jönköping University; 2020. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-49965

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

18. Adouane, Amine Mohamed. Dynamic management of spectral resources in LTE networks : Gestion dynamique des ressources spectrales dans les réseaux LTE.

Degree: Docteur es, Informatique, 2015, Versailles-St Quentin en Yvelines

URL: http://www.theses.fr/2015VERS007V

►

La croissance exponentielle du nombre de dispositifs communicants et des services sans fils émergents fixe des objectifs toujours plus haut pour répondre à la demande… (more)

▼

La croissance exponentielle du nombre de dispositifs communicants et des services sans fils émergents fixe des objectifs toujours plus haut pour répondre à la demande de capacité sans cesse croissante des utilisateurs. Cela pose des défis constants pour atteindre les objectifs envisagés. La réutilisation spectrale élevée (High efficiency spectral reuse) a été adopté, cependant, elle conduit à des interférences accrues sur le réseau, ce qui dégrade les performances. L'OFDM (Orthogonal Frequency Division Multiplexing) est utilisé comme solution dans les réseaux de 4 G. Grâce à son orthogonalité, l'OFDM élimine l'interférence intra-cellulaire, mais l'interférence inter-cellule reste importante. Plusieurs méthodes connues sous le nom d'Inter-Cell interférences coordination (ICIC) ont été proposées pour les diminuer. L'ICIC permet la gestion des ressources radio coordonnée entre plusieurs cellules appelées ENodeB. Ces eNodeB peuvent partager les informations nécessaires grâce à l'interface X2 qui les relient, ces informations sont transmises par des messages LTE normalisés. Lorsque les ENodeBs sélectionnent égoïstement les ressources, la théorie de jeux non-coopératifs est largement appliquée pour trouver un juste équilibre. Dans cette thèse, nous mettons l'accent sur l'ICIC pour la liaison descendante d'un système OFDMA cellulaire dans le contexte du projet SOAPS (Spectrum opportuniste accès à la Sécurité publique). Ce projet a pour but l'amélioration de la planification des ressources de fréquences pour fournir des services à large bande dans les systèmes PMR (radiocommunications mobiles privées) en utilisant les technologies LTE. Nous adressons le problème d'ICIC en proposant quatre solutions différentes sous forme d'algorithmes entièrement décentralisés, ces algorithmes se basent sur la théorie des jeux non-coopératifs avec des équilibres de Nash purs des jeux considérés

The exponential growth in the number of communications devices has set out new ambitious targets to meet the ever-increasing demand for user capacity in emerging wireless systems. However, the inherent impairments of communication channels in cellular systems pose constant challenges to meet the envisioned targets. High spectral reuse efficiency was adopted as a solution to higher data rates. Despite its benefits, high spectral reuse leads to increased interference over the network, which degrades performances of mobile users with bad channel quality. To face this added interfence, OFDM (Orthogonal Frequency Division Multiplexing) is used for the new 4th generation network. Thanks to its orthogonality OFDM eliminates the intra-cellular interference, but when the same resources are used in two adjacents cells, the inter-cell interference becomes severe. To get rid of the latter, several methods for Inter-Cell Interference Coordination (ICIC) have been proposed. ICIC allows coordinated radio resources management between multiple cells. The eNodeBs can share resource usage information and interference levels over the X2 interface through…

Advisors/Committee Members: Tohmé, Samir (thesis director), Khawam, Kinda (thesis director).

Subjects/Keywords: LTE 4G; Théorie des jeux; OFDM; Inter-cell interférences coordination (ICIC); Radiocommunications mobiles privées; LTE 4G; Game theory; OFDM; ICIC; Private mobile radio (PMR); Resource blocks (RBs); Power control; Nash equilibriums; Dynamic scheduling; Resource management

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Adouane, A. M. (2015). Dynamic management of spectral resources in LTE networks : Gestion dynamique des ressources spectrales dans les réseaux LTE. (Doctoral Dissertation). Versailles-St Quentin en Yvelines. Retrieved from http://www.theses.fr/2015VERS007V

Chicago Manual of Style (16^th Edition):

Adouane, Amine Mohamed. “Dynamic management of spectral resources in LTE networks : Gestion dynamique des ressources spectrales dans les réseaux LTE.” 2015. Doctoral Dissertation, Versailles-St Quentin en Yvelines. Accessed March 05, 2021. http://www.theses.fr/2015VERS007V.

MLA Handbook (7^th Edition):

Adouane, Amine Mohamed. “Dynamic management of spectral resources in LTE networks : Gestion dynamique des ressources spectrales dans les réseaux LTE.” 2015. Web. 05 Mar 2021.

Vancouver:

Adouane AM. Dynamic management of spectral resources in LTE networks : Gestion dynamique des ressources spectrales dans les réseaux LTE. [Internet] [Doctoral dissertation]. Versailles-St Quentin en Yvelines; 2015. [cited 2021 Mar 05]. Available from: http://www.theses.fr/2015VERS007V.

Council of Science Editors:

Adouane AM. Dynamic management of spectral resources in LTE networks : Gestion dynamique des ressources spectrales dans les réseaux LTE. [Doctoral Dissertation]. Versailles-St Quentin en Yvelines; 2015. Available from: http://www.theses.fr/2015VERS007V

19. Abbas, Nivine. Conception et performance de schémas de coordination dans les réseaux cellulaires : Design and performance of coordination schemes in cellular networks.

Degree: Docteur es, Informatique et Réseaux, 2016, Paris, ENST

URL: http://www.theses.fr/2016ENST0068

►

L'interférence entre stations de base est considérée comme le principal facteur limitant les performances des réseaux cellulaires. Nous nous intéressons aux différents schémas de coordination… (more)

▼

L'interférence entre stations de base est considérée comme le principal facteur limitant les performances des réseaux cellulaires. Nous nous intéressons aux différents schémas de coordination multi-point (CoMP) proposés dans la norme LTE-A pour y faire face, en tenant compte de l'aspect dynamique du trafic et de la mobilité des utilisateurs. Les résultats sont obtenus par l'analyse mathématique de modèles markoviens et par des simulations du système. Nous montrons l'importance de l'algorithme d'ordonnancement sur les performances en présence d'utilisateurs mobiles, pour des services de téléchargement de fichier et de streaming vidéo. Nous proposons un nouvel algorithme d'ordonnancement basé sur la dé-priorisation des utilisateurs mobiles se trouvant en bord de cellule, afin d'améliorer l'efficacité globale du système. Nous montrons ensuite qu'il est intéressant d'activer la technique dite Joint Processing uniquement dans un réseau à forte interférence, son activation dans un réseau à faible interférence pouvant conduire à une dégradation des performances. Nous proposons un nouveau mécanisme de coordination où une cellule ne coopère que lorsque sa coopération apporte un gain moyen de débit suffisant pour compenser les pertes de ressources engendrées. Nous considérons enfin la technique de formation de faisceaux coordonnée. Nous montrons notamment que la coordination n'est pas nécessaire lorsque l'on dispose d'un grand nombre d'antennes par station de base, un simple mécanisme d'ordonnancement opportuniste permettant d'obtenir des performances optimales. Pour un nombre limité d’antennes parstation de base, la coordination est nécessaire afin d’éviter l’interférence entre les faisceaux activés, et permet des gains de performance substantiels.

Interference is still the main limiting factor in cellular networks. We focus on the different coordinated multi-point schemes (CoMP) proposed in the LTE-A standard to cope with interference, taking into account the dynamic aspect of traffic and users’ mobility. The results are obtained by the analysis of Markov models and system-level simulations. We show the important impact of the scheduling strategy on the network performance in the presence of mobile users considering elastic traffic and video streaming. We propose a new scheduler that deprioritizes mobile users at the cell edge, in order to improve the overall system efficiency. We show that it is interesting to activate Joint Processing technique only in a high-interference network, its activation in a low-interference network may lead to performance degradation. We propose a new coordination mechanism, where a cell cooperates only when its cooperation brings a sufficient mean throughput gain, which compensates the extra resource consumption. Finally, we show that the coordination of beams is not necessary when a large number of antennas is deployed at each base station; a simple opportunistic scheduling strategy provides optimal performance. For a limited number of antennas per base station,coordination is necessary to…

Advisors/Committee Members: Bonald, Thomas (thesis director), Sayrac, Berna (thesis director).

Subjects/Keywords: Réseaux cellulaires; Mobilité; Ordonnancement opportuniste; Coordination multipoint CoMP; Technique de formation de faisceaux; Modélisation niveau flot du trafic; Théorie des files d'attente; Simulation système; 2D beamforming; Cellular data networks; Mobility; Opportunistic scheduling; Coordinated multipoint CoMP; Coordinated beamforming; Flow-level modeling; Queueing theory; System-level simulations; Faisceau 2D

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Abbas, N. (2016). Conception et performance de schémas de coordination dans les réseaux cellulaires : Design and performance of coordination schemes in cellular networks. (Doctoral Dissertation). Paris, ENST. Retrieved from http://www.theses.fr/2016ENST0068

Chicago Manual of Style (16^th Edition):

Abbas, Nivine. “Conception et performance de schémas de coordination dans les réseaux cellulaires : Design and performance of coordination schemes in cellular networks.” 2016. Doctoral Dissertation, Paris, ENST. Accessed March 05, 2021. http://www.theses.fr/2016ENST0068.

MLA Handbook (7^th Edition):

Abbas, Nivine. “Conception et performance de schémas de coordination dans les réseaux cellulaires : Design and performance of coordination schemes in cellular networks.” 2016. Web. 05 Mar 2021.

Vancouver:

Abbas N. Conception et performance de schémas de coordination dans les réseaux cellulaires : Design and performance of coordination schemes in cellular networks. [Internet] [Doctoral dissertation]. Paris, ENST; 2016. [cited 2021 Mar 05]. Available from: http://www.theses.fr/2016ENST0068.

Council of Science Editors:

Abbas N. Conception et performance de schémas de coordination dans les réseaux cellulaires : Design and performance of coordination schemes in cellular networks. [Doctoral Dissertation]. Paris, ENST; 2016. Available from: http://www.theses.fr/2016ENST0068

20. D'Ariano, A. Improving real-time train dispatching: Models, algorithms and applications.

Degree: 2008, TRAIL Research School

URL: http://resolver.tudelft.nl/uuid:178b886e-d6c8-4d39-be5d-03d9fa3a680f ; urn:NBN:nl:ui:24-uuid:178b886e-d6c8-4d39-be5d-03d9fa3a680f ; urn:NBN:nl:ui:24-uuid:178b886e-d6c8-4d39-be5d-03d9fa3a680f ; http://resolver.tudelft.nl/uuid:178b886e-d6c8-4d39-be5d-03d9fa3a680f

► Traffic controllers monitor railway traffic sequencing train movements and setting routes with the aim of ensuring smooth train behaviour and limiting as much as existing… (more)

▼ Traffic controllers monitor railway traffic sequencing train movements and setting routes with the aim of ensuring smooth train behaviour and limiting as much as existing delays. Due to the strict time limit available for computing a new timetable during operations, which so far is rather infeasible by using existing tools, railway traffic controllers usually restrict themselves mostly to a few manual timetable modifications and the chosen traffic control actions may be often sub-optimal. This PhD thesis is principally concerned with the design, implementation and evaluation of an advanced and robust laboratory tool for supporting railway traffic controllers in the everyday task of managing timetable disturbances. This dynamic traffic control system co-ordinates the speed of successive trains on open track, solves expected route conflicts and provides dynamic use of platform tracks in stations or alternative paths in a corridor between stations. Blocking time theory for modeling track occupation and signaling constraints is combined with alternative graphs for solving dynamic traffic control problems with the aim of increasing the punctuality and the use of infrastructure capacity at a network scale. The feasibility of the dispatching options is verified in a very short computation time by dynamic updating of the corresponding headways, train speeds and blocking time graphs, while the costs of the alternative dispatching options are measured in terms of maximum and average delays between consecutive trains at stations and other relevant points within the investigated network. To this end, the following achievements are included: (i) An innovative model for railway traffic optimization is presented to predict accurately train traffic flows and to enable the computation of optimal network schedules, i.e., all trains are managed simultaneously in a railway network for a given time period. (ii) The development of fast and effective scheduling algorithms based on the proposed model for the real-time management of a complex railway network is addressed. The objectives are to predict the evolution of train traffic within short computation times and to improve the punctuality by pro-actively detecting and solving train conflicts. (iii) A better use of rail capacity and a further improvement of punctuality are achieved by an iterative adjustment of train orders and routes in case of disturbances. Novel problem dedicated algorithms highlight the potential use of rerouting instead of only rescheduling the trains in order to limit the delay propagation as much as possible. (iv) Constructive algorithms for the dynamic modification of running times are provided that satisfy the timetable constraints of train orders and routes and guarantee the real-time feasibility of the running times, while respecting the signaling and safety systems in use. (v) A temporal decomposition method is introduced for the short-term traffic planning and control over a time period of up to several hours. This approach is of interest for traffic… Advisors/Committee Members: Hansen, I.A..

Subjects/Keywords: real-time rail traffic management; decision support systems; alternative graph; scheduling; routing; blocking time theory; train speed coordination

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

D'Ariano, A. (2008). Improving real-time train dispatching: Models, algorithms and applications. (Doctoral Dissertation). TRAIL Research School. Retrieved from http://resolver.tudelft.nl/uuid:178b886e-d6c8-4d39-be5d-03d9fa3a680f ; urn:NBN:nl:ui:24-uuid:178b886e-d6c8-4d39-be5d-03d9fa3a680f ; urn:NBN:nl:ui:24-uuid:178b886e-d6c8-4d39-be5d-03d9fa3a680f ; http://resolver.tudelft.nl/uuid:178b886e-d6c8-4d39-be5d-03d9fa3a680f

Chicago Manual of Style (16^th Edition):

D'Ariano, A. “Improving real-time train dispatching: Models, algorithms and applications.” 2008. Doctoral Dissertation, TRAIL Research School. Accessed March 05, 2021. http://resolver.tudelft.nl/uuid:178b886e-d6c8-4d39-be5d-03d9fa3a680f ; urn:NBN:nl:ui:24-uuid:178b886e-d6c8-4d39-be5d-03d9fa3a680f ; urn:NBN:nl:ui:24-uuid:178b886e-d6c8-4d39-be5d-03d9fa3a680f ; http://resolver.tudelft.nl/uuid:178b886e-d6c8-4d39-be5d-03d9fa3a680f.

MLA Handbook (7^th Edition):

D'Ariano, A. “Improving real-time train dispatching: Models, algorithms and applications.” 2008. Web. 05 Mar 2021.

Vancouver:

D'Ariano A. Improving real-time train dispatching: Models, algorithms and applications. [Internet] [Doctoral dissertation]. TRAIL Research School; 2008. [cited 2021 Mar 05]. Available from: http://resolver.tudelft.nl/uuid:178b886e-d6c8-4d39-be5d-03d9fa3a680f ; urn:NBN:nl:ui:24-uuid:178b886e-d6c8-4d39-be5d-03d9fa3a680f ; urn:NBN:nl:ui:24-uuid:178b886e-d6c8-4d39-be5d-03d9fa3a680f ; http://resolver.tudelft.nl/uuid:178b886e-d6c8-4d39-be5d-03d9fa3a680f.

Council of Science Editors:

D'Ariano A. Improving real-time train dispatching: Models, algorithms and applications. [Doctoral Dissertation]. TRAIL Research School; 2008. Available from: http://resolver.tudelft.nl/uuid:178b886e-d6c8-4d39-be5d-03d9fa3a680f ; urn:NBN:nl:ui:24-uuid:178b886e-d6c8-4d39-be5d-03d9fa3a680f ; urn:NBN:nl:ui:24-uuid:178b886e-d6c8-4d39-be5d-03d9fa3a680f ; http://resolver.tudelft.nl/uuid:178b886e-d6c8-4d39-be5d-03d9fa3a680f

Brno University of Technology

21. Karel, Jaroslav. Výrobna veterinárních léčiv Tekro – Nová Dědina - stavebně technologický projekt: Production of veterinary drugs Tekro - New Dědina - construction and technological project.

Degree: 2019, Brno University of Technology

URL: http://hdl.handle.net/11012/30465

► The content of this thesis is the construction technology project construction hall for the production of veterinary drugs Tekro in the village Nová Dedina. In… (more)

Subjects/Keywords: Ocelová konstrukce; opláštění haly; technologický předpis; časový plán; montáž; zařízení staveniště; stavební objekt; stavební stroje; kontrolní a zkušební plán; koordinační situace; technická zpráva; šroubový spoj; Steel structures; cladding halls; technological instruction; scheduling; installation; site; buildings; construction equipment; inspection and test plan; coordination; technical reports; bolting

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Karel, J. (2019). Výrobna veterinárních léčiv Tekro – Nová Dědina - stavebně technologický projekt: Production of veterinary drugs Tekro - New Dědina - construction and technological project. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/30465

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Karel, Jaroslav. “Výrobna veterinárních léčiv Tekro – Nová Dědina - stavebně technologický projekt: Production of veterinary drugs Tekro - New Dědina - construction and technological project.” 2019. Thesis, Brno University of Technology. Accessed March 05, 2021. http://hdl.handle.net/11012/30465.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Karel, Jaroslav. “Výrobna veterinárních léčiv Tekro – Nová Dědina - stavebně technologický projekt: Production of veterinary drugs Tekro - New Dědina - construction and technological project.” 2019. Web. 05 Mar 2021.

Vancouver:

Karel J. Výrobna veterinárních léčiv Tekro – Nová Dědina - stavebně technologický projekt: Production of veterinary drugs Tekro - New Dědina - construction and technological project. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Mar 05]. Available from: http://hdl.handle.net/11012/30465.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Karel J. Výrobna veterinárních léčiv Tekro – Nová Dědina - stavebně technologický projekt: Production of veterinary drugs Tekro - New Dědina - construction and technological project. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/30465

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

22. Al-Saedy, Murtadha. Performance analysis of multicell coordination in cellular wireless networks.

Degree: PhD, 2016, Brunel University

URL: http://bura.brunel.ac.uk/handle/2438/12606 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.685458

► In this thesis, multicell coordination for wireless cellular networks is studied, whereby various approaches have been conducted to tackle this issue. Firstly, the coverage probability… (more)

▼ In this thesis, multicell coordination for wireless cellular networks is studied, whereby various approaches have been conducted to tackle this issue. Firstly, the coverage probability and e ective capacity in downlink multiple-input multiple-output (MIMO) cellular system are considered. Two scenarios are investigated; in the rst scenario, it is assumed that the system employs distance-based fractional power control with no multicell coordination. For the second scenario, it is assumed that the system implements multicell coordinated beamforming so as to cancel inter-cell interference. The base stations (BS) are modelled as randomly uniformly distributed in the area according to Poisson point process (PPP). Using tools from stochastic geometry, tractable, analytical expressions for coverage probability and e ective capacity are derived for both scenarios. Secondly, an adaptive strategy for inter-cell interference cancellation and coordination is proposed for downlink multicarrier cellular random networks. The adaptive strategy coordinates and cancels the interference on the both frequency and spatial domains. Based on this adaptive strategy, two interference management schemes have been proposed. The adaptation process is implemented based on measured instantaneous signal-to-interference and noise ratio (SINR) of the considered user. Furthermore, the locations of base stations BSs are modelled as an independent spatial PPP. Using tools from stochastic geometry, the proposed schemes have been analytically evaluated. Analytical expressions for coverage probability are derived for both schemes. In addition, an expression for average rate has been derived using the coverage probability analysis. Thirdly, low complexity algorithms for user scheduling have been proposed for coordinated MIMO multicell network. The algorithms consist of two stages: multicell scheduling stage and precoding stage. The algorithm works on sequential distributive manner. Two variants of multicell scheduling are proposed. The rst algorithm has less complexity but leads to more di erence in sum rate among cells. While the second algorithm results in better fairness in terms of system performance but causes frequent signalling among the cells. Moreover, the algorithm is extended to multimode selection in addition to the user selection. Finally, an adaptive coordination scheme for energy-effeicient resource allocation has been developed for orthogonal frequency division multiple access (OFDMA) cellular networks. The proposed scheme consists of centralised and distributed stages for allocating resources to cell-edge and cell-centre users, respectively. The optimisation problems are formulated as integer linear fractional and integer linear problems for the first stage and second stages, respectively. The spectral-energy trade-o is analysed under the constraint of fairness among users. In summary, the research work presented in this thesis reveals statistical approach to analyse the multicell coordination in random cellular networks. It also offers…

Subjects/Keywords: 621.384; Multicell coordination; Multicell MIMO; Stochastic geometry; Multicell scheduling; Energy efficient resource

…Designing multicell coordination algorithm for joint user selection and user scheduling in… …allocation and scheduling, and inter-cell interference coordination techniques is presented… …5.4 5.5 5.6 5.3.2 Multicell Scheduling Problem Formulation 5.3.3 Computational… …Complexity Analysis . . . Proportional Fair Scheduling . . . . . . . . . . . . Simulation Results… …scheduling rule that should incorporate θ of the user…

12 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Al-Saedy, M. (2016). Performance analysis of multicell coordination in cellular wireless networks. (Doctoral Dissertation). Brunel University. Retrieved from http://bura.brunel.ac.uk/handle/2438/12606 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.685458

Chicago Manual of Style (16^th Edition):

Al-Saedy, Murtadha. “Performance analysis of multicell coordination in cellular wireless networks.” 2016. Doctoral Dissertation, Brunel University. Accessed March 05, 2021. http://bura.brunel.ac.uk/handle/2438/12606 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.685458.

MLA Handbook (7^th Edition):

Al-Saedy, Murtadha. “Performance analysis of multicell coordination in cellular wireless networks.” 2016. Web. 05 Mar 2021.

Vancouver:

Al-Saedy M. Performance analysis of multicell coordination in cellular wireless networks. [Internet] [Doctoral dissertation]. Brunel University; 2016. [cited 2021 Mar 05]. Available from: http://bura.brunel.ac.uk/handle/2438/12606 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.685458.

Council of Science Editors:

Al-Saedy M. Performance analysis of multicell coordination in cellular wireless networks. [Doctoral Dissertation]. Brunel University; 2016. Available from: http://bura.brunel.ac.uk/handle/2438/12606 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.685458

23. Mathew, Neil. Discrete Path Planing Strategies for Coverage and Multi-Robot Rendezvous.

Degree: 2014, University of Waterloo

URL: http://hdl.handle.net/10012/8169

► This thesis addresses the problem of motion planning for autonomous robots, given a map and an estimate of the robot pose within it. The motion… (more)

▼ This thesis addresses the problem of motion planning for autonomous robots, given a map and an estimate of the robot pose within it. The motion planning problem for a mobile robot can be defined as computing a trajectory in an environment from one pose to another while avoiding obstacles and optimizing some objective such as path length or travel time, subject to constraints like vehicle dynamics limitations. More complex planning problems such as multi-robot planning or complete coverage of an area can also be defined within a similar optimization structure. The computational complexity of path planning presents a considerable challenge for real-time execution with limited resources and various methods of simplifying the problem formulation by discretizing the solution space are grouped under the class of discrete planning methods. The approach suggests representing the environment as a roadmap graph and formulating shortest path problems to compute optimal robot trajectories on it. This thesis presents two main contributions under the framework of discrete planning. The first contribution addresses complete coverage of an unknown environment by a single omnidirectional ground rover. The 2D occupancy grid map of the environment is first converted into a polygonal representation and decomposed into a set of convex sectors. Second, a coverage path is computed through the sectors using a hierarchical inter-sector and intra-sector optimization structure. It should be noted that both convex decomposition and optimal sector ordering are known NP-hard problems, which are solved using a greedy cut approximation algorithm and Travelling Salesman Problem (TSP) heuristics, respectively. The second contribution presents multi-robot path-planning strategies for recharging autonomous robots performing a persistent task. The work considers the case of surveillance missions performed by a team of Unmanned Aerial Vehicles (UAVs). The goal is to plan minimum cost paths for a separate team of dedicated charging robots such that they rendezvous with and recharge all the UAVs as needed. To this end, planar UAV trajectories are discretized into sets of charging locations and a partitioned directed acyclic graph subject to timing constraints is defined over them. Solutions consist of paths through the graph for each of the charging robots. The rendezvous planning problem for a single recharge cycle is formulated as a Mixed Integer Linear Program (MILP), and an algorithmic approach, using a transformation to the TSP, is presented as a scalable heuristic alternative to the MILP. The solution is then extended to longer planning horizons using both a receding horizon and an optimal fixed horizon strategy. Simulation results are presented for both contributions, which demonstrate solution quality and performance of the presented algorithms.

Subjects/Keywords: motion planning; coverage; multi-robot surveillance; autonomous mobile robots; vehicle routing; scheduling and coordination

…environment and the scope of the planning problem may expand to task assignment or scheduling along…

8 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Mathew, N. (2014). Discrete Path Planing Strategies for Coverage and Multi-Robot Rendezvous. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8169

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Mathew, Neil. “Discrete Path Planing Strategies for Coverage and Multi-Robot Rendezvous.” 2014. Thesis, University of Waterloo. Accessed March 05, 2021. http://hdl.handle.net/10012/8169.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Mathew, Neil. “Discrete Path Planing Strategies for Coverage and Multi-Robot Rendezvous.” 2014. Web. 05 Mar 2021.

Vancouver:

Mathew N. Discrete Path Planing Strategies for Coverage and Multi-Robot Rendezvous. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2021 Mar 05]. Available from: http://hdl.handle.net/10012/8169.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mathew N. Discrete Path Planing Strategies for Coverage and Multi-Robot Rendezvous. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8169

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ)

24. Ζούμας, Χριστόφορος-Ανέστης. Εφαρμογή γενετικών αλγόριθμων στην επίλυση του προβλήματος της βραχυπρόθεσμης υδροθερμικής συνεργασίας.

Degree: 2007, Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ)

URL: http://hdl.handle.net/10442/hedi/15100

►

This dissertation deals with the Short-Term Hydrothermal Coordination (STHC) problem of electrical production systems under centralized management. SHTC is formulated as a Mixed Integer Programming… (more)

▼

This dissertation deals with the Short-Term Hydrothermal Coordination (STHC) problem of electrical production systems under centralized management. SHTC is formulated as a Mixed Integer Programming (MIP) problem with non-linear objective function. The initial large-scale optimization problem is decomposed into Hydro and Thermal sub-problems. In this decomposition scheme, the Hydro problem is solved by the proposed Enhanced Genetic Algorithm (EGA) and the Thermal problem by a generalized priority-list Unit Commitment. In contrast to other Genetic Algorithm solution approaches the Hydro problem is solved at unit-level. The slow convergence of the Simple Genetic Algorithm (SGA) is resolved with the introduction of problem specific genetic operators for the EGA approach. Application of the proposed EGA for the solution of the STHC of the Greek power production system proves the efficiency of the EGA in terms of solution quality and optimality criteria. EGA scalability is proven for double-sized systems with satisfactory results. Generality of the proposed EGA is tested against commercially available MIP solvers for a variation of MIP defined STHC with linear objective. Dissertation concludes with the inclusion of Transmission System constraints in terms of monitoring transmission capacity limits of high-voltage lines. Conducted experiments prove that the new problem is efficiently solved in the same EGA framework.

Η παρούσα διατριβή πραγματεύεται το πρόβλημα της Βραχυπρόθεσμης Υδροθερμικής Συ- νεργασίας (ΒΥΣ) σε συστήματα παραγωγής ηλεκτρικής ενέργειας με κεντρική διαχείρι- ση. Η ΒΥΣ τοποθετείται ως πρόβλημα Μικτού Ακεραίου Προγραμματισμού (ΜΑΠ) με μη- γραμμική συνάρτηση στόχου. Το πρόβλημα διασπάται σε Υδροηλεκτρικό και Θερμικό υπo- πρόβλημα βελτιστοποίησης. Το Υδροηλεκτρικό πρόβλημα επιλύεται με χρήση Βελτιωμένου Γενετικού Αλγορίθμου (ΒΓΑ) ενώ το αντίστοιχο Θερμικό με χρήση γενικευμένης λίστας προτεραιότητας. Η προτεινόμενη μεθοδολογία επίλυσης του Υδροηλεκτρικού προβλήματος παρέχει τη δυνατότητα μοντελοποίησης της κατάστασης ένταξης των υδροηλεκτρικών μο- νάδων. Η αργή σύγκλιση του Απλού Γενετικού Αλγορίθμου (ΑΓΑ) αντιμετωπίζεται με την ανάπτυξη ειδικών για το πρόβλημα της ΒΥΣ Γενετικών Τελεστών. Ο ΒΓΑ εφαρμόζεται για την επίλυση της ΒΥΣ του Ελληνικού συστήματος παραγωγής και τα εξαγόμενα αποτελέ- σματα αποδεικνύουν την υπεροχή του έναντι του ΑΓΑ. Η επεκτασιμότητα του ΒΓΑ διε- ρευνάται σε συστήματα διπλασίου μεγέθους με ικανοποιητικά αποτελέσματα. Η γενικό- τητα εφαρμογής του προτεινόμενου ΒΓΑ αποδεικνύεται κατά τη σύγκρισή του με εμπορι- κά διαθέσιμους επιλυτές προβλημάτων ΒΥΣ ΜΑΠ με γραμμική συνάρτηση στόχου. Η δια- τριβή ολοκληρώνεται με την εισαγωγή των περιορισμών του συστήματος μεταφοράς. Τα πειράματα εφαρμογής αποδεικνύουν ότι η ενσωμάτωση των επιπλέον περιορισμών δεν ε- πιβαρύνει σημαντικά το ρυθμό σύγκλισης και το τελικό αποτέλεσμα.

Subjects/Keywords: Υδροθερμική συνεργασία; Ένταξη μονάδων; Προγραμματισμός παραγωγής; Αλγόριθμοι, Γενετικοί; Συστήματα μεταφορών; Hydrothermal coordination; Unit commitment; Production scheduling; Algorithms, Genetic; Transmission systems

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ζούμας, . �. (2007). Εφαρμογή γενετικών αλγόριθμων στην επίλυση του προβλήματος της βραχυπρόθεσμης υδροθερμικής συνεργασίας. (Thesis). Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ). Retrieved from http://hdl.handle.net/10442/hedi/15100

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Ζούμας, Χριστόφορος-Ανέστης. “Εφαρμογή γενετικών αλγόριθμων στην επίλυση του προβλήματος της βραχυπρόθεσμης υδροθερμικής συνεργασίας.” 2007. Thesis, Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ). Accessed March 05, 2021. http://hdl.handle.net/10442/hedi/15100.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Ζούμας, Χριστόφορος-Ανέστης. “Εφαρμογή γενετικών αλγόριθμων στην επίλυση του προβλήματος της βραχυπρόθεσμης υδροθερμικής συνεργασίας.” 2007. Web. 05 Mar 2021.

Vancouver:

Ζούμας �. Εφαρμογή γενετικών αλγόριθμων στην επίλυση του προβλήματος της βραχυπρόθεσμης υδροθερμικής συνεργασίας. [Internet] [Thesis]. Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ); 2007. [cited 2021 Mar 05]. Available from: http://hdl.handle.net/10442/hedi/15100.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ζούμας �. Εφαρμογή γενετικών αλγόριθμων στην επίλυση του προβλήματος της βραχυπρόθεσμης υδροθερμικής συνεργασίας. [Thesis]. Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ); 2007. Available from: http://hdl.handle.net/10442/hedi/15100

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

25. Dima, Sofia-Maria. Wireless sensor and actor networks (WSANs): αλγόριθμοι αναγνώρισης γεγονότων βασισμένων σε τεχνικές ασαφούς λογικής με πρόβλεψη για απαίτηση απόκρισης πραγματικού χρόνου.

Degree: 2016, University of Patras; Πανεπιστήμιο Πατρών

URL: http://hdl.handle.net/10442/hedi/38442

► Event detection in real environments is a research area that has attracted a lot ofinterest. The discipline of artificial intelligence seems to have gained significant… (more)

▼ Event detection in real environments is a research area that has attracted a lot ofinterest. The discipline of artificial intelligence seems to have gained significant ground.The main objective of these areas is the creation of appropriate algorithms and buildingmodels on real data sets, so that the evaluation metrics are able to confirm their abilityto detect whether or not the existence of real events. Assuming a reliable system(evaluated by the relevant metrics (Accuracy, Sensitivity, Specificity)) the basic researchproblem is to investigate the performance of the above system when the application ishosted in a WSN topology, and more particularly when the system is executed in realWSN hardware platforms which are characterized by limited-resources and under theerror-prone nature of wireless communications. Hence, the problem is examined fromtwo perspectives: i.) What are the limitations during the development and theimplementation of such systems in WSN infrastructures and ii.) how the performance ofsuch systems is affected while the Network QoS varies within the network topology.For these reasons we designed and developed two fuzzy logic systems, whichevaluated in the Matlab environment. Then the above systems implemented in C andexecuted by the embedded WSN platforms TelosB hardware platforms. Theexperimental evaluation confirmed our initial beliefs about the impact of networkconditions on the performance of the algorithm and the monolithic approach of localprocessing demonstrated to affect vital to the application itself.Driven by these observations, we propose novel techniques in order to implement fuzzylogic systems in WSN infrastructures targeting optimal resource allocation within anetwork topology. Towards this objective, the technique denoted as Directed AcyclicGraph to Network Graph (DAG2NG) is presented leading to the distributed implementation of the Fuzzy Logic. Moreover, the event triggered execution of theFuzzy Inference Systems is implemented in order to achieve optimal CPU utilization.The task scheduling problem, is extended beyond the framework of the fuzzy logic. Sowe design, study and evaluate a series of scheduling models that allow the distributionof tasks within the wireless nodes. The application of these models in the field of WSNsallows the study of the energy efficiency, response time and justice between nodes in aseries of algorithmic problems (parallel, nonparallel, hybrid), which can exist in variousWSN applications.The semantic relationship between the wireless nodes, is another object of this thesis.Both the event triggered implementation of fuzzy logic systems and the management ofthe nodes participating in a task assignment model, involve the discovery of semanticneighbors. So we propose two new semantic discovery algorithms neighbors, whom weevaluate.The thesis concludes with the proposal of a new algorithm that seeks to give a newdimension and answer to the problem of node-to-actor coordination.The assignment of the sensors at specific actors, taking into account the…

Subjects/Keywords: Aναγώριση Γεγονότων; Ασύρματα Δίκτυα Αισθητήρων Ενεργοποιητών; Καταμερισμός εργασιών; Σημασιολογικοί Γείτονες; Συντονισμός κόμβων ενεργοποιητών; Ασαφής λογική; Event detection; Wireless Sensor and Actor Networks; Task Scheduling; Semantic Neighbors; Node-to-Actor Coordination; Fuzzy logic

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Dima, S. (2016). Wireless sensor and actor networks (WSANs): αλγόριθμοι αναγνώρισης γεγονότων βασισμένων σε τεχνικές ασαφούς λογικής με πρόβλεψη για απαίτηση απόκρισης πραγματικού χρόνου. (Thesis). University of Patras; Πανεπιστήμιο Πατρών. Retrieved from http://hdl.handle.net/10442/hedi/38442

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Dima, Sofia-Maria. “Wireless sensor and actor networks (WSANs): αλγόριθμοι αναγνώρισης γεγονότων βασισμένων σε τεχνικές ασαφούς λογικής με πρόβλεψη για απαίτηση απόκρισης πραγματικού χρόνου.” 2016. Thesis, University of Patras; Πανεπιστήμιο Πατρών. Accessed March 05, 2021. http://hdl.handle.net/10442/hedi/38442.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Dima, Sofia-Maria. “Wireless sensor and actor networks (WSANs): αλγόριθμοι αναγνώρισης γεγονότων βασισμένων σε τεχνικές ασαφούς λογικής με πρόβλεψη για απαίτηση απόκρισης πραγματικού χρόνου.” 2016. Web. 05 Mar 2021.

Vancouver:

Dima S. Wireless sensor and actor networks (WSANs): αλγόριθμοι αναγνώρισης γεγονότων βασισμένων σε τεχνικές ασαφούς λογικής με πρόβλεψη για απαίτηση απόκρισης πραγματικού χρόνου. [Internet] [Thesis]. University of Patras; Πανεπιστήμιο Πατρών; 2016. [cited 2021 Mar 05]. Available from: http://hdl.handle.net/10442/hedi/38442.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dima S. Wireless sensor and actor networks (WSANs): αλγόριθμοι αναγνώρισης γεγονότων βασισμένων σε τεχνικές ασαφούς λογικής με πρόβλεψη για απαίτηση απόκρισης πραγματικού χρόνου. [Thesis]. University of Patras; Πανεπιστήμιο Πατρών; 2016. Available from: http://hdl.handle.net/10442/hedi/38442

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Kyoto University / 京都大学

26. Nourjou, Reza. GIS-based Intelligent Assistant Agent for Supporting Decisions of Incident Commander in Disaster Response : 災害対応時における現場指揮官の判断支援のためのGISを基盤とした知的エージェントに関する研究.

Degree: 博士(情報学), 2014, Kyoto University / 京都大学

URL: http://hdl.handle.net/2433/188867 ; http://dx.doi.org/10.14989/doctor.k18408

新制・課程博士

甲第18408号

情博第523号

Subjects/Keywords: Incident Commander; Intelligent Software Agent; Coordination in Multi-agent Systems; Automated Planning and Scheduling; Disaster Crisis Response Management; Strategic Decision-Making; GIS and Spatial Intelligence

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Nourjou, R. (2014). GIS-based Intelligent Assistant Agent for Supporting Decisions of Incident Commander in Disaster Response : 災害対応時における現場指揮官の判断支援のためのGISを基盤とした知的エージェントに関する研究. (Thesis). Kyoto University / 京都大学. Retrieved from http://hdl.handle.net/2433/188867 ; http://dx.doi.org/10.14989/doctor.k18408

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Nourjou, Reza. “GIS-based Intelligent Assistant Agent for Supporting Decisions of Incident Commander in Disaster Response : 災害対応時における現場指揮官の判断支援のためのGISを基盤とした知的エージェントに関する研究.” 2014. Thesis, Kyoto University / 京都大学. Accessed March 05, 2021. http://hdl.handle.net/2433/188867 ; http://dx.doi.org/10.14989/doctor.k18408.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Nourjou, Reza. “GIS-based Intelligent Assistant Agent for Supporting Decisions of Incident Commander in Disaster Response : 災害対応時における現場指揮官の判断支援のためのGISを基盤とした知的エージェントに関する研究.” 2014. Web. 05 Mar 2021.

Vancouver:

Nourjou R. GIS-based Intelligent Assistant Agent for Supporting Decisions of Incident Commander in Disaster Response : 災害対応時における現場指揮官の判断支援のためのGISを基盤とした知的エージェントに関する研究. [Internet] [Thesis]. Kyoto University / 京都大学; 2014. [cited 2021 Mar 05]. Available from: http://hdl.handle.net/2433/188867 ; http://dx.doi.org/10.14989/doctor.k18408.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nourjou R. GIS-based Intelligent Assistant Agent for Supporting Decisions of Incident Commander in Disaster Response : 災害対応時における現場指揮官の判断支援のためのGISを基盤とした知的エージェントに関する研究. [Thesis]. Kyoto University / 京都大学; 2014. Available from: http://hdl.handle.net/2433/188867 ; http://dx.doi.org/10.14989/doctor.k18408

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Kyoto University

27. Nourjou, Reza. GIS-based Intelligent Assistant Agent for Supporting Decisions of Incident Commander in Disaster Response .

Degree: 2014, Kyoto University

URL: http://hdl.handle.net/2433/188867

Subjects/Keywords: Incident Commander; Intelligent Software Agent; Coordination in Multi-agent Systems; Automated Planning and Scheduling; Disaster Crisis Response Management; Strategic Decision-Making; GIS and Spatial Intelligence

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Nourjou, R. (2014). GIS-based Intelligent Assistant Agent for Supporting Decisions of Incident Commander in Disaster Response . (Thesis). Kyoto University. Retrieved from http://hdl.handle.net/2433/188867

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Nourjou, Reza. “GIS-based Intelligent Assistant Agent for Supporting Decisions of Incident Commander in Disaster Response .” 2014. Thesis, Kyoto University. Accessed March 05, 2021. http://hdl.handle.net/2433/188867.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Nourjou, Reza. “GIS-based Intelligent Assistant Agent for Supporting Decisions of Incident Commander in Disaster Response .” 2014. Web. 05 Mar 2021.

Vancouver:

Nourjou R. GIS-based Intelligent Assistant Agent for Supporting Decisions of Incident Commander in Disaster Response . [Internet] [Thesis]. Kyoto University; 2014. [cited 2021 Mar 05]. Available from: http://hdl.handle.net/2433/188867.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nourjou R. GIS-based Intelligent Assistant Agent for Supporting Decisions of Incident Commander in Disaster Response . [Thesis]. Kyoto University; 2014. Available from: http://hdl.handle.net/2433/188867

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

28. Σιμόπουλος, Δημήτριος. Βέλτιστος βραχυπρόθεσμος προγραμματισμός παραγωγής ηλεκτρικής ενέργειας με τη μέθοδο προσομοιωμένης ανόπτησης.

Degree: 2006, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ)

URL: http://hdl.handle.net/10442/hedi/16986

Subjects/Keywords: Παραγωγή, Βέλτιστος προγραμματισμός; Υδροθερμική συνεργασία; Ανόπτηση, Προσομοιωμένη; Αποκοπή αιχμών; Ρύποι, Εκπομπές; Optimal generation scheduling; Hydrothermal coordination; Simulated annealing; Peak shaving; Economic load dispathch; Emissions

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Σιμόπουλος, . �. (2006). Βέλτιστος βραχυπρόθεσμος προγραμματισμός παραγωγής ηλεκτρικής ενέργειας με τη μέθοδο προσομοιωμένης ανόπτησης. (Thesis). National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Retrieved from http://hdl.handle.net/10442/hedi/16986

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Σιμόπουλος, Δημήτριος. “Βέλτιστος βραχυπρόθεσμος προγραμματισμός παραγωγής ηλεκτρικής ενέργειας με τη μέθοδο προσομοιωμένης ανόπτησης.” 2006. Thesis, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Accessed March 05, 2021. http://hdl.handle.net/10442/hedi/16986.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Σιμόπουλος, Δημήτριος. “Βέλτιστος βραχυπρόθεσμος προγραμματισμός παραγωγής ηλεκτρικής ενέργειας με τη μέθοδο προσομοιωμένης ανόπτησης.” 2006. Web. 05 Mar 2021.

Vancouver:

Σιμόπουλος �. Βέλτιστος βραχυπρόθεσμος προγραμματισμός παραγωγής ηλεκτρικής ενέργειας με τη μέθοδο προσομοιωμένης ανόπτησης. [Internet] [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2006. [cited 2021 Mar 05]. Available from: http://hdl.handle.net/10442/hedi/16986.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Σιμόπουλος �. Βέλτιστος βραχυπρόθεσμος προγραμματισμός παραγωγής ηλεκτρικής ενέργειας με τη μέθοδο προσομοιωμένης ανόπτησης. [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2006. Available from: http://hdl.handle.net/10442/hedi/16986

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

29. Adolfsson, Hampus; Adolfsson, Mattias. A Web Application for Daily Staff Coordination in Hospital Care.

Degree: Information Technology, 2019, Uppsala University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-387378

►

Stress and heavy workloads are commonplace for those who work within Swedish healthcare; the issue is exacerbated further by the current shortage of qualified… (more)

Subjects/Keywords: hospital; care; coordination; schedule; scheduling; cross-platform; productivity; web application; usability; sjukhus; vård; organisering; schema; schemaläggning; plattformsöverskridande; produktivitet; webbapplikation; användbarhet; Engineering and Technology; Teknik och teknologier

…coordination within a hospital department. Its main purpose is to display a schedule designating to… …scheduling solution with respect to readability. The whiteboard previously used as a schedule had… …hospital nor department of, that requires staff coordination. We have held interviews with three… …description of the systems for staff coordination at their respective workplaces. The people… …x29; of Umeå University Hospital, the daily staff coordination was for the majority of the…

7 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Adolfsson, Hampus; Adolfsson, M. (2019). A Web Application for Daily Staff Coordination in Hospital Care. (Thesis). Uppsala University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-387378

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Adolfsson, Hampus; Adolfsson, Mattias. “A Web Application for Daily Staff Coordination in Hospital Care.” 2019. Thesis, Uppsala University. Accessed March 05, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-387378.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Adolfsson, Hampus; Adolfsson, Mattias. “A Web Application for Daily Staff Coordination in Hospital Care.” 2019. Web. 05 Mar 2021.

Vancouver:

Adolfsson, Hampus; Adolfsson M. A Web Application for Daily Staff Coordination in Hospital Care. [Internet] [Thesis]. Uppsala University; 2019. [cited 2021 Mar 05]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-387378.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Adolfsson, Hampus; Adolfsson M. A Web Application for Daily Staff Coordination in Hospital Care. [Thesis]. Uppsala University; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-387378

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Florida

30. Matsunaga, Andrea. Automatic Enablement, Coordination and Resource Usage Prediction of Unmodified Applications on Clouds.

Degree: PhD, Electrical and Computer Engineering, 2010, University of Florida

URL: https://ufdc.ufl.edu/UFE0041631

► As computing paradigms evolve and application demands grow, users face challenges in efficiently accessing, using and coordinating the large number of heterogeneous resources of complex… (more)

▼ As computing paradigms evolve and application demands grow, users face challenges in efficiently accessing, using and coordinating the large number of heterogeneous resources of complex computing systems. In the context of cloud computing, this work proposes methods to automate time-consuming processes currently performed by end users or developers, namely, the enabling of applications as services, the scaling-out of applications, and the estimation of resource consumption by applications. First, offering application services to consumers requires significant efforts by cloud providers, since many existing applications, useful to consumers, are not implemented as Web Services. To speed the creation of application services, this dissertation describes an approach to the automatic enablement of existing text-based applications with a command-line interface, called Command-Line Application Wrapper Service (CLAWS). Compared to other application-wrapping approaches, CLAWS exposes a simpler interface to users, completely hiding the complexities of understanding, developing and deploying access-controlled Web Services. CLAWS is motivated by, and effective for, the important case of interactive applications, which has not been considered by other approaches. The use of CLAWS is evaluated in the context of a transnational digital government project, where CLAWS greatly facilitated the integration of translation and conversation applications into an information sharing system. Second, in order to address the need to scale computationally intensive applications on clouds, this dissertation presents an end-to-end approach and best practices to run such large applications on multiple clouds. The techniques were implemented in CloudBLAST, combining the use of MapReduce model for coordinating the parallel execution of unmodified applications, machine virtualization for encapsulating applications and their execution environments, network virtualization to connect resources behind firewalls/NATs, and cloud management services to coordinate the deployment of a virtual cluster on demand. Experiments with CloudBLAST in cloud testbeds have demonstrated good scalability executing a bioinformatics application (BLAST), even when using cloud resources across wide-area networks and in the presence of machine and network virtualization. Third, a useful piece of information for scheduling jobs, typically not available, is the extent to which applications will use available resources, once executed on heterogeneous clouds. This dissertation comparatively assesses the suitability of several machine learning techniques for predicting linear and non-linear spatiotemporal utilization of resources, taking into account application- and system-specific attributes. This work also extends an existing classification tree algorithm, called Predicting Query Runtime (PQR), to the regression problem by selecting the best regression method for each collection of data on the leaves. When compared to other regression algorithms (linear, k-nearest neighbor,… Advisors/Committee Members: Fortes, Jose A. (committee chair), Figueiredo, Renato J. (committee member), Lam, Herman (committee member), Wilson, Joseph N. (committee member).

Subjects/Keywords: Bioinformatics; Blasts; Claws; Databases; Datasets; End users; Information resources; Scheduling; Software; Web services; algorithm, application, automation, bioinformatics, cloud, computing, coordination, distributed, enablement, learning, machine, mapreduce, network, prediction, services, virtualization

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Matsunaga, A. (2010). Automatic Enablement, Coordination and Resource Usage Prediction of Unmodified Applications on Clouds. (Doctoral Dissertation). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0041631

Chicago Manual of Style (16^th Edition):

Matsunaga, Andrea. “Automatic Enablement, Coordination and Resource Usage Prediction of Unmodified Applications on Clouds.” 2010. Doctoral Dissertation, University of Florida. Accessed March 05, 2021. https://ufdc.ufl.edu/UFE0041631.

MLA Handbook (7^th Edition):

Matsunaga, Andrea. “Automatic Enablement, Coordination and Resource Usage Prediction of Unmodified Applications on Clouds.” 2010. Web. 05 Mar 2021.

Vancouver:

Matsunaga A. Automatic Enablement, Coordination and Resource Usage Prediction of Unmodified Applications on Clouds. [Internet] [Doctoral dissertation]. University of Florida; 2010. [cited 2021 Mar 05]. Available from: https://ufdc.ufl.edu/UFE0041631.

Council of Science Editors:

Matsunaga A. Automatic Enablement, Coordination and Resource Usage Prediction of Unmodified Applications on Clouds. [Doctoral Dissertation]. University of Florida; 2010. Available from: https://ufdc.ufl.edu/UFE0041631

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations