subject:(Dynamic scheduling)

University of Minnesota

1. Hoffmann, Brandon. Performance Trade-offs in Dynamic Backup Scheduling.

Degree: M.S.E.C.E., Electrical Engineering, 2015, University of Minnesota

► Recently the amount of data generated and stored on computers has seen outrageous growth and the trend will only continue. With the 24 hour global… (more)

Subjects/Keywords: backup; dynamic; scheduling

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Hoffmann, B. (2015). Performance Trade-offs in Dynamic Backup Scheduling. (Masters Thesis). University of Minnesota. Retrieved from http://hdl.handle.net/11299/174781

Chicago Manual of Style (16^th Edition):

Hoffmann, Brandon. “Performance Trade-offs in Dynamic Backup Scheduling.” 2015. Masters Thesis, University of Minnesota. Accessed April 14, 2021. http://hdl.handle.net/11299/174781.

MLA Handbook (7^th Edition):

Hoffmann, Brandon. “Performance Trade-offs in Dynamic Backup Scheduling.” 2015. Web. 14 Apr 2021.

Vancouver:

Hoffmann B. Performance Trade-offs in Dynamic Backup Scheduling. [Internet] [Masters thesis]. University of Minnesota; 2015. [cited 2021 Apr 14]. Available from: http://hdl.handle.net/11299/174781.

Council of Science Editors:

Hoffmann B. Performance Trade-offs in Dynamic Backup Scheduling. [Masters Thesis]. University of Minnesota; 2015. Available from: http://hdl.handle.net/11299/174781

NSYSU

2. Dai, Hong-kwang. The cost minimization of steel material profolio using dynamic programming.

Degree: Master, Information Management, 2009, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0818109-155333

► In ordert to increasing the capacity of stocking and integration in the process of optimizing the internal cost in steel industry. The cost of material… (more)

Subjects/Keywords: material profolio; dynamic programming; scheduling

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Dai, H. (2009). The cost minimization of steel material profolio using dynamic programming. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0818109-155333

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):

Dai, Hong-kwang. “The cost minimization of steel material profolio using dynamic programming.” 2009. Thesis, NSYSU. Accessed April 14, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0818109-155333.

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

MLA Handbook (7^th Edition):

Dai, Hong-kwang. “The cost minimization of steel material profolio using dynamic programming.” 2009. Web. 14 Apr 2021.

Vancouver:

Dai H. The cost minimization of steel material profolio using dynamic programming. [Internet] [Thesis]. NSYSU; 2009. [cited 2021 Apr 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0818109-155333.

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

Council of Science Editors:

Dai H. The cost minimization of steel material profolio using dynamic programming. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0818109-155333

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

University of Alberta

3. Guo, Qiang. Dynamic Scheduling in a Delay-Constraint Vehicular Network: A Lyapunov-Optimization Approach.

Degree: MS, Department of Electrical and Computer Engineering, 2012, University of Alberta

URL: https://era.library.ualberta.ca/files/6q182m547

► Vehicular Network provides essential services to improve the road safety, extend the wireless connection coverage, and allow more reliable vehicle-to-vehicle communication. The key challenge of… (more)

Subjects/Keywords: Delay; Dynamic scheduling; Lyapunov; Vehicular

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Guo, Q. (2012). Dynamic Scheduling in a Delay-Constraint Vehicular Network: A Lyapunov-Optimization Approach. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/6q182m547

Chicago Manual of Style (16^th Edition):

Guo, Qiang. “Dynamic Scheduling in a Delay-Constraint Vehicular Network: A Lyapunov-Optimization Approach.” 2012. Masters Thesis, University of Alberta. Accessed April 14, 2021. https://era.library.ualberta.ca/files/6q182m547.

MLA Handbook (7^th Edition):

Guo, Qiang. “Dynamic Scheduling in a Delay-Constraint Vehicular Network: A Lyapunov-Optimization Approach.” 2012. Web. 14 Apr 2021.

Vancouver:

Guo Q. Dynamic Scheduling in a Delay-Constraint Vehicular Network: A Lyapunov-Optimization Approach. [Internet] [Masters thesis]. University of Alberta; 2012. [cited 2021 Apr 14]. Available from: https://era.library.ualberta.ca/files/6q182m547.

Council of Science Editors:

Guo Q. Dynamic Scheduling in a Delay-Constraint Vehicular Network: A Lyapunov-Optimization Approach. [Masters Thesis]. University of Alberta; 2012. Available from: https://era.library.ualberta.ca/files/6q182m547

Addis Ababa University

4. Daniel, Dilbie Tessema. Leakage Aware Hardware Architecture and Dynamic Power Scheduling for Mobile Devices .

Degree: 2012, Addis Ababa University

URL: http://etd.aau.edu.et/dspace/handle/123456789/4459

► In the last couple of decades, battery powered mobile devices such as smart phones have become one of the most prolific electronic devices in history.… (more)

▼ In the last couple of decades, battery powered mobile devices such as smart phones have become one of the most prolific electronic devices in history. With this has come an exploding demand for performance and features that cover almost every aspect of our digital multimedia interconnected lives including 3-D gaming, still and video cameras, WAN, Bluetooth, high- speed data connections, and so on. As ever increasing features continue to be integrated into these products, there is an ongoing need to develop innovative ways to reduce power consumption and extend battery life. A core requirement of effective and efficient management of energy is a good understanding of where and how the energy is used: how much of the system’s energy is consumed by which parts of the system and under what circumstances. In this work, a Smartphone is developed, hereafter referred to as the XLP, from the ground up with modular architecture where each module is supplied through an active switch matrix which is memory mapped and updated periodically by the main applications processor in the system. The basic notion of this architecture is achieving zero-leakage power for modules which are not being used. This significantly reduces the idle power consumption which accounts for more than 60% of the average power consumed in smart phones. In addition to this novel approach on the hardware architecture, a stochastic dynamic power scheduling and on-demand power and clock gating policies are developed. A number of possible policies are presented and, under given conditions, one of them is proved to be optimal using the energy response time product (ERP) metrics. The XLP is compared with three commercial smart phones, Openmoko Freerunner, HTC Dream and Google’s Nexus One on similar tests and usage scenarios. The XLP and all these three devices use the ARM microprocessor and run the Linux kernel. The comparison is on performance and power consumption. The XLP is proved to have the lowest power consumption on competitive performance levels. Advisors/Committee Members: Dr. Getachew Alemu (advisor).

Subjects/Keywords: Hardware Architecture; Power Scheduling; Dynamic

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Daniel, D. T. (2012). Leakage Aware Hardware Architecture and Dynamic Power Scheduling for Mobile Devices . (Thesis). Addis Ababa University. Retrieved from http://etd.aau.edu.et/dspace/handle/123456789/4459

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):

Daniel, Dilbie Tessema. “Leakage Aware Hardware Architecture and Dynamic Power Scheduling for Mobile Devices .” 2012. Thesis, Addis Ababa University. Accessed April 14, 2021. http://etd.aau.edu.et/dspace/handle/123456789/4459.

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

MLA Handbook (7^th Edition):

Daniel, Dilbie Tessema. “Leakage Aware Hardware Architecture and Dynamic Power Scheduling for Mobile Devices .” 2012. Web. 14 Apr 2021.

Vancouver:

Daniel DT. Leakage Aware Hardware Architecture and Dynamic Power Scheduling for Mobile Devices . [Internet] [Thesis]. Addis Ababa University; 2012. [cited 2021 Apr 14]. Available from: http://etd.aau.edu.et/dspace/handle/123456789/4459.

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

Council of Science Editors:

Daniel DT. Leakage Aware Hardware Architecture and Dynamic Power Scheduling for Mobile Devices . [Thesis]. Addis Ababa University; 2012. Available from: http://etd.aau.edu.et/dspace/handle/123456789/4459

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

5. Nie, Yisu. Integration of Scheduling and Dynamic Optimization: Computational Strategies and Industrial Applications.

Degree: 2014, Carnegie Mellon University

URL: http://repository.cmu.edu/dissertations/380

► This thesis study focuses on the development of model-based optimization strategies for the integration of process scheduling and dynamic optimization, and applications of the integrated… (more)

▼ This thesis study focuses on the development of model-based optimization strategies for the integration of process scheduling and dynamic optimization, and applications of the integrated approaches to industrial polymerization processes. The integrated decision making approaches seek to explore the synergy between production schedule design and process unit control to improve process performance. The integration problem has received much attention from both the academia and industry since the past decade. For scheduling, we adopt two formulation approaches based on the state equipment network and resource task network, respectively. For dynamic optimization, we rely on the simultaneous collocation strategy to discretize the differential-algebraic equations. Two integrated formulations are proposed that result in mixed discrete/dynamic models, and solution methods based on decomposition approaches are addressed. A class of ring-opening polymerization processes are used for our industrial case studies. We develop rigorous dynamic reactor models for both semi-batch homopolymerization and copolymerization operations. The reactor models are based on first-principles such as mass and heat balances, reaction kinetics and vapor-liquid equilibria. We derive reactor models with both the population balance method and method of moments. The obtained reactor models are validated using historical plant data. Polymerization recipes are optimized with dynamic optimization algorithms to reduce polymerization times by modifying operating conditions such as the reactor temperature and monomer feed rates over time. Next, we study scheduling methods that involve multiple process units and products. The resource task network scheduling model is reformulated to the state space form that offers a good platform for incorporating dynamic models. Lastly for the integration study, we investigate a process with two parallel polymerization reactors and downstream storage and purification units. The dynamic behaviors of the two reactors are coupled through shared cooling resources. We formulate the integration problem by combining the state space resource task network model with the moment reactor model. The case study results indicate promising improvements of process performances by applying dynamic optimization and scheduling optimization separately, and more importantly, the integration of the two.

