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

  1. Analysis of variance impact on manufacturing flow time

    Thesis (M.S.)--Massachusetts Institute of Technology, Sloan School of Management, 1991, and Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1991.

    mit Repository record for Analysis of variance impact on manufacturing flow time (opens in a new tab)

  2. Implementing flow time reduction using process mapping and innovation

    Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 1994, and Thesis (M.S.)--Massachusetts Institute of Technology, Sloan School of Management, 1994.

    mit Repository record for Implementing flow time reduction using process mapping and innovation (opens in a new tab)

  3. 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)

  4. Supply chain strategy for a compressed flow-time retrofitting manufacturing process

    In today's competitive environment, a compressed flow-time enables companies to present a strong value proposition especially for products with a high asset value. In a retrofitting manufacturing process the state of incoming product and customer requirements is unpredictable. This results in long …

    mit Repository record for Supply chain strategy for a compressed flow-time retrofitting manufacturing process (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. Development of passenger flow time (PFT) model for light rail transit (LRT) users at KL Sentral Malaysia

    Dwell time is a key parameter of system performance, service reliability and quality in any mode of public transportation and represents a significant portion of the total trip time along a serviced transit line. One major component of dwell times is the alighting and boarding time of passengers, …

    uthm Repository record for Development of passenger flow time (PFT) model for light rail transit (LRT) users at KL Sentral Malaysia (opens in a new tab)

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

  8. 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)

  9. 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)

  10. 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)

  11. 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)

  12. 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)

  13. Optimization of shake inspections

    … opportunities to improve quality and reduce flow time are being thoroughly investigated. This thesis contributes to the investigation by focusing on improving the inspection process through a prototype computer data collection tool and the formation of a corrective action team.

    mit Repository record for Optimization of shake inspections (opens in a new tab)

  14. A comparative evaluation of surface runoff models and methods on small developing watersheds in Northern Virginia

    … Hydrographs are evaluated with respect to peak flow, time to peak flow, time base, volume, and overall shape. Statistical measures are introduced to quantitatively test the modeled hydrograph to a baseline reference hydrograph. The statistics yield many errors with the models being evaluated. A …

    vt Repository record for A comparative evaluation of surface runoff models and methods on small developing watersheds in Northern Virginia (opens in a new tab)

  15. Improving the efficiency of an automated manufacturing system through a tri-part approach

    … this study is highlighted by non-trivial travel time between stations. We build a simulation model in Matlab to compare different assignment policies. The objective is to find the assignment policy that balances the station load, decreases the flow time for jobs, and reduces the rejection or …

    mit Repository record for Improving the efficiency of an automated manufacturing system through a tri-part approach (opens in a new tab)

  16. Scheduling and Admission Control

    … 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 that the multiprocessor problem becomes NP-hard when jobs …

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

  17. Sequencing policy for a CONWIP production system

    … are throughput, optimum WIP level (m*), and flow time. Analysis of the effects of sequence dependent bottlenecks on system performance is provided. A procedure is presented to determine a lower bound for (m*) given the product mix. A method that determines (m*) given the sequence of jobs is …

    vt Repository record for Sequencing policy for a CONWIP production system (opens in a new tab)

  18. Time-domain developments in the singularity expansion method

    … of the best properties produced by SOT (low flow time) and SLACK (low tardiness). It should be noted that even though such a system could be viewed as complex and expensive,it is not. Computational requirement will be slightly increased, but no more data is required than is expected for a …

    vt Repository record for Time-domain developments in the singularity expansion method (opens in a new tab)

  19. Application of two complementary sequencing rules to control the job shop by switching

    … of the best properties produced by SOT (low flow time) and SLACK (low tardiness). It should be noted that even though such a system could be viewed as complex and expensive,it is not. Computational requirement will be slightly increased, but no more data is required than is expected for a …

    vt Repository record for Application of two complementary sequencing rules to control the job shop by switching (opens in a new tab)

  20. Bi-criteria Scheduling Problems on Parallel Machines

    … more efficiently and in reasonable amount of time and with little compromise on the optimality of the solutions obtained. Two classes of problems are considered. The first class consists of scheduling unit duration tasks on parallel machines. Various combinations of primary and secondary …

    vt Repository record for Bi-criteria Scheduling Problems on Parallel Machines (opens in a new tab)

Page 1 of 3