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 154 for “"flow time"”.

  1. Overland flow time of concentration on flat terrains

    Time of concentration parameter is defined very loosely in literature and it is calculated rather subjectively in practice (Akan 1986). The situation becomes adverse as the terrain slope approaches zero; because the slope generally appears in the denominator of any formula for time of …

    tamu Repository record for Overland flow time of concentration on flat terrains (opens in a new tab)

  2. Online scheduling algorithms for average flow time and its variants

    … send their requests to the server(s) over time, and the server needs to satisfy the requests using its resources. This setting is prevalent in many applications including multiuser operating systems, web servers, database servers, and so on. A natural objective for each client is to …

    uiuc Repository record for Online scheduling algorithms for average flow time and its variants (opens in a new tab)

  3. Dynamic scheduling strategies for FMS hub networks with flow time consideration.

    … is to improve various aspects of the production flow and manufacturing productivity. Compared to fixed queue scheduling rules, dynamic changes in queue scheduling rules for hubs at certain intervention times, are shown in some cases to reduce total job flow time (maximum completion time of all …

    ottawa-retro Repository record for Dynamic scheduling strategies for FMS hub networks with flow time consideration. (opens in a new tab)

  4. Optimizing Perioperative Fluid Management: Anesthesia Provider Confidence in Carotid Flow Time Measurement

    … of and confidence in performing carotid flow time (CFT) and corrected carotid flow time (ccFT) measurement through a structured educational intervention. Background: Perioperative fluid management practices often rely on subjective or static measures, contributing to inappropriate fluid …

    arizona-thes Repository record for Optimizing Perioperative Fluid Management: Anesthesia Provider Confidence in Carotid Flow Time Measurement (opens in a new tab)

  5. Flow Shop Sequencing With Unequal Ready Times to Minimize Mean Flow Time

    Made available in DSpace on 2014-12-13T19:55:31Z (GMT). No. of bitstreams: 1 7915337.pdf: 4561714 bytes, checksum: 1d16fc34b5f5bc98b133364e7128a789 (MD5) Previous issue date: 1979

    uiuc Repository record for Flow Shop Sequencing With Unequal Ready Times to Minimize Mean Flow Time (opens in a new tab)

  6. Process Improvement in Phlebotomy

    … at the lab. The performance measurement is the flow time of the process, which reflects concerns and interests of both the hospital and the patients. Three popular operational methodologies are applied to reduce the flow time and improve the process: DMAIC from Six Sigma, lean principles and …

    brock Repository record for Process Improvement in Phlebotomy (opens in a new tab)

  7. Design of Scheduling Algorithms Using Game Theoretic Ideas

    … thesis, we design algorithms that optimize {\em flow-time} (or delay) of jobs for scheduling problems that arise in a wide range of applications. We consider the classical model of unrelated machine scheduling and resolve several long standing open problems; we introduce new models that capture …

    duke Repository record for Design of Scheduling Algorithms Using Game Theoretic Ideas (opens in a new tab)

  8. Final assembly sequencing of mixed-model assembly lines in a just-in-time rolling horizon environment

    … all over the world are adopting the Just-in-time (JIT) philosophy of manufacturing in order to minimize the costs and resources. In addition, industries are looking at a mix of products for production in order to maximize their revenues by the means of diversification. Along with these …

    iastate Repository record for Final assembly sequencing of mixed-model assembly lines in a just-in-time rolling horizon environment (opens in a new tab)

  9. Online Delivery and Dispatch with Capacity Constraints

    … capacity constraints, where requests arrive over time in a metric space and a single server must deliver them while minimizing the maximum flow time. Flow time, defined as the delay between a request’s release and completion, is a fundamental but relatively underexplored objective in online …

    buffalo Repository record for Online Delivery and Dispatch with Capacity Constraints (opens in a new tab)

  10. A study of three classes of sequencing rules in a simulated job shop

    … Come First Serve (FCFS), Shortest Processing Time (SPT), and Probability Sequencing (PS). Due date performance, number of jobs processed in a simulated interval, number of jobs late, mean lateness and in-process inventory level were the measures of performance used. The results indicated that …

    vt Repository record for A study of three classes of sequencing rules in a simulated job shop (opens in a new tab)

  11. Online scheduling algorithms for broadcasting and general cost functions

    … are a set of jobs that are sent by clients over time to a sever. There is a scheduler at the sever that determines how the jobs should be processed. The goal of the scheduler is to process the jobs in a way that optimizes the quality of service given to the clients. The quality of service is …

    uiuc Repository record for Online scheduling algorithms for broadcasting and general cost functions (opens in a new tab)

  12. Scheduling optimization of cellular flowshop with sequence dependent setup times

    … systems, minimization of the completion time has a great impact on the production time, material flow, and productivity. An effective scheduling is crucial to attaining the advantages of cellular manufacturing systems. This dissertation attempts to solve the Flowshop Manufacturing Cell …

    manitoba Repository record for Scheduling optimization of cellular flowshop with sequence dependent setup times (opens in a new tab)

  13. On merging sequencing and scheduling theory with genetic algorithms to solve stochastic job shops.

    … true mean for both the makespan and the average flow time by 3% and 1.7% respectively. Also, all averages estimated for both the makespan and the average flow time fall within the 90% confidence interval. Furthermore, using probability Gantt charting reduced the CPU time needed by 554.9% when …

    oklahoma-thes Repository record for On merging sequencing and scheduling theory with genetic algorithms to solve stochastic job shops. (opens in a new tab)

  14. Scheduling inbound calls in call centers

    … objective functions of 1) minimizing the Total Flow Time (TFT), 2) minimizing the Maximum Flow Time (MFT) of any call, and 3) minimizing the Maximum Deviation of Cumulative Assigned Workload (MDCAW) for CSRs. We also report the results of a numerical experiment designed to evaluate under what …

    iastate Repository record for Scheduling inbound calls in call centers (opens in a new tab)

  15. Renormalization with the gradient flow

    … In this thesis, we propose to use the gradient flow to temper these divergences. The gradient flow is essentially a gauge-covariantsmearing of the quantum fields. It introduces a fifth dimension, the flow time, that controls the extent of the smearing. Critically, the flow time also provides an …

    msu Repository record for Renormalization with the gradient flow (opens in a new tab)

  16. Job Sequencing & WIP level determination in a cyclic CONWIP Flowshop with Blocking

    … earlier studies namely; stochastic processing times and limited intermediate storage. One of the main issues in the design of a CONWIP system is the WIP level 'M', to be maintained. This research proposes an iterative procedure to determine this optimal level. The second main issue is the …

    vt Repository record for Job Sequencing & WIP level determination in a cyclic CONWIP Flowshop with Blocking (opens in a new tab)

  17. Scheduling Multiple Parallel Jobs Online

    … DAG jobs to optimize objectives such as average flow time, maximum flow time, and throughput. The overarching goal of the research is to deeply examine the problem of scheduling multiple parallel jobs and to take the first steps towards creating a body of knowledge comparable to the extensive …

    wustl Repository record for Scheduling Multiple Parallel Jobs Online (opens in a new tab)

Page 1 of 8