Subjects/Keywords: process scheduling; dynamic optimization; process integration; polymerization

1 more image…

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Nie, Y. (2014). Integration of Scheduling and Dynamic Optimization: Computational Strategies and Industrial Applications. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/380

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):

Nie, Yisu. “Integration of Scheduling and Dynamic Optimization: Computational Strategies and Industrial Applications.” 2014. Thesis, Carnegie Mellon University. Accessed April 14, 2021. http://repository.cmu.edu/dissertations/380.

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

MLA Handbook (7^th Edition):

Nie, Yisu. “Integration of Scheduling and Dynamic Optimization: Computational Strategies and Industrial Applications.” 2014. Web. 14 Apr 2021.

Vancouver:

Nie Y. Integration of Scheduling and Dynamic Optimization: Computational Strategies and Industrial Applications. [Internet] [Thesis]. Carnegie Mellon University; 2014. [cited 2021 Apr 14]. Available from: http://repository.cmu.edu/dissertations/380.

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

Council of Science Editors:

Nie Y. Integration of Scheduling and Dynamic Optimization: Computational Strategies and Industrial Applications. [Thesis]. Carnegie Mellon University; 2014. Available from: http://repository.cmu.edu/dissertations/380

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

University of Toronto

6. Tran, Tony. Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments.

Degree: 2011, University of Toronto

URL: http://hdl.handle.net/1807/31609

►

The central thesis of this dissertation is that insight from queueing analysis can effectively guide standard (combinatorial) scheduling algorithms in dynamic environments. Scheduling is generally… (more)

Subjects/Keywords: Combinatorial Scheduling; Queueing Theory; Dynamic Network; 0546

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Tran, T. (2011). Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/31609

Chicago Manual of Style (16^th Edition):

Tran, Tony. “Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments.” 2011. Masters Thesis, University of Toronto. Accessed April 14, 2021. http://hdl.handle.net/1807/31609.

MLA Handbook (7^th Edition):

Tran, Tony. “Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments.” 2011. Web. 14 Apr 2021.

Vancouver:

Tran T. Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments. [Internet] [Masters thesis]. University of Toronto; 2011. [cited 2021 Apr 14]. Available from: http://hdl.handle.net/1807/31609.

Council of Science Editors:

Tran T. Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments. [Masters Thesis]. University of Toronto; 2011. Available from: http://hdl.handle.net/1807/31609

Loughborough University

7. Fahmy, Amer. A dynamic scheduling model for construction enterprises.

Degree: PhD, 2014, Loughborough University

URL: http://hdl.handle.net/2134/16099

► The vast majority of researches in the scheduling context focused on finding optimal or near-optimal predictive schedules under different scheduling problem characteristics. In the construction… (more)

Subjects/Keywords: 624.068; Dynamic scheduling; Construction planning; Schedules optimization

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Fahmy, A. (2014). A dynamic scheduling model for construction enterprises. (Doctoral Dissertation). Loughborough University. Retrieved from http://hdl.handle.net/2134/16099

Chicago Manual of Style (16^th Edition):

Fahmy, Amer. “A dynamic scheduling model for construction enterprises.” 2014. Doctoral Dissertation, Loughborough University. Accessed April 14, 2021. http://hdl.handle.net/2134/16099.

MLA Handbook (7^th Edition):

Fahmy, Amer. “A dynamic scheduling model for construction enterprises.” 2014. Web. 14 Apr 2021.

Vancouver:

Fahmy A. A dynamic scheduling model for construction enterprises. [Internet] [Doctoral dissertation]. Loughborough University; 2014. [cited 2021 Apr 14]. Available from: http://hdl.handle.net/2134/16099.

Council of Science Editors:

Fahmy A. A dynamic scheduling model for construction enterprises. [Doctoral Dissertation]. Loughborough University; 2014. Available from: http://hdl.handle.net/2134/16099

University of New South Wales

8. Tariq, Umair. Energy-Aware Task Scheduling with Conditional Precedence Constraints on MPSoCs.

Degree: Computer Science & Engineering, 2018, University of New South Wales

URL: http://handle.unsw.edu.au/1959.4/60342 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:51870/SOURCE02?view=true

► In order to extract maximum performance out of MPSoCs (Multiprocessor System on- Chips), efficientscheduling is crucial. In embedded systems, one of the major design goals… (more)

▼ In order to extract maximum performance out of MPSoCs (Multiprocessor System on- Chips), efficientscheduling is crucial. In embedded systems, one of the major design goals is minimizing energy consumption. Intelligent task scheduling approaches can guide the energy reduction approaches and at thesame time guarantee the timing constraints.In this thesis, we focus on three distinct problems in the domain of energy-aware scheduling of taskswith conditional precedence and timing constraints on MPSoCs (Multiprocessor System on- Chips).The first problem focuses on scheduling a set of non-pre-emptive tasks with individual deadlines andconditional precedence constraints on MPSoCs that consist of homogeneous processors and sharedmemory, such that the total processor energy consumption of all the tasks in each scenario is minimized.We have proposed a unified two-phase approach that consists of NLP (Non-linear Programming) basedoffline scheduler and an online task scheduler that performs task reallocation, rescheduling and speedassignment at runtime.In the second problem, we investigate the problem of scheduling a set of tasks with individual deadlinesand conditional precedence constraints on a heterogeneous NoC (Network on Chip)-based MPSoCsuch that the total expected energy consumption of all the tasks is minimized. Our approach consistsof a scheduling heuristic for constructing a single unified schedule for all the tasks and assigninga frequency to each task and each communication assuming continuous frequencies, an ILP (IntegerLinear Programming)-based algorithm and a polynomial time heuristic for assigning discrete frequenciesand voltages to tasks and communications.Finally, we solve the problem of scheduling and optimizing energy consumption of a set of tasks withconditional precedence constraints, individual deadlines and common period on a NoC based MPSoC.We achieve this goal by integrating DVFS with coarse-grained task-level software pipelining. Ourapproach not only optimizes energy consumption but ensures that memory overhead incurred due totask-level software pipelining satisfies the memory capacity bounds. Advisors/Committee Members: Wu, Hui, Computer Science & Engineering, Faculty of Engineering, UNSW.

Subjects/Keywords: Mapping; Power Optimization; Dynamic Voltage Scaling; Scheduling

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Tariq, U. (2018). Energy-Aware Task Scheduling with Conditional Precedence Constraints on MPSoCs. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/60342 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:51870/SOURCE02?view=true

Chicago Manual of Style (16^th Edition):

Tariq, Umair. “Energy-Aware Task Scheduling with Conditional Precedence Constraints on MPSoCs.” 2018. Doctoral Dissertation, University of New South Wales. Accessed April 14, 2021. http://handle.unsw.edu.au/1959.4/60342 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:51870/SOURCE02?view=true.

MLA Handbook (7^th Edition):

Tariq, Umair. “Energy-Aware Task Scheduling with Conditional Precedence Constraints on MPSoCs.” 2018. Web. 14 Apr 2021.

Vancouver:

Tariq U. Energy-Aware Task Scheduling with Conditional Precedence Constraints on MPSoCs. [Internet] [Doctoral dissertation]. University of New South Wales; 2018. [cited 2021 Apr 14]. Available from: http://handle.unsw.edu.au/1959.4/60342 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:51870/SOURCE02?view=true.

Council of Science Editors:

Tariq U. Energy-Aware Task Scheduling with Conditional Precedence Constraints on MPSoCs. [Doctoral Dissertation]. University of New South Wales; 2018. Available from: http://handle.unsw.edu.au/1959.4/60342 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:51870/SOURCE02?view=true

9. Visalakshi P. Certain investigations on particle Swarm optimization techniques for Multiprocessor scheduling problems;.

Degree: Certain investigations on particle Swarm optimization techniques for Multiprocessor scheduling problems, 2014, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/29042

►

The importance of scheduling has increased in recent years due to newlinethe growing consumer demand for variety of reduced product life cycles newline changing markets… (more)

Subjects/Keywords: Dynamic task scheduling; Genetic Algorithms; Multiprocessor scheduling problems; Particle Swarm Optimization

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

P, V. (2014). Certain investigations on particle Swarm optimization techniques for Multiprocessor scheduling problems;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/29042

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):

P, Visalakshi. “Certain investigations on particle Swarm optimization techniques for Multiprocessor scheduling problems;.” 2014. Thesis, Anna University. Accessed April 14, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/29042.

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

MLA Handbook (7^th Edition):

P, Visalakshi. “Certain investigations on particle Swarm optimization techniques for Multiprocessor scheduling problems;.” 2014. Web. 14 Apr 2021.

Vancouver:

P V. Certain investigations on particle Swarm optimization techniques for Multiprocessor scheduling problems;. [Internet] [Thesis]. Anna University; 2014. [cited 2021 Apr 14]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/29042.

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

Council of Science Editors:

P V. Certain investigations on particle Swarm optimization techniques for Multiprocessor scheduling problems;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/29042

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

University of Exeter

10. He, Naihui. Agent-based hierarchical planning and scheduling control in dynamically integrated manufacturing system.

Degree: PhD, 2011, University of Exeter

URL: https://ore.exeter.ac.uk/repository/handle/10036/3207 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.547045

► It has been broadly recognised that today’s manufacturing organisations face increasing pressures from continuous and unexpected changes in the business environment such as changes in… (more)

