Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 2547 for “"scheduling"”.

  1. Program scheduling : decreasing flow by back-scheduling

    … schedule flow through improvements in the scheduling process. Currently the field constraints do not heavily influence what order the planes roll out of the factory. This causes the field to deal with constraint variation by addressing the airplane schedule flow in order to make delivery. …

    mit Repository record for Program scheduling : decreasing flow by back-scheduling (opens in a new tab)

  2. Verified Scheduling Via High-Level Scheduling Rewrites

    … array language. Optimizations rely on user scheduling using series of verified, semantics-preserving rewrites. Unusually for compilation targeting imperative code with arrays and nested loops, all rewrites are source-to-source within a purely functional language. This language comprises a …

    mit Repository record for Verified Scheduling Via High-Level Scheduling Rewrites (opens in a new tab)

  3. Autonomous grid scheduling using probabilistic job runtime scheduling

    … The thesis focuses on developing a new scheduling model for general-purpose, utility clusters based on the concept of user requested job completion deadlines. In such a system, a user would be able to request each job to finish by a certain deadline, and possibly to a certain monetary …

    ucl Repository record for Autonomous grid scheduling using probabilistic job runtime scheduling (opens in a new tab)

  4. Innovative scheduling

    … academic achievement. The use of a block scheduling formula for the high school meant providing students and teachers with an opportunity to innovatively and creatively interact in the learning process, while using time-on-task in an efficient manner. Utilizing an innovative schedule …

    rowan Repository record for Innovative scheduling (opens in a new tab)

  5. Smart scheduling : optimizing Tilera's process scheduling via reinforcement learning

    As multicore processors become more prevalent, system complexities are increasing. It is no longer practical for an average programmer to balance all of the system constraints to ensure that the system will always perform optimally. One apparent solution to managing these resources efficiently is …

    mit Repository record for Smart scheduling : optimizing Tilera's process scheduling via reinforcement learning (opens in a new tab)

  6. Effects of scheduling order in a collaborative medication scheduling task

    … problem solving strategies to solve medication scheduling tasks. The first experiment explored users’ interface interactions with e-MedTable by mouse click data. Four medications were presented on the tool from the top to bottom. The results revealed that two thirds of pairs followed the order …

    uiuc Repository record for Effects of scheduling order in a collaborative medication scheduling task (opens in a new tab)

  7. Scheduling techniques for packet routing, load, balancing and disk scheduling

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1997.

    mit Repository record for Scheduling techniques for packet routing, load, balancing and disk scheduling (opens in a new tab)

  8. Ambulatory Clinic Scheduling

    … we seek to fully explore the ambulatory clinic scheduling problem (CSP) and study the creation of ambulatory clinic schedules using mathematical models. We describe our experiences developing ambulatory clinic schedules for three healthcare facilities including the challenges we faced, lessons …

    toronto-retro Repository record for Ambulatory Clinic Scheduling (opens in a new tab)

  9. Learning-based Scheduling

    … for representing a wide range of real-world scheduling problems. Despite their ability to model general scheduling problems, solving large-scale integer programs (IP) remains a computational challenge in practice. The incorporation of more complex objectives such as robustness to disruptions …

    mit Repository record for Learning-based Scheduling (opens in a new tab)

  10. Resident Scheduling Problem

    This thesis is concerned with the Resident Scheduling Problem (RSP) in which a good schedule is desired that will meet both departmental requirements and residents' preferences. Three scenarios that represent most situations and account for various departmental requirements and needs are described. …

    vt Repository record for Resident Scheduling Problem (opens in a new tab)

  11. A Robust Reactive Scheduling System with Application to Parallel Machine Scheduling

    <p>In this turbulent world, scheduling role has become crucial in most manufacturing production, and service systems. It allows the allocation of limited resources to activities with the objective of optimizing one performance measure or more. Resources may be machines in a factory, operating rooms …

    odu Repository record for A Robust Reactive Scheduling System with Application to Parallel Machine Scheduling (opens in a new tab)

  12. An agent based manufacturing scheduling module for Advanced Planning and Scheduling

    A software agents based manufacturing scheduling module for Advanced Planning and Scheduling (APS) is presented. The problem considered is scheduling of jobs with multiple operations, distinct operation processing times, arrival times, and due dates in a job shop environment. Sequence dependent …

    vt Repository record for An agent based manufacturing scheduling module for Advanced Planning and Scheduling (opens in a new tab)

  13. Convergent scheduling : a flexible and extensible scheduling framework for clustered VLIW architectures

    Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2003.

    mit Repository record for Convergent scheduling : a flexible and extensible scheduling framework for clustered VLIW architectures (opens in a new tab)

  14. Online t-interval scheduling

    … deals with non-preemptive online t-interval scheduling. A tinterval is a union of t half-open intervals (segments). In online scheduling the t-intervals are presented incrementally and each presented interval must be accepted or lost forever. A presented t-interval which overlaps a previously …

    reykjavik Repository record for Online t-interval scheduling (opens in a new tab)

  15. Dynamic scheduling with preferences

    … to achieve a particular goal or a set of goals. Scheduling is figuring out when to execute the actions and using what resources. However, the interplay between planning and scheduling varies significantly between static and dynamic environments. Dynamic changes demand real-time adaptability, …

    udel Repository record for Dynamic scheduling with preferences (opens in a new tab)

  16. Managing Self-Scheduling Capacity

    Gig-economy platform like Uber, Lyft, Postmates, and Instacart have created markets in which independent service providers provide on-demand service to consumers. A hallmark of this arrangement is that providers decide for themselves when, where, and how much to work. In other words, the platform …

    penn Repository record for Managing Self-Scheduling Capacity (opens in a new tab)

  17. Task Scheduling and Productivity

    The current research aims to describe general scheduling tendencies, evaluate the impact considering task end-times have on scheduling tendencies, and to assess links between scheduling tendencies and productivity. Throughout four studies, findings indicated that participants consistently preferred …

    carleton Repository record for Task Scheduling and Productivity (opens in a new tab)

  18. Facility/infrastructure Resource Scheduling

    … devices, would allow near-optimal, dynamic crew scheduling. In addition to construction scheduling, the FIRS approach can directly assist disaster recovery and reconstruction planners and those in other time-sensitive dispatching domains.

    uiuc Repository record for Facility/infrastructure Resource Scheduling (opens in a new tab)

  19. Scheduling and Admission Control

    Our third problem is power-aware scheduling, where the processor can run at different speeds, with its energy consumption depending on the speeds selected. If schedule quality is measured with makespan, we give linear-time algorithms to compute all non-dominated solutions for the general …

    uiuc Repository record for Scheduling and Admission Control (opens in a new tab)

Page 1 of 128