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 8 of 8 for “"Processing time variability"”.

  1. Modeling Demand Uncertainty and Processing Time Variability for Multi-Product Chemical Batch Process

    … not consider the uncertainties in demand and variability in processing times. We develop a simulation based variable production schedule model for a multi-product batch facility assuming zero wait transfer policy and single product campaign. The model incorporates the demand uncertainties and …

    usf Repository record for Modeling Demand Uncertainty and Processing Time Variability for Multi-Product Chemical Batch Process (opens in a new tab)

  2. Analytic Evaluation of the Expectation and Variance of Different Performance Measures of a Schedule under Processing Time Variability

    … replete with instances of uncertainties in job processing times, machine statuses (up or down), demand fluctuations, due dates of jobs and job priorities. These uncertainties stem from the inability to gather accurate information about the various parameters (e.g., processing times, product …

    vt Repository record for Analytic Evaluation of the Expectation and Variance of Different Performance Measures of a Schedule under Processing Time Variability (opens in a new tab)

  3. Simulation study of a kanban-controlled production system

    Just-In-Time (JIT) has become one of the most popular production control philosophies in the last three decades. JIT did not find acceptance in the American companies until after the oil crisis. To be more flexible and to adapt quickly to changes in the market, many American companies took to the …

    wvu Repository record for Simulation study of a kanban-controlled production system (opens in a new tab)

  4. An investigation of the dispatching and expediting rules in buffer management : a thesis presented in partial fulfilment of the requirements for the degree of Master of Technology in Production Technology at Massey University

    … are First-Come-First-Served (FCFS), Shortest Processing Time (SPT) and Minimum Slack Time (MINSLK). Both static and dynamic expediting rules are compared. Reduction in the coefficient of variance for processing times from 100% to 50% corresponds to the process of quality improvement. Mean …

    massey Repository record for An investigation of the dispatching and expediting rules in buffer management : a thesis presented in partial fulfilment of the requirements for the degree of Master of Technology in Production Technology at Massey University (opens in a new tab)

  5. Effect of different maintenance policies on the just-in-time production system

    … the success of the Japanese firms using Just-In-Time Production Systems, the American practitioners and researchers are seeking to find ways to implement the J.I.T. concept in and to adapt it to the American production environment. Works on this subject include detailed descriptions of Pull …

    ttu Repository record for Effect of different maintenance policies on the just-in-time production system (opens in a new tab)

  6. Performance analysis and development of pull-type production control strategies for evolutionary optimisation of closed-loop supply chains

    … All were tested in scenarios with high and low processing time variability and with 90% returned products and 40% returns from an open market system, therefore totaling 16 simulation models. Multi-objective evolutionary algorithms were utilised to generate the Pareto-optimum performance frontier …

    dcu Download PDF for Performance analysis and development of pull-type production control strategies for evolutionary optimisation of closed-loop supply chains (opens in a new tab)

  7. Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem

    … that we address is the SGAP for which the processing time of a job on a machine is assumed to be stochastic. Even though the generalized assignment problem (GAP) has been solved using the BNP method, yet no study has been reported in the literature on the use of the BNP method for the …

    vt Repository record for Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem (opens in a new tab)