▼ It has been broadly recognised that today’s manufacturing organisations face increasing pressures from continuous and unexpected changes in the business environment such as changes in product types, changes in demand pattern, changes in manufacturing technologies etc. To enable manufacturing organisations to rapidly and timely deal with these changes, operational decisions (e.g., process planning and production scheduling) have to be integrated with dynamic system restructure or reconfiguration so that manufacturing organisations do not only use the flexible resource utilisations to deal with these changes, but also can dynamically reconfigure their existing system structures in response these changes. A manufacturing system concept and implementation methodology is proposed by the Exeter Manufacturing Enterprise Centre (XMEC), which is called the Dynamically Integrated Manufacturing System (DIMS). The overall aim of DIMS is to provide a systematic modelling and control framework in which operational decisions can be integrated with the dynamic system restructuring decisions so as to help manufacturing systems to dynamically deal with changes in the business environment. This PhD research is a part of DIMS research, which focuses on the investigation on operational control in DIMS. Based on the established agent-based modelling architecture in DIMS, this research develops two agent bidding mechanisms for the hierarchical control of production planning and scheduling. These two mechanisms work together to assist manufacturing systems in making optimal and flexible operational decisions in response to changes in the business environment. The first mechanism is the iterative agent bidding mechanism based on a Genetic Algorithm (GA) which facilitates the determination of the optimal or near optimal allocation of a production job containing a set of sub-jobs to a pool of heterarchical resources. The second mechanism is the hierarchical agent bidding mechanism which enables product orders to be cost-efficiently and flexibly planned and scheduled to meet the orders’ due dates. The novelty of this mechanism is that it enables orders to be fulfilled within structural constraints of manufacturing systems as far as possible and however enables resources to be regrouped flexibly across system boundaries when orders cannot be fulfilled within structural constraints of manufacturing systems.

Subjects/Keywords: 670.42; Dynamic planning and scheduling; planning and scheduling control

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

He, N. (2011). Agent-based hierarchical planning and scheduling control in dynamically integrated manufacturing system. (Doctoral Dissertation). University of Exeter. Retrieved from https://ore.exeter.ac.uk/repository/handle/10036/3207 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.547045

Chicago Manual of Style (16^th Edition):

He, Naihui. “Agent-based hierarchical planning and scheduling control in dynamically integrated manufacturing system.” 2011. Doctoral Dissertation, University of Exeter. Accessed April 14, 2021. https://ore.exeter.ac.uk/repository/handle/10036/3207 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.547045.

MLA Handbook (7^th Edition):

He, Naihui. “Agent-based hierarchical planning and scheduling control in dynamically integrated manufacturing system.” 2011. Web. 14 Apr 2021.

Vancouver:

He N. Agent-based hierarchical planning and scheduling control in dynamically integrated manufacturing system. [Internet] [Doctoral dissertation]. University of Exeter; 2011. [cited 2021 Apr 14]. Available from: https://ore.exeter.ac.uk/repository/handle/10036/3207 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.547045.

Council of Science Editors:

He N. Agent-based hierarchical planning and scheduling control in dynamically integrated manufacturing system. [Doctoral Dissertation]. University of Exeter; 2011. Available from: https://ore.exeter.ac.uk/repository/handle/10036/3207 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.547045

University of Waterloo

11. Jiang, Yangzi. Data-Driven Analytics to Support Scheduling of Multi-Priority Multi-Class Patients with Wait Targets.

Degree: 2016, University of Waterloo

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

► The aim of dynamic scheduling is to efficiently assign available resources to the most suitable patients. The dynamic assignment of multi-class, multi-priority patients over time… (more)

▼ The aim of dynamic scheduling is to efficiently assign available resources to the most suitable patients. The dynamic assignment of multi-class, multi-priority patients over time has long been a challenge, especially for scheduling in advance and under non-deterministic capacity. In this paper, we first conduct descriptive analytics on MRI data of over 3.7 million patient records from 74 hospitals. The dataset captures patients of four different priority levels, with different wait time targets, seeking treatment for one of ten classes of procedures, which have been scheduled over a period of 3 years. The goal is to serve 90% of patients within their wait time targets; however, under current practice, 67% of patients exceed their target wait times. We characterize the main factors affecting the waiting times and conduct predictive analytics to forecast the distribution of the daily patient arrivals, as well as the service capacity or number of procedures performed daily at each hospital. We then prescribe two simple and practical dynamic scheduling policies based on a balance between the First-In First-Out (FIFO) and strict priority policies; namely, weight accumulation and priority promotion. Under the weight accumulation policy, patients from different priority levels start with varying initial weights, which then accumulates as a linear function of their waiting time. Patients of higher weights are prioritized for treatment in each period. Under the priority promotion policy, a strict priority policy is applied to priority levels where patients are promoted to a higher priority level after waiting for a predetermined threshold of time. To evaluate the proposed policies, we design a simulation model that applies the proposed scheduling policies and evaluates them against two performance measures: 1) total exceeding time: the total number of days by which patients exceed their wait time target, and 2) overflow proportion: the percentage of patients within each priority group that exceed the wait time target. Using historical data, we show that, compared to the current practice, the proposed policies achieve a significant improvement in both performance measures. To investigate the value of information about the future demand, we schedule patients at different points of time from their day of arrival. The results show that hospitals can considerably enhance their wait time management by delaying patient scheduling.

Subjects/Keywords: healthcare operations; multi-priority patients; dynamic scheduling; advanced scheduling

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Jiang, Y. (2016). Data-Driven Analytics to Support Scheduling of Multi-Priority Multi-Class Patients with Wait Targets. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10615

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):

Jiang, Yangzi. “Data-Driven Analytics to Support Scheduling of Multi-Priority Multi-Class Patients with Wait Targets.” 2016. Thesis, University of Waterloo. Accessed April 14, 2021. http://hdl.handle.net/10012/10615.

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

MLA Handbook (7^th Edition):

Jiang, Yangzi. “Data-Driven Analytics to Support Scheduling of Multi-Priority Multi-Class Patients with Wait Targets.” 2016. Web. 14 Apr 2021.

Vancouver:

Jiang Y. Data-Driven Analytics to Support Scheduling of Multi-Priority Multi-Class Patients with Wait Targets. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2021 Apr 14]. Available from: http://hdl.handle.net/10012/10615.

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

Council of Science Editors:

Jiang Y. Data-Driven Analytics to Support Scheduling of Multi-Priority Multi-Class Patients with Wait Targets. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10615

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

University of Tasmania

12. Barika, MSM. Scheduling techniques for efficient execution of stream workflows in cloud environments.

Degree: 2020, University of Tasmania

URL: https://eprints.utas.edu.au/34812/1/Barika_whole_thesis.pdf ; Barika, MSM ORCID: 0000-0002-9146-2459 <https://orcid.org/0000-0002-9146-2459> 2020 , 'Scheduling techniques for efficient execution of stream workflows in cloud environments', PhD thesis, University of Tasmania.

► Advancements in Internet of Things (IoT) technology have led to the development of advanced applications and services that rely on data generated from enormous amounts… (more)

▼ Advancements in Internet of Things (IoT) technology have led to the development of advanced applications and services that rely on data generated from enormous amounts of connected devices such as sensors, mobile devices and smart cars. These applications process and analyse such data as it arrives to unleash the potential of live analytics. Considering that our future world will be fully automated, current IoT applications and services are categorised as data-driven workflows, which integrate multiple analytical components. Examples of these workflow applications are smart farming, smart retail and smart transportation. This work flow application also known as a stream work flow is one type of big data workflow application and is becoming gradually viable for solving real-time data computation problems that are more complex. The use of cloud computing technology which can provide on demand and elastic resources to execute stream workflow applications is ideal, but additional challenges are raised due to the location of data sources and end users' requirements in terms of data processing and deadline for decision making. The focus of existing research works in this domain is on the streaming operator graph generated by streaming data platforms, where this graph differs from a stream workflow as there is a single source of data for the whole operator graph and one end operator, while stream workflow has multiple input data sources and multiple output streams. Moreover, the majority of those works investigated one type of runtime change for the streaming graph operator, which is the fluctuation of data. This means that the structural changes that may happen at runtime are not studied. Considering the heterogeneity and dynamic behaviour of stream workflows, these workflow applications have unique features that make the scheduling problem have different assumptions and optimisation goals compared with the placement problem of streaming graph operators. As a consequence, the execution of stream workflow applications on the cloud environment requires advanced scheduling techniques to address the aforementioned challenges as well as handling different runtime changes that may occur during the execution of these applications. To this end, the Multicloud environment approach opens the door toward enhancing the execution of workflow applications by leveraging various clouds to utilise data locality and exploit deployment flexibility. Thus, the problem of scheduling a stream workflow in a Multicloud environment while meeting user real-time data analysis requirements needs to be investigated. In this thesis, we leverage the Multicloud environment approach to design novel scheduling techniques to efficiently schedule outsourcing stream workflow applications over various cloud infrastructures while minimising the execution cost. We also design dynamic scheduling techniques to continuously manage resources to handle structural and non-structural changes at runtime in order to maintain user-defined performance requirements at…

Subjects/Keywords: big data; internet of things; stream processing; stream workflow; meta-scheduling; dynamic scheduling; cloud computing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Barika, M. (2020). Scheduling techniques for efficient execution of stream workflows in cloud environments. (Thesis). University of Tasmania. Retrieved from https://eprints.utas.edu.au/34812/1/Barika_whole_thesis.pdf ; Barika, MSM ORCID: 0000-0002-9146-2459 <https://orcid.org/0000-0002-9146-2459> 2020 , 'Scheduling techniques for efficient execution of stream workflows in cloud environments', PhD thesis, University of Tasmania.

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):

Barika, MSM. “Scheduling techniques for efficient execution of stream workflows in cloud environments.” 2020. Thesis, University of Tasmania. Accessed April 14, 2021. https://eprints.utas.edu.au/34812/1/Barika_whole_thesis.pdf ; Barika, MSM ORCID: 0000-0002-9146-2459 <https://orcid.org/0000-0002-9146-2459> 2020 , 'Scheduling techniques for efficient execution of stream workflows in cloud environments', PhD thesis, University of Tasmania..

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

MLA Handbook (7^th Edition):

Barika, MSM. “Scheduling techniques for efficient execution of stream workflows in cloud environments.” 2020. Web. 14 Apr 2021.

Vancouver:

Barika M. Scheduling techniques for efficient execution of stream workflows in cloud environments. [Internet] [Thesis]. University of Tasmania; 2020. [cited 2021 Apr 14]. Available from: https://eprints.utas.edu.au/34812/1/Barika_whole_thesis.pdf ; Barika, MSM ORCID: 0000-0002-9146-2459 <https://orcid.org/0000-0002-9146-2459> 2020 , 'Scheduling techniques for efficient execution of stream workflows in cloud environments', PhD thesis, University of Tasmania..

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

Council of Science Editors:

Barika M. Scheduling techniques for efficient execution of stream workflows in cloud environments. [Thesis]. University of Tasmania; 2020. Available from: https://eprints.utas.edu.au/34812/1/Barika_whole_thesis.pdf ; Barika, MSM ORCID: 0000-0002-9146-2459 <https://orcid.org/0000-0002-9146-2459> 2020 , 'Scheduling techniques for efficient execution of stream workflows in cloud environments', PhD thesis, University of Tasmania.

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

Rochester Institute of Technology

13. Weilnau, Gregory. A Dynamic scheduling monitor for a manufacturing process.

Degree: Computer Science (GCCIS), 1990, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/588

► Dynamic scheduling is the ability to create an effective schedule based on the current state of a manufacturing factory. I have developed such a scheduler… (more)

Subjects/Keywords: Dynamic scheduling; Modeling; Scheduling; Simulation; Production scheduling

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Weilnau, G. (1990). A Dynamic scheduling monitor for a manufacturing process. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/588

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):

Weilnau, Gregory. “A Dynamic scheduling monitor for a manufacturing process.” 1990. Thesis, Rochester Institute of Technology. Accessed April 14, 2021. https://scholarworks.rit.edu/theses/588.

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

MLA Handbook (7^th Edition):

Weilnau, Gregory. “A Dynamic scheduling monitor for a manufacturing process.” 1990. Web. 14 Apr 2021.

Vancouver:

Weilnau G. A Dynamic scheduling monitor for a manufacturing process. [Internet] [Thesis]. Rochester Institute of Technology; 1990. [cited 2021 Apr 14]. Available from: https://scholarworks.rit.edu/theses/588.

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

Council of Science Editors:

Weilnau G. A Dynamic scheduling monitor for a manufacturing process. [Thesis]. Rochester Institute of Technology; 1990. Available from: https://scholarworks.rit.edu/theses/588

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

14. Φίλος Ράτσικας, Αλέξης. Προβλήματα επιτάχυνσης διεργασιών : αλγόριθμοι και πολυπλοκότητα.

Degree: 2014, University of Patras

URL: http://hdl.handle.net/10889/8330

►

Η διπλωµατική εργασία αποτελεί συνέχεια της µελέτης προβληµάτων χρονοπρογραµµατισµού µε αυστηρές προθεσµίες που ξεκίνησε η Αµαλία Στούµπου στην δικιά της διπλωµατική εργασία µε όνοµα "Προβλήµατα… (more)

▼

Η διπλωµατική εργασία αποτελεί συνέχεια της µελέτης προβληµάτων χρονοπρογραµµατισµού µε αυστηρές προθεσµίες που ξεκίνησε η Αµαλία Στούµπου στην δικιά της διπλωµατική εργασία µε όνοµα "Προβλήµατα Επιτάχυνσης ∆ιεργασιών σε Grid Computing: Αλγόριθµοι και Πολυπλοκότητα". Εξετάζονται προβλήµατα δροµολόγησης διεργασιών σε περισσότερους από έναν, ίδιους µεταξύ τους, επεξεργαστές. ∆ίνονται αλγόριθµοι που λύνουν το πρόβληµα ελαχιστοποίησης του συνολικού χρόνου εκτέλεσης, µε αυστηρές προθεσµίες, αρχικά για 2 και στη συνέχεια για m επεξεργαστές. Οι αλγόριθµοι αυτοί έχουν ψευδοπολυωνυµική πολυπλοκότητα. Στη συνέχεια εξετάζονται προβλήµατα δροµολόγησης και επιτάχυνσης διεργασιών µε ίδιο χρόνο εκτέλεσης, σε περιβάλλοντα µε ίδιους µεταξύ τους επεξεργαστές και δίνονται πολυωνυµικοί αλγόριθµοι που τα λύνουν. Τέλος αναφέρονται συνοπτικά ορισµένα προβλήµατα του ευρύτερου χώρου προϐληµάτων χρονοπρογραµµατισµού που µπορούν να προσεγγιστούν ή να λυθούν µε τεχνικές που εφαρµόστηκαν για τη λύση των προηγούµενων προβληµάτων που αναφέρθηκαν.

This thesis is a continuation of the study of scheduling problems with strict deadlines that begun in the thesis "Προβλήµατα Επιτάχυνσης ∆ιεργασιών σε Grid Computing : Αλγόριθµοι και Πολυπλοκότητα" by Amalia Stoumpou. We study scheduling problems on more than one parallel processors. Algorithms are given that solve the problem of minimizing the makespan with strict deadlines, first for 2 and then for m processors. These algorithms are pseudopolynomial in complexity. We also study problems of scheduling and speedup of processes with the same execution time in parallel processor environments and we give pseudopolynomial algorithms that solve them. Finally, we mention briefly other problems that can be solved or approached using the techniques that we applied to solve the previous problems.

Advisors/Committee Members: Κοσμαδάκης, Σταύρος, Filos Ratsikas, Alexis, Κοσμαδάκης, Σταύρος, Γαλλόπουλος, Ευστράτιος, Ζαρολιάγκης, Χρήστος.

Subjects/Keywords: Χρονοπρογραμματισμός; Προθεσμίες; Ψευδοπολυωνυμικός; Δυναμικός προγραμματισμός; 005.434; Scheduling; Deadlines; Pseudopolynomial; Dynamic programming

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Φίλος Ράτσικας, �. (2014). Προβλήματα επιτάχυνσης διεργασιών : αλγόριθμοι και πολυπλοκότητα. (Masters Thesis). University of Patras. Retrieved from http://hdl.handle.net/10889/8330

Chicago Manual of Style (16^th Edition):

Φίλος Ράτσικας, Αλέξης. “Προβλήματα επιτάχυνσης διεργασιών : αλγόριθμοι και πολυπλοκότητα.” 2014. Masters Thesis, University of Patras. Accessed April 14, 2021. http://hdl.handle.net/10889/8330.

MLA Handbook (7^th Edition):

Φίλος Ράτσικας, Αλέξης. “Προβλήματα επιτάχυνσης διεργασιών : αλγόριθμοι και πολυπλοκότητα.” 2014. Web. 14 Apr 2021.

Vancouver:

Φίλος Ράτσικας �. Προβλήματα επιτάχυνσης διεργασιών : αλγόριθμοι και πολυπλοκότητα. [Internet] [Masters thesis]. University of Patras; 2014. [cited 2021 Apr 14]. Available from: http://hdl.handle.net/10889/8330.

Council of Science Editors:

Φίλος Ράτσικας �. Προβλήματα επιτάχυνσης διεργασιών : αλγόριθμοι και πολυπλοκότητα. [Masters Thesis]. University of Patras; 2014. Available from: http://hdl.handle.net/10889/8330

15. Ahuja, Ravin. Dynamic priority scheduling for reservation based market grid; -.

Degree: Computer Engineering, 2013, University of Delhi

URL: http://shodhganga.inflibnet.ac.in/handle/10603/27679

Abstract included

Bibliography p. 116-129, including Appendices

Advisors/Committee Members: De, Asok and Gabrani, Goldie.

Subjects/Keywords: Computer; Dynamic; Grid; Reservation; Scheduling

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Ahuja, R. (2013). Dynamic priority scheduling for reservation based market grid; -. (Thesis). University of Delhi. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/27679

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):

Ahuja, Ravin. “Dynamic priority scheduling for reservation based market grid; -.” 2013. Thesis, University of Delhi. Accessed April 14, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/27679.

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

MLA Handbook (7^th Edition):

Ahuja, Ravin. “Dynamic priority scheduling for reservation based market grid; -.” 2013. Web. 14 Apr 2021.

Vancouver:

Ahuja R. Dynamic priority scheduling for reservation based market grid; -. [Internet] [Thesis]. University of Delhi; 2013. [cited 2021 Apr 14]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27679.

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

Council of Science Editors:

Ahuja R. Dynamic priority scheduling for reservation based market grid; -. [Thesis]. University of Delhi; 2013. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27679

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

16. Lu, Hengyao. Petri Net Modeling of Outpatient Waiting Time for MRI Examination.

Degree: 2013, University of Saskatchewan

URL: http://hdl.handle.net/10388/ETD-2013-11-1304

► In Canada, access to magnetic resonance imaging (MRI) examination is limited with an outcome of long patient waiting time. It is reported that the current… (more)

Subjects/Keywords: Petri nets; magnetic resonance imaging; scheduling; discrete event dynamic system; simulation

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Lu, H. (2013). Petri Net Modeling of Outpatient Waiting Time for MRI Examination. (Thesis). University of Saskatchewan. Retrieved from http://hdl.handle.net/10388/ETD-2013-11-1304

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):

