Determining job completion time distributions in stochastic production environments

Authors:
C. Nirmal Hasan;Mark L. Spearman
Affiliations:
Dept. of Ind. Eng. & Mgmt. Sciences, Northwestern University, Evanston, Illinois;School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia
Venue:
WSC '95 Proceedings of the 27th conference on Winter simulation
Year:
1995

Citing 7
Cited 1

Monte Carlo optimization, simulation, and sensitivity of queueing networks

Monte Carlo optimization, simulation, and sensitivity of queueing networks
Recursion models for describing and managing the transient flow of materials in generalized flowlines

Management Science
Inverse-transformation algorithms for some common stochastic processes

WSC '89 Proceedings of the 21st conference on Winter simulation
Interpolation approximations of sojourn time distributions

Operations Research
Due-date setting and priority sequencing in a multiclass M/G.1 queue

Management Science
A broader view of the job-shop scheduling problem

Management Science
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems

Estimating expected completion times with probabilistic job routing

Proceedings of the 38th conference on Winter simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

As responsiveness becomes more of a competitive issue, knowledge of completion times of jobs and orders on the shop floor is key to the success and even survival of many manufacturing firms. We present two approaches-a fast sample path generation technique and a numerical technique-to determine the distribution of completion times of jobs in stochastic production environments. We compare our results with those obtained from conventional discrete event simulation and also compare speed of execution. We also show that the distribution obtained from the numerical integration technique provides a lower bound to the actual distribution of the completion times.