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 91 for “"Optimal schedule"”.

  1. Achieving Optimal Schedule by Network Flow Techniques

    … This dissertation studies how to achieve optimal performance for two fundamental scheduling problems using network flow techniques. The first problem is Maximum lifetime scheduling for roadside networks. In this problem, sensors are deployed along a road to monitor traffic activities. A …

    umkc Repository record for Achieving Optimal Schedule by Network Flow Techniques (opens in a new tab)

  2. Scheduling techniques for flexible semiconductor manufacturing tools

    … searches the time and resource domains for an optimal solution. Then, we allow Residency Constraints on both the processing modules and the robot. For this model, we introduce another technique that uses a special kind of Linear Programming and a branch-and-bound method to search for the …

    ubc Repository record for Scheduling techniques for flexible semiconductor manufacturing tools (opens in a new tab) Download PDF for Scheduling techniques for flexible semiconductor manufacturing tools (opens in a new tab)

  3. ΑΥΤΟΜΑΤΗ ΠΑΡΑΛΛΗΛΟΠΟΙΗΣΗ ΣΕΙΡΙΑΚΩΝ ΑΛΓΟΡΙΘΜΩΝ

    THIS DISSERTATION STUDIES THE PROBLEM OF OPTIMAL PARALLELIZATION OF NESTED FOR(DO) LOOPS WITH UNIFORM DEPENDENCIES. AN OPTIMAL PARALLELIZATION IS A SCHEDULE THAT ACHIEVES THE MINIMUM PARALLEL EXECUTION TIME WHILE USING THE MINIMUM NUMBER OF PROCESSORS. UPPER AND LOWER BOUNDS ON THE NUMBER OF …

    greece Repository record for ΑΥΤΟΜΑΤΗ ΠΑΡΑΛΛΗΛΟΠΟΙΗΣΗ ΣΕΙΡΙΑΚΩΝ ΑΛΓΟΡΙΘΜΩΝ (opens in a new tab)

  4. Design and implementation of a synchronization scheduler in a distributed multimedia presentation system

    … we design and implement a synchronization scheduler in a distributed multimedia presentation system. First, we develop an interval constraint graph model to describe the temporal relationships among media objects. Second, based on the model, we give a way to produce an optimal schedule from …

    concordia Download PDF for Design and implementation of a synchronization scheduler in a distributed multimedia presentation system (opens in a new tab)

  5. Multiprocessor Scheduling with Availability Constraints

    … algorithm, FFDL Multifit, which has an optimal worst- case performance in the class of polynomial algorithms for same-speed processors with at most two downtimes on each machine, and for uniform processors with at most one downtime on each machine, assuming that P 6= NP. Our algorithm …

    tamu Repository record for Multiprocessor Scheduling with Availability Constraints (opens in a new tab)

  6. Optimizing the scheduling of recruitment and initial training for soldiers in the Australian Army

    … a more efficient planning tool for the annual optimal recruitment dates to achieve the stated goal for all employment categories within the Australian Army. Two scheduling optimization models are developed in this thesis using linear programming. The first model schedules 30 courses to occur …

    nps Repository record for Optimizing the scheduling of recruitment and initial training for soldiers in the Australian Army (opens in a new tab)

  7. H2GS : a hybrid heuristic-genetic scheduling algorithm for static scheduling of tasks on heterogeneous processor networks

    … scheduling algorithms [1, 12] generate sub-optimal schedules. Hence, there is much room for the development of better scheduling algorithms for heterogeneous processor networks. This report presents and tests a novel hybrid scheduling algorithm (H2GS) that utilizes both deterministic and …

    concordia Download PDF for H2GS : a hybrid heuristic-genetic scheduling algorithm for static scheduling of tasks on heterogeneous processor networks (opens in a new tab)

  8. Fuzzy clustering with an application to scheduling

    Usually, the generation of an optimal schedule is a costly and time-consuming process. This process requires expensive computational software and hardware. Scheduling problem modeling using human expert knowledge is promising and flexible in dealing with real world applications. Unfortunately, …

    concordia Download PDF for Fuzzy clustering with an application to scheduling (opens in a new tab)

  9. On-board near-optimal climb-dash energy management

    … same ideas, i.e. that the energy determines the optimal altitude and pathangle, and trajectories which do not initially lie on the optimal schedule rapidly fair into it. (The optimal schedule is an Euler solution to the twopoint- -boundary-value-problem, found by a multiple shooting technique) . …

    vt Repository record for On-board near-optimal climb-dash energy management (opens in a new tab)

  10. Optimal Task Scheduling on Parallel Systems

    … of a program are to be carefully assigned and scheduled on the processors of the system such that the overall execution time is minimal. Due to the reached physical limits of processor technology the improvements are fading out and manufacturers have moved to multi(core)processors. With …

    auckland-ms Repository record for Optimal Task Scheduling on Parallel Systems (opens in a new tab)

  11. Bounding the Convex Hull Relaxation of the Unit Commitment Problem with the Shapley-Folkman Theorem

    The Unit Commitment (UC) problem finds an optimal schedule for a set of generators by minimizing the total operation cost subject to demand and operational constraints. The UC problem is often modeled with a mixed-integer linear program (MILP). We employ the Shapley-Folkman Theorem to provide a …

    clemson Repository record for Bounding the Convex Hull Relaxation of the Unit Commitment Problem with the Shapley-Folkman Theorem (opens in a new tab)

  12. Scheduling and Admission Control

    … 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 uniprocessor problem and for the multiprocessor problem when every job requires the same amount of work. We also show …

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

  13. Techniques for Proving Approximation Ratios in Scheduling

    The problem of finding a schedule with the lowest makespan in the class of all flowtime-optimal schedules for parallel identical machines is an NP-hard problem. Several approximation algorithms have been suggested for this problem. We focus on algorithms that are fast and easy to implement, rather …

    waterloo Repository record for Techniques for Proving Approximation Ratios in Scheduling (opens in a new tab)

  14. Deterministic modelling of kinetics and radiobiology of radiation-cisplatin interaction in the treatment of head and neck cancers.

    … or no enhancement of normal tissue toxicity. The optimal schedule for the combined treatment of cisplatin-radiation is still under investigation. Neither the optimal time interval, nor the most adequate sequence of administration of cisplatin and radiation are known. The results of the trials are …

    adelaide Repository record for Deterministic modelling of kinetics and radiobiology of radiation-cisplatin interaction in the treatment of head and neck cancers. (opens in a new tab)

  15. Base realignment and closure action scheduler (BRACAS)

    … optimization model, BRACAS, to help construct optimal implementation schedules for base realignment and closure actions. Given a list of installations for realignment and closure, BRACAS maximizes the net present value of future savings less the one-time costs while satisfying yearly budget …

    nps Repository record for Base realignment and closure action scheduler (BRACAS) (opens in a new tab)

  16. Zone-based Manufacturing

    … process. This paper provides the best possible schedule by using a heuristic model that gives an optimal schedule. Based on jobs precedence the schedule is made to have the least possible makespan for the process at any given station in an assembly line. Furthermore, the objective is to minimize …

    ut-knoxville Repository record for Zone-based Manufacturing (opens in a new tab)

  17. Selecting and scheduling of improvements in urban transportation networks using metaheuristics

    … pseudo-links. The methods used for choosing the optimal schedule of project improvements are: Ant Colony Optimization, Simulated Annealing and Tabu Search. The heuristic that yields the best most quickly solution is Ant Colony Optimization and it is chosen for the sensitivity analysis. The …

    maryland Repository record for Selecting and scheduling of improvements in urban transportation networks using metaheuristics (opens in a new tab)

  18. MPAMOD: an optimization model for maritime patrol aviation modernization planning.

    … yearly level of detail, the model determines an optimal schedule for procuring new aircraft, refurbishing the airframes of existing aircraft through the Sustained Readiness Program and the Service Life Extension Program, upgrading avionics, and retiring old aircraft. Constraints enforce minimum …

    nps Repository record for MPAMOD: an optimization model for maritime patrol aviation modernization planning. (opens in a new tab)

  19. Parallel machines scheduling with applications to Internet ad-slot placement

    … machines with an objective of achieving an optimal schedule. The primary focus is on the minimization of the maximum completion time of the jobs, commonly referred to as Makespan (C max ). We survey and present examples of uniform machines and its applications to the single slot and multiple …

    unlv Repository record for Parallel machines scheduling with applications to Internet ad-slot placement (opens in a new tab) Download PDF for Parallel machines scheduling with applications to Internet ad-slot placement (opens in a new tab)

  20. The Persistent Robot Charging Problem for Long-Duration Autonomy

    … a novel formulation aimed at determining the optimal schedule for recharging a fleet of n heterogeneous robots, with the primary objective of minimizing resource utilization. This study provides a foundational framework applicable to Multi-Robot Mission Planning, particularly in scenarios …

    tamu Repository record for The Persistent Robot Charging Problem for Long-Duration Autonomy (opens in a new tab)

Page 1 of 5