Lu, Hengyao. “Petri Net Modeling of Outpatient Waiting Time for MRI Examination.” 2013. Thesis, University of Saskatchewan. Accessed April 14, 2021. http://hdl.handle.net/10388/ETD-2013-11-1304.

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

MLA Handbook (7^th Edition):

Lu, Hengyao. “Petri Net Modeling of Outpatient Waiting Time for MRI Examination.” 2013. Web. 14 Apr 2021.

Vancouver:

Lu H. Petri Net Modeling of Outpatient Waiting Time for MRI Examination. [Internet] [Thesis]. University of Saskatchewan; 2013. [cited 2021 Apr 14]. Available from: http://hdl.handle.net/10388/ETD-2013-11-1304.

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

Council of Science Editors:

Lu H. Petri Net Modeling of Outpatient Waiting Time for MRI Examination. [Thesis]. University of Saskatchewan; 2013. Available from: http://hdl.handle.net/10388/ETD-2013-11-1304

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

Texas A&M University

17. Li, Hang. Exploiting Diversity by Opportunistic Scheduling in Energy Harvesting Wireless Networks.

Degree: PhD, Electrical Engineering, 2016, Texas A&M University

URL: http://hdl.handle.net/1969.1/157836

► It is in recent years that harvesting energy from ambient energy sources (e.g., solar, wind, or vibration) has been commercialized, which is a promising technique… (more)

▼ It is in recent years that harvesting energy from ambient energy sources (e.g., solar, wind, or vibration) has been commercialized, which is a promising technique to fulfil sustainable operations for many kinds of electrical systems. To advocate reducing the emission of greenhouse gases, people in communication society are seeking to accommodate and take advantage of this new technology for wireless systems, such as sensor networks, Internet of Things, and heterogeneous networks. In this dissertation, we focus on energy harvesting (EH) based wireless networks, where multiple users are powered by energy harvesters and share limited spectrum resources. In this system, the design of efficient access schemes plays a crucial role in optimizing the system performance. Moreover, different from the conventional wireless systems, there are two random processes that must be jointly counted in the transmission design: the channel fading and the dynamics of the EH powered battery. Specifically, we narrow down the design onto two typical network setups. First, in a single channel access scenario, an ad hoc network with multiple transmitter-receiver pairs is considered, where all EH-based transmitters share one channel by random access. Two EH rate models are applied: Constant and i.i.d. (i.e., independent and identically distributed) EH rate models. To quantify the roles of both the energy and channel state information, a distributed opportunistic scheduling framework is proposed such that the average throughput of the network is maximized. Second, in a multi-channel access scenario, we study an uplink transmission under a heterogeneous network hierarchy, where each EH-based mobile user (MU) is capable of both deterministically accessing to a large network via one private channel, and dynamically accessing a small network with a certain probability via one common channel shared by multiple MUs. Considering a time-correlated EH model, we study an opportunistic transmission scheme to maximize the average throughput for each MU by jointly exploiting the statistics of the system states. Finally, back to the single channel access setup, we investigate the multiuser energy diversity by analyzing the fundamental scaling law of the throughput over the number of EH-based users under both centralized and distributed access schemes. We reveal the throughput gain coming from both the increase of total available energy harvested over time/space and the combined dynamics of batteries. Advisors/Committee Members: Cui, Shuguang (advisor), Xiong, Zixiang (committee member), Hou, I-Hong (committee member), Johnson, William Bill (committee member).

Subjects/Keywords: opportunistic scheduling; energy harvesting; optimal stopping; dynamic programming; multiuser diversity

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Li, H. (2016). Exploiting Diversity by Opportunistic Scheduling in Energy Harvesting Wireless Networks. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/157836

Chicago Manual of Style (16^th Edition):

Li, Hang. “Exploiting Diversity by Opportunistic Scheduling in Energy Harvesting Wireless Networks.” 2016. Doctoral Dissertation, Texas A&M University. Accessed April 14, 2021. http://hdl.handle.net/1969.1/157836.

MLA Handbook (7^th Edition):

Li, Hang. “Exploiting Diversity by Opportunistic Scheduling in Energy Harvesting Wireless Networks.” 2016. Web. 14 Apr 2021.

Vancouver:

Li H. Exploiting Diversity by Opportunistic Scheduling in Energy Harvesting Wireless Networks. [Internet] [Doctoral dissertation]. Texas A&M University; 2016. [cited 2021 Apr 14]. Available from: http://hdl.handle.net/1969.1/157836.

Council of Science Editors:

Li H. Exploiting Diversity by Opportunistic Scheduling in Energy Harvesting Wireless Networks. [Doctoral Dissertation]. Texas A&M University; 2016. Available from: http://hdl.handle.net/1969.1/157836

Penn State University

18. Beevers, David Bryan. Optimization of Hydrologically Linked Hydropower Systems with Multiple Owners through Water Payments.

Degree: 2015, Penn State University

URL: https://submit-etda.libraries.psu.edu/catalog/26685

► Before the advent of deregulated electricity markets in the 1990’s, hydroelectric power production schedules were typically coordinated with the schedules of other generating technologies by… (more)

▼ Before the advent of deregulated electricity markets in the 1990’s, hydroelectric power production schedules were typically coordinated with the schedules of other generating technologies by utility companies to meet expected regional demand. However, the growing adoption of deregulated markets requires the development of new methods for determining optimal utilization of hydroelectric resources. Much work has been performed regarding the optimization of cascaded hydropower systems owned and operated by single entities. However, these works fail to address the complexity involved in optimizing a cascaded system with owners along the same river. In those instances, each plant is limited to operate with whatever water flow the upstream plants choose to make available. In this situation, system optimal operation results in higher net system revenue than individual optimization of each plant with whatever water flow is available. However, such an optimal system solution must also result in lower net revenue for some owners compared to the value they would obtain through individual optimization. Hence, a novel methodology is proposed in which individual optimization naturally leads to system optimization through the use of iteratively determined water payments to direct the release of water toward a more optimal utilization. The proposed method alternates between dynamic programming for individual optimization and gradient analysis to determine and update hourly, location-specific water values for modified release. The sequence is repeated until there are no further additions or modifications to the payment schedule that results in increased total revenue. The water values are based upon local and downstream revenue gradients with respect to the flow rate released by the upstream facility during each time period. The method is applied in this thesis to a hydropower system consisting of three connected hydropower facilities, successfully increasing the total gross revenue of each installation. Although the algorithm it is not yet able to achieve the globally optimal solution, it comes quite close and offers unique insights into the value of water. Advisors/Committee Members: Horacio Perez Blanco, Dissertation Advisor/Co-Advisor, Horacio Perez Blanco, Committee Chair/Co-Chair, Hosam Kadry Fathy, Committee Member, Anil Kamalakant Kulkarni, Committee Member, Vinayak V Shanbhag, Committee Member, Seth Adam Blumsack, Committee Member.

Subjects/Keywords: hydropower; optimization; day-ahead; operations; scheduling; dynamic programming

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Beevers, D. B. (2015). Optimization of Hydrologically Linked Hydropower Systems with Multiple Owners through Water Payments. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/26685

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):

Beevers, David Bryan. “Optimization of Hydrologically Linked Hydropower Systems with Multiple Owners through Water Payments.” 2015. Thesis, Penn State University. Accessed April 14, 2021. https://submit-etda.libraries.psu.edu/catalog/26685.

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

MLA Handbook (7^th Edition):

Beevers, David Bryan. “Optimization of Hydrologically Linked Hydropower Systems with Multiple Owners through Water Payments.” 2015. Web. 14 Apr 2021.

Vancouver:

Beevers DB. Optimization of Hydrologically Linked Hydropower Systems with Multiple Owners through Water Payments. [Internet] [Thesis]. Penn State University; 2015. [cited 2021 Apr 14]. Available from: https://submit-etda.libraries.psu.edu/catalog/26685.

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

Council of Science Editors:

Beevers DB. Optimization of Hydrologically Linked Hydropower Systems with Multiple Owners through Water Payments. [Thesis]. Penn State University; 2015. Available from: https://submit-etda.libraries.psu.edu/catalog/26685

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

University of Connecticut

19. Cletus, Tenil. Dynamic Test Scheduling in Hardware-In-the-Loop Simulation of Commercial Vehicles.

Degree: MS, Electrical Engineering, 2011, University of Connecticut

URL: https://opencommons.uconn.edu/gs_theses/203

► Modern day commercial vehicles are controlled by various Electronic Control Units (ECU). They are not only tested as single units, but also by networking… (more)

▼ Modern day commercial vehicles are controlled by various Electronic Control Units (ECU). They are not only tested as single units, but also by networking them in Controlled Area Network bus (CAN) to form a complete electrical control system. This is achieved using Hardware In the Loop (HIL) Integration Lab. In HIL, the electrical system is connected to a real time mathematical model of the vehicle plus it’s environment so as to form a loop. Testing functionality of the electrical system begins by defining functional tests. An example would be testing cruise control activation. Executing each test is made possible by parameterizing variables in the vehicle dynamic model and externally controlling them. HIL based Verification and Validation (V&V) is moving towards automation. This is because of the complexity of electrical control systems is increasing and manual V&V is time consuming. In an automated test environment, a Test Engineer develops test scripts to implement functional tests. These test scripts execute the vehicle model in real time, control parameterized variables, and observe the electrical system response. This is compared to the expected response to decide if a functional test passed or failed. Tests are designed to remain independent of each other. Scheduling of tests is done by the Test Engineer, which is a difficult task owing to their large number and possible combinations. Hence, the normal practice is to execute tests in a predefined sequence. To solve the test scheduling problem in Hardware In the Loop simulation, two solutions are proposed. Both the solutions exploit relationship between test case and state of the vehicle in a dynamic simulation environment. An example of such relationship is engaging cruise control only when vehicle speed is above 20 km/h. It can be proved that a test process that is sensitive to the simulation environment will be more realistic and hence efficient. One solution is to model the test execution as a state machine. Tests are treated as states. Entry conditions for each state are defined using state variables of the dynamic model. When a simulation is run, state variables of the dynamic model are sampled in real time. One sample of state variables trigger a transition from one state to another in the state machine. When the state machine is in one state, a test case corresponding to that state is selected and executed. A sequence of these transitions results in a test process evolving in time. The second proposed solution is functionally similar to a state machine but it’s implementation is derived from logic design. Here, one sample of state variables is compared with entry conditions of each test case. Test cases whose entry conditions match with the current sample are selected for execution. Both the solutions use Failure Mode Effective Analysis (FMEA) to resolve test selection conflicts, that is, situations where more than one test is selected. Results show that test execution using this… Advisors/Committee Members: Krishna R. Pattipati, Robert S. Lynch, Chengyu Cao.

