TURN ON TIME DELAY

Turn time Delay in Production Schedule

ABSTRACT

In this paper, we study the production process on multi-stage assembly lines. These production systems comprise simple processing as well as assembly stations. At the latter, work pieces from two or more input stations have to be merged to form a new one for further processing. As the flow of material is asynchronous with stochastic processing times at each station, queueing effects arise as long as buffers provide waiting room. We consider finite buffer capacities and generally distributed processing times. Processing is a service operation to customer items in the sense of a queueing system. The arrival stream of customer items is generated by processing parts at a predecessor station. This paper describes an approximation procedure for determining the throughput of such an assembly line. Exact solutions are not available in this case. For performance evaluation, a decomposition approach is used. The two-station subsystems are analyzed by G/G/1/N stopped-arrival queueing models. In this heuristic approach, the virtual arrival and service rates, and the squared coefficients of variation of these subsystems are determined. A system of decomposition equations which are solved iteratively is presented. Any solution to this system of equations indicates estimated values for the subsystems' unknown parameters. The quality of the presented approximation procedure is tested against the results of various simulation experiments.

Table of Contents

ABSTRACTii

CHAPTER 1: INTRODUCTION1

Background of the problem1

Statement of the Problem2

Purpose of Study3

Limitation of the Study7

CHAPTER 2: LITERATURE REVIEW8

CHAPTER 3: METHODOLOGY12

Research Design13

Secondary Research Methods13

Qualitative research method14

Reliability and Validity17

Significance19

Literature Search19

Ethical Concerns20

CHAPTER 4: PROPOSED DATA ANALYSIS PLAN22

REFERENCES23

APPENDIX26

CHAPTER 1: INTRODUCTION

Background of the problem

Flow production systems are installed for products that are produced in high quantities. The layout of these production systems is determined by the flow of material in accordance with the sequence of the operations to be performed (Buzacott, 1995).

Flexibility is needed, if customers can choose variants of a certain product or a product family. From a machine's perspective, this results in stochastic processing times. Besides the differences in the variants' work load, the time required to complete a job at a production station is stochastic if machine failures occur, manual operations are performed, or transfer line segments (which can be seen-in an aggregate view-as a single station of a flow production system) may stop their operations because of disruptions in the flow of material. The stochastics prevent the stations from being perfectly balanced over time (Tempelmeier, 2001). The flow of material is asynchronous. At a given station of the production line, available capacity after the completion of a job and its transfer to the succeeding station and the need for capacity by a job completed at the predecessor station are not perfectly coordinated in time. This is the typical situation, where queueing effects occur. Using corresponding queueing models, in this paper, we will analyze such flow production systems with stochastic processing times (Liu, 1990).

For series flow production systems with exactly one input station (flow lines), procedures for analyzing the number of items that leave the system per unit of time-and ...