Subjects/Keywords: Hardware-In-the-Loop simulation; HIL; Dynamic Scheduling; Verification and Validation

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Cletus, T. (2011). Dynamic Test Scheduling in Hardware-In-the-Loop Simulation of Commercial Vehicles. (Masters Thesis). University of Connecticut. Retrieved from https://opencommons.uconn.edu/gs_theses/203

Chicago Manual of Style (16^th Edition):

Cletus, Tenil. “Dynamic Test Scheduling in Hardware-In-the-Loop Simulation of Commercial Vehicles.” 2011. Masters Thesis, University of Connecticut. Accessed April 14, 2021. https://opencommons.uconn.edu/gs_theses/203.

MLA Handbook (7^th Edition):

Cletus, Tenil. “Dynamic Test Scheduling in Hardware-In-the-Loop Simulation of Commercial Vehicles.” 2011. Web. 14 Apr 2021.

Vancouver:

Cletus T. Dynamic Test Scheduling in Hardware-In-the-Loop Simulation of Commercial Vehicles. [Internet] [Masters thesis]. University of Connecticut; 2011. [cited 2021 Apr 14]. Available from: https://opencommons.uconn.edu/gs_theses/203.

Council of Science Editors:

Cletus T. Dynamic Test Scheduling in Hardware-In-the-Loop Simulation of Commercial Vehicles. [Masters Thesis]. University of Connecticut; 2011. Available from: https://opencommons.uconn.edu/gs_theses/203

University of Ottawa

20. Astaraky, Davood. A Simulation Based Approximate Dynamic Programming Approach to Multi-class, Multi-resource Surgical Scheduling .

Degree: 2013, University of Ottawa

URL: http://hdl.handle.net/10393/23622

► The thesis focuses on a model that seeks to address patient scheduling step of the surgical scheduling process to determine the number of surgeries to… (more)

Subjects/Keywords: Approximate Dynamic Programming; Surgical Scheduling; Markov Decision Process

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Astaraky, D. (2013). A Simulation Based Approximate Dynamic Programming Approach to Multi-class, Multi-resource Surgical Scheduling . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/23622

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):

Astaraky, Davood. “A Simulation Based Approximate Dynamic Programming Approach to Multi-class, Multi-resource Surgical Scheduling .” 2013. Thesis, University of Ottawa. Accessed April 14, 2021. http://hdl.handle.net/10393/23622.

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

MLA Handbook (7^th Edition):

Astaraky, Davood. “A Simulation Based Approximate Dynamic Programming Approach to Multi-class, Multi-resource Surgical Scheduling .” 2013. Web. 14 Apr 2021.

Vancouver:

Astaraky D. A Simulation Based Approximate Dynamic Programming Approach to Multi-class, Multi-resource Surgical Scheduling . [Internet] [Thesis]. University of Ottawa; 2013. [cited 2021 Apr 14]. Available from: http://hdl.handle.net/10393/23622.

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

Council of Science Editors:

Astaraky D. A Simulation Based Approximate Dynamic Programming Approach to Multi-class, Multi-resource Surgical Scheduling . [Thesis]. University of Ottawa; 2013. Available from: http://hdl.handle.net/10393/23622

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

Brigham Young University

21. Heasley, McKay N. Dynamic Appointment Scheduling in Healthcare.

Degree: MS, 2011, Brigham Young University

URL: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4175&context=etd

► In recent years, healthcare management has become fertile ground for the scheduling theory community. In addition to an extensive academic literature on this subject, there… (more)

Subjects/Keywords: dynamic programming; appointment scheduling; health care; Bell numbers; Mathematics

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Heasley, M. N. (2011). Dynamic Appointment Scheduling in Healthcare. (Masters Thesis). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4175&context=etd

Chicago Manual of Style (16^th Edition):

Heasley, McKay N. “Dynamic Appointment Scheduling in Healthcare.” 2011. Masters Thesis, Brigham Young University. Accessed April 14, 2021. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4175&context=etd.

MLA Handbook (7^th Edition):

Heasley, McKay N. “Dynamic Appointment Scheduling in Healthcare.” 2011. Web. 14 Apr 2021.

Vancouver:

Heasley MN. Dynamic Appointment Scheduling in Healthcare. [Internet] [Masters thesis]. Brigham Young University; 2011. [cited 2021 Apr 14]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4175&context=etd.

Council of Science Editors:

Heasley MN. Dynamic Appointment Scheduling in Healthcare. [Masters Thesis]. Brigham Young University; 2011. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4175&context=etd

Delft University of Technology

22. De Jong, J.L. Heuristics in dynamic scheduling: A practical framework with a case study in elevator dispatching.

Degree: 2012, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:90cba556-1565-4a6d-b496-e211b162f85f ; urn:NBN:nl:ui:24-uuid:90cba556-1565-4a6d-b496-e211b162f85f ; urn:NBN:nl:ui:24-uuid:90cba556-1565-4a6d-b496-e211b162f85f ; http://resolver.tudelft.nl/uuid:90cba556-1565-4a6d-b496-e211b162f85f

► Dynamic scheduling problems are ubiquitous: traffic lights, elevators, planning of manufacturing plants, air traffic control, etc. Tasks have to be put on a timeline as… (more)

Subjects/Keywords: heuristics; metaheuristics; dynamic scheduling; elevators

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

De Jong, J. L. (2012). Heuristics in dynamic scheduling: A practical framework with a case study in elevator dispatching. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:90cba556-1565-4a6d-b496-e211b162f85f ; urn:NBN:nl:ui:24-uuid:90cba556-1565-4a6d-b496-e211b162f85f ; urn:NBN:nl:ui:24-uuid:90cba556-1565-4a6d-b496-e211b162f85f ; http://resolver.tudelft.nl/uuid:90cba556-1565-4a6d-b496-e211b162f85f

Chicago Manual of Style (16^th Edition):

De Jong, J L. “Heuristics in dynamic scheduling: A practical framework with a case study in elevator dispatching.” 2012. Doctoral Dissertation, Delft University of Technology. Accessed April 14, 2021. http://resolver.tudelft.nl/uuid:90cba556-1565-4a6d-b496-e211b162f85f ; urn:NBN:nl:ui:24-uuid:90cba556-1565-4a6d-b496-e211b162f85f ; urn:NBN:nl:ui:24-uuid:90cba556-1565-4a6d-b496-e211b162f85f ; http://resolver.tudelft.nl/uuid:90cba556-1565-4a6d-b496-e211b162f85f.

MLA Handbook (7^th Edition):

De Jong, J L. “Heuristics in dynamic scheduling: A practical framework with a case study in elevator dispatching.” 2012. Web. 14 Apr 2021.

Vancouver:

De Jong JL. Heuristics in dynamic scheduling: A practical framework with a case study in elevator dispatching. [Internet] [Doctoral dissertation]. Delft University of Technology; 2012. [cited 2021 Apr 14]. Available from: http://resolver.tudelft.nl/uuid:90cba556-1565-4a6d-b496-e211b162f85f ; urn:NBN:nl:ui:24-uuid:90cba556-1565-4a6d-b496-e211b162f85f ; urn:NBN:nl:ui:24-uuid:90cba556-1565-4a6d-b496-e211b162f85f ; http://resolver.tudelft.nl/uuid:90cba556-1565-4a6d-b496-e211b162f85f.

Council of Science Editors:

De Jong JL. Heuristics in dynamic scheduling: A practical framework with a case study in elevator dispatching. [Doctoral Dissertation]. Delft University of Technology; 2012. Available from: http://resolver.tudelft.nl/uuid:90cba556-1565-4a6d-b496-e211b162f85f ; urn:NBN:nl:ui:24-uuid:90cba556-1565-4a6d-b496-e211b162f85f ; urn:NBN:nl:ui:24-uuid:90cba556-1565-4a6d-b496-e211b162f85f ; http://resolver.tudelft.nl/uuid:90cba556-1565-4a6d-b496-e211b162f85f

University of Illinois – Urbana-Champaign

23. Kale, Vivek. Low-overhead scheduling for improving performance of scientific applications.

Degree: PhD, Computer Science, 2015, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/78642

► Application performance can degrade significantly due to node-local load imbalances during application execution on a large number of SMP nodes. These imbalances can arise from… (more)

Subjects/Keywords: multicore architecture; dynamic scheduling; scientific computing; performance tuning

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Kale, V. (2015). Low-overhead scheduling for improving performance of scientific applications. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/78642

Chicago Manual of Style (16^th Edition):

Kale, Vivek. “Low-overhead scheduling for improving performance of scientific applications.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 14, 2021. http://hdl.handle.net/2142/78642.

MLA Handbook (7^th Edition):

Kale, Vivek. “Low-overhead scheduling for improving performance of scientific applications.” 2015. Web. 14 Apr 2021.

Vancouver:

Kale V. Low-overhead scheduling for improving performance of scientific applications. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2021 Apr 14]. Available from: http://hdl.handle.net/2142/78642.

Council of Science Editors:

Kale V. Low-overhead scheduling for improving performance of scientific applications. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/78642

University of Illinois – Urbana-Champaign

24. Li, Shen. Dynamic resource provisioning for data center workloads with data constraints.

Degree: PhD, Computer Science, 2016, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/90503

► Dynamic resource provisioning, as an important data center software building block, helps to achieve high resource usage efficiency, leading to enormous monetary benefits. Most existing… (more)

Subjects/Keywords: Data Center; Dynamic Provisioning; Big Data; Scheduling; Distributed Systems

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Li, S. (2016). Dynamic resource provisioning for data center workloads with data constraints. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/90503

Chicago Manual of Style (16^th Edition):

Li, Shen. “Dynamic resource provisioning for data center workloads with data constraints.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 14, 2021. http://hdl.handle.net/2142/90503.

MLA Handbook (7^th Edition):

Li, Shen. “Dynamic resource provisioning for data center workloads with data constraints.” 2016. Web. 14 Apr 2021.

Vancouver:

Li S. Dynamic resource provisioning for data center workloads with data constraints. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2021 Apr 14]. Available from: http://hdl.handle.net/2142/90503.

Council of Science Editors:

Li S. Dynamic resource provisioning for data center workloads with data constraints. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/90503

University of New South Wales

25. Zheng, Wenguang. Integrating task scheduling and cache locking for real-time embedded systems.

Degree: Computer Science & Engineering, 2016, University of New South Wales

URL: http://handle.unsw.edu.au/1959.4/56117 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:40039/SOURCE02?view=true

► Caches are commonly used in embedded systems to bridge the increasing speed gap between processors and off-chip memory. In real-time embedded systems, the embedded software… (more)

Subjects/Keywords: Dynamic cache locking; Embedded system; QWorst case execution time; Task scheduling

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Zheng, W. (2016). Integrating task scheduling and cache locking for real-time embedded systems. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/56117 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:40039/SOURCE02?view=true

Chicago Manual of Style (16^th Edition):

Zheng, Wenguang. “Integrating task scheduling and cache locking for real-time embedded systems.” 2016. Doctoral Dissertation, University of New South Wales. Accessed April 14, 2021. http://handle.unsw.edu.au/1959.4/56117 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:40039/SOURCE02?view=true.

MLA Handbook (7^th Edition):

Zheng, Wenguang. “Integrating task scheduling and cache locking for real-time embedded systems.” 2016. Web. 14 Apr 2021.

Vancouver:

Zheng W. Integrating task scheduling and cache locking for real-time embedded systems. [Internet] [Doctoral dissertation]. University of New South Wales; 2016. [cited 2021 Apr 14]. Available from: http://handle.unsw.edu.au/1959.4/56117 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:40039/SOURCE02?view=true.

Council of Science Editors:

Zheng W. Integrating task scheduling and cache locking for real-time embedded systems. [Doctoral Dissertation]. University of New South Wales; 2016. Available from: http://handle.unsw.edu.au/1959.4/56117 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:40039/SOURCE02?view=true

Delft University of Technology

26. Meegdes, Jordan (author). Model-Driven Objective Functions in MPC using Economic Engineering Systems Theory: With an Application to Supply-Chain Scheduling at Shell.

Degree: 2021, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:2d5bd109-cbc4-4cd2-a83a-930813bd980d

►

This thesis introduces a theory for model-driven objective functions in Model Predictive Control (MPC) algorithms. For scheduling supply chains, such model-driven objective functions allow the… (more)

Subjects/Keywords: Model Predictive Control; Supply Chain; Scheduling; Economic Engineering; Dynamic modelling

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Meegdes, J. (. (2021). Model-Driven Objective Functions in MPC using Economic Engineering Systems Theory: With an Application to Supply-Chain Scheduling at Shell. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:2d5bd109-cbc4-4cd2-a83a-930813bd980d

Chicago Manual of Style (16^th Edition):

Meegdes, Jordan (author). “Model-Driven Objective Functions in MPC using Economic Engineering Systems Theory: With an Application to Supply-Chain Scheduling at Shell.” 2021. Masters Thesis, Delft University of Technology. Accessed April 14, 2021. http://resolver.tudelft.nl/uuid:2d5bd109-cbc4-4cd2-a83a-930813bd980d.

MLA Handbook (7^th Edition):

Meegdes, Jordan (author). “Model-Driven Objective Functions in MPC using Economic Engineering Systems Theory: With an Application to Supply-Chain Scheduling at Shell.” 2021. Web. 14 Apr 2021.

Vancouver:

Meegdes J(. Model-Driven Objective Functions in MPC using Economic Engineering Systems Theory: With an Application to Supply-Chain Scheduling at Shell. [Internet] [Masters thesis]. Delft University of Technology; 2021. [cited 2021 Apr 14]. Available from: http://resolver.tudelft.nl/uuid:2d5bd109-cbc4-4cd2-a83a-930813bd980d.

Council of Science Editors:

Meegdes J(. Model-Driven Objective Functions in MPC using Economic Engineering Systems Theory: With an Application to Supply-Chain Scheduling at Shell. [Masters Thesis]. Delft University of Technology; 2021. Available from: http://resolver.tudelft.nl/uuid:2d5bd109-cbc4-4cd2-a83a-930813bd980d

Indian Institute of Science

27. Vimala Rani, M. Impact of Real Time Events on the Relative Efficiency of the Proposed Dynamic Scheduling Algorithms for Diffusion Furnace(s) in the Semiconductor Manufacturing.

Degree: PhD, Faculty of Engineering, 2018, Indian Institute of Science

URL: http://etd.iisc.ac.in/handle/2005/3555

► The manufacturing industries play a significant role in contributing to the economy of a country. Among various manufacturing industries, the semiconductor manufacturing (SM) industries is… (more)

▼ The manufacturing industries play a significant role in contributing to the economy of a country. Among various manufacturing industries, the semiconductor manufacturing (SM) industries is one of the fastest growing industries in the world having worldwide sales of $31 billion in the month of December 2016. Semiconductors are required by large number of industries, including Telecommunications, Medical Electronics, Automobile, Defence and Aerospace, Consumer Electronics, etc.,. Today, without semiconductors, the technology that we count on every day would not be possible. Because of these, the demand for SM industry is increased rapidly. In addition, most of the semiconductor based products‘ life is very short. Due to these, SM industry is highly competitive industry. Thus, to utilize the resources effectively, to handle the huge demand, and to deliver the product on-time, efficient scheduling is important in SM industry. SM process can be broadly classified into Wafer Fabrication (called as wafer fab), Wafer Probing, Assembly, and Final Testing. Scheduling is more important in wafer fab due to complex operations involving with multiple types of machines and re-entrant, expensive machines, and time-consuming process involved. Thus, this study concerns about scheduling in wafer fab, particularly diffusion operation. The diffusion operation, carried out on batch processing machine, heavily impacts the production rate of wafer fab and in turn the SM industry. This is due to the fact that, diffusion operation requires relatively longest processing time among all the operations in the wafer fab. Due to these, diffusion operation is the bottleneck operations in the wafer fab. Based on the detailed literature review, this study addresses a new research problem on dynamic scheduling (DS) of diffusion furnace(s) by considering together the various real-life problem characteristics: Non-identical parallel diffusion furnaces, Machine eligibility restriction, Incompatible-job families, Job and/or resource related real time events, and Non-agreeable release time and due-date. In addition, due to the importance of on-time delivery this study deals with five due-date based scheduling objectives: Total weighted tardiness (TWT), Number of tardy jobs (NT), On time delivery (OTD) rate, Total earliness and lateness (TE/L) and Maximum lateness (Lmax) as a single objective as well as multi objectives. Here, the multi objectives are developed, considering all the five due-date based scheduling objectives in a linear form by randomly assigning equal and unequal weights to each of the due-date based single objectives considered in this study. With these, the main objective of this thesis is to study the impact of job and/or resource related real time events (JR-RTE) on the relative efficiency of the proposed dynamic scheduling algorithms for diffusion furnace(s) while optimizing each of the due-date based scheduling objectives considered in this study. The research problem considered in this study is decomposed into five phases. From the… Advisors/Committee Members: Mathirajan, M (advisor).

Subjects/Keywords: Semiconductor Manufacturing; Manufacturing Industry; Wafer Fabrication Stage; Diffusion Furnace; Dynamic Scheduling Algorithms; Dynamic Real Time Scheduling; Scheduling Diffusion Furnace; Real Time Events; Management

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Vimala Rani, M. (2018). Impact of Real Time Events on the Relative Efficiency of the Proposed Dynamic Scheduling Algorithms for Diffusion Furnace(s) in the Semiconductor Manufacturing. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3555

Chicago Manual of Style (16^th Edition):

Vimala Rani, M. “Impact of Real Time Events on the Relative Efficiency of the Proposed Dynamic Scheduling Algorithms for Diffusion Furnace(s) in the Semiconductor Manufacturing.” 2018. Doctoral Dissertation, Indian Institute of Science. Accessed April 14, 2021. http://etd.iisc.ac.in/handle/2005/3555.

MLA Handbook (7^th Edition):

Vimala Rani, M. “Impact of Real Time Events on the Relative Efficiency of the Proposed Dynamic Scheduling Algorithms for Diffusion Furnace(s) in the Semiconductor Manufacturing.” 2018. Web. 14 Apr 2021.

Vancouver:

Vimala Rani M. Impact of Real Time Events on the Relative Efficiency of the Proposed Dynamic Scheduling Algorithms for Diffusion Furnace(s) in the Semiconductor Manufacturing. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2018. [cited 2021 Apr 14]. Available from: http://etd.iisc.ac.in/handle/2005/3555.

Council of Science Editors:

Vimala Rani M. Impact of Real Time Events on the Relative Efficiency of the Proposed Dynamic Scheduling Algorithms for Diffusion Furnace(s) in the Semiconductor Manufacturing. [Doctoral Dissertation]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3555

28. Guerin, Thomas G. Adjustment of Parametric Dynamic Scheduling Heuristics for Heterogeneous Systems to Account for Heterogeneity.

Degree: MS, Computer Engineering, 2018, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/9864

► Modern computing applications are becoming increasingly data-hungry and computationally expensive. This trend continues even as hardware performance constraints loom with the impending death of… (more)

▼ Modern computing applications are becoming increasingly data-hungry and computationally expensive. This trend continues even as hardware performance constraints loom with the impending death of Moore's law. Hence, systems have become increasingly heterogeneous in the pursuits of improving performance and reducing power consumption. Such a heterogeneous system relies on a variety of different specialized processors with differing architectures, rather than processing units of a single type. Given their architectural differences, any given computation will not perform equally on all processors. As such, efficient scheduling of computations to processors is an essential design consideration. In this thesis work, a simulation of an existing dynamic scheduling heuristic - Alternative Processor within Threshold (APT) - was used to model the execution of a variety of heterogeneous workloads and heterogeneous systems. An extended version of this scheduler (APTX) was analyzed in a similar way, as was a simplified version of the existing K-Percent Best (KPB) scheduler. Each of these schedulers has a numeric "parameter" constraining its behavior. In existing analyses, these scheduling heuristics were tested only with a small set of arbitrary values for these parameters. The goal of this research was to use a stochastic method to optimize said parameters for the minimum finishing time of any given set of computations on any given heterogeneous system. An analytical expression to estimate the ideal parameter of each scheduler was developed. Each was based on the statistical analysis of the results of a set of randomly-generated simulations. After these expressions were developed, these optimized APT, APTX, and KPB schedulers were evaluated against three other dynamic schedulers - Minimum Execution Time (MET), Serial Scheduling (SS), and Shortest Process Next (SPN) - by running the randomly-generated simulations on all six. For the most common type of heterogeneous system, APT and APTX were found to have the earliest finish time on average, while MET and KPB generally performed poorly. Ultimately, this research not only demonstrated the advantages of APT and APTX over other dynamic schedulers in a fair comparison, but it also demonstrated a method by which any parametric scheduler can be tuned. Advisors/Committee Members: Sonia Lopez Alarcon.

Subjects/Keywords: Distributed computing; Dynamic scheduling; Heterogeneous; Processor scheduling

…dynamic scheduling heuristics, including a dynamic variant of MET and K-Percent Best (KPB… …different dynamic scheduling policies are described, modeled, and analyzed. The first — Minimum… …Two additional dynamic policies — Serial Scheduling and Shortest Process Next — are also… …only demonstrated the advantages of APT and APTX over other dynamic schedulers in a fair… …Execution Time (MET) . . . . . . . . . . . . . . 2.2.2 Serial Scheduling (SS)…

10 more images…

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Guerin, T. G. (2018). Adjustment of Parametric Dynamic Scheduling Heuristics for Heterogeneous Systems to Account for Heterogeneity. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/9864

Chicago Manual of Style (16^th Edition):

Guerin, Thomas G. “Adjustment of Parametric Dynamic Scheduling Heuristics for Heterogeneous Systems to Account for Heterogeneity.” 2018. Masters Thesis, Rochester Institute of Technology. Accessed April 14, 2021. https://scholarworks.rit.edu/theses/9864.

MLA Handbook (7^th Edition):

Guerin, Thomas G. “Adjustment of Parametric Dynamic Scheduling Heuristics for Heterogeneous Systems to Account for Heterogeneity.” 2018. Web. 14 Apr 2021.

Vancouver:

Guerin TG. Adjustment of Parametric Dynamic Scheduling Heuristics for Heterogeneous Systems to Account for Heterogeneity. [Internet] [Masters thesis]. Rochester Institute of Technology; 2018. [cited 2021 Apr 14]. Available from: https://scholarworks.rit.edu/theses/9864.

Council of Science Editors:

Guerin TG. Adjustment of Parametric Dynamic Scheduling Heuristics for Heterogeneous Systems to Account for Heterogeneity. [Masters Thesis]. Rochester Institute of Technology; 2018. Available from: https://scholarworks.rit.edu/theses/9864

Texas A&M University

29. Ravidas, Amrish Deep. An Exact Algorithm and a Local Search Heuristic for a Two Runway Scheduling Problem.

Degree: MS, Mechanical Engineering, 2011, Texas A&M University

URL: http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8787

► A generalized dynamic programming based algorithm and a local search heuristic are used to solve the Two Runway Departure Scheduling Problem that arises at an… (more)

▼ A generalized dynamic programming based algorithm and a local search heuristic are used to solve the Two Runway Departure Scheduling Problem that arises at an airport. The objective of this work is to assign the departing aircraft to one of the runways and find a departing time for each aircraft so that the overall delay is minimized subject to the timing, safety, and the ordering constraints. A reduction in the overall delay of the departing aircraft at an airport can improve the airport surface operations and aircraft scheduling. The generalized dynamic programming algorithm is an exact algorithm, and it finds the optimal solution for the two runway scheduling problem. The performance of the generalized dynamic programming algorithm is assessed by comparing its running time with a published dynamic programming algorithm for the two runway scheduling problem. The results from the generalized dynamic programming algorithm show that this algorithm runs much faster than the dynamic programming algorithm. The local search heuristic with k − exchange neighborhoods has a short running time in the order of seconds, and it finds an approximate solution. The performance of this heuristic is assessed based on the quality of the solution found by the heuristic and its running time. The results show that the solution found by the heuristic for a 25 aircraft problem has an average savings of approximately 15 percent in delays with respect to a first come-first served solution. Also, the solutions produced by a 3-opt heuristic for a 25 aircraft scheduling problem has an average quality of 8 percent with respect to the optimal solution found by the generalized dynamic programming algorithm. The heuristic can be used for both real-time and fast-time simulations of airport surface operations, and it can also provide an upper limit for an exact algorithm. Aircraft arrival scheduling problems may also be addressed using the generalized dynamic programming algorithm and the local search heuristic with slight modification to the constraints. Advisors/Committee Members: Rathinam, Sivakumar (advisor), Darbha, Swaroop (advisor), Quadrifoglio, Luca (committee member).

Subjects/Keywords: Generalized Dynamic programming; departure scheduling problem; DSP; aircraft departure; flight departure; arrival; kopt heuristic; real-time simulation; aircraft scheduling problem

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Ravidas, A. D. (2011). An Exact Algorithm and a Local Search Heuristic for a Two Runway Scheduling Problem. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8787

Chicago Manual of Style (16^th Edition):

Ravidas, Amrish Deep. “An Exact Algorithm and a Local Search Heuristic for a Two Runway Scheduling Problem.” 2011. Masters Thesis, Texas A&M University. Accessed April 14, 2021. http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8787.

MLA Handbook (7^th Edition):

Ravidas, Amrish Deep. “An Exact Algorithm and a Local Search Heuristic for a Two Runway Scheduling Problem.” 2011. Web. 14 Apr 2021.

Vancouver:

Ravidas AD. An Exact Algorithm and a Local Search Heuristic for a Two Runway Scheduling Problem. [Internet] [Masters thesis]. Texas A&M University; 2011. [cited 2021 Apr 14]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8787.

Council of Science Editors:

Ravidas AD. An Exact Algorithm and a Local Search Heuristic for a Two Runway Scheduling Problem. [Masters Thesis]. Texas A&M University; 2011. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8787

Brno University of Technology

30. Křen, Michal. Real-Time optimalizace operací v průmyslové výrobě: Real-Time Optimizations in Industrial Production.

Degree: 2019, Brno University of Technology

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

► The thesis deals with the scheduling problem of manufacturing operations in industrial production. This problem is described as the well-known the Resource-Constrained Project Scheduling Problem.… (more)

Subjects/Keywords: plánování; rozvrhování; optimalizace; simulace; RCPSP; genetické algoritmy; dynamické rozvrhování; planning; scheduling; optimization; simulation; RCPSP; genetic algorithms; dynamic scheduling

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Křen, M. (2019). Real-Time optimalizace operací v průmyslové výrobě: Real-Time Optimizations in Industrial Production. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53749

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):

Křen, Michal. “Real-Time optimalizace operací v průmyslové výrobě: Real-Time Optimizations in Industrial Production.” 2019. Thesis, Brno University of Technology. Accessed April 14, 2021. http://hdl.handle.net/11012/53749.

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

MLA Handbook (7^th Edition):

Křen, Michal. “Real-Time optimalizace operací v průmyslové výrobě: Real-Time Optimizations in Industrial Production.” 2019. Web. 14 Apr 2021.

Vancouver:

Křen M. Real-Time optimalizace operací v průmyslové výrobě: Real-Time Optimizations in Industrial Production. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Apr 14]. Available from: http://hdl.handle.net/11012/53749.

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

Council of Science Editors:

Křen M. Real-Time optimalizace operací v průmyslové výrobě: Real-Time Optimizations in Industrial Production. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/53749

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

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

Open Access Theses and Dissertations