Abstract
This paper uses a PERT network for which operation start and finish times are approximated by mixtures of Erlang distributions as the basis of a paradigm for modeling assembly operations. Numerical examples demonstrate that the approximations improve on previously available methods and give accurate estimates in cases involving operation times that are mixtures of Erlangs, exponential, or normal. In addition, a new method of computing lower bounds on operation start times is derived; numerical tests indicate that the method gives tighter bounds than do previously available methods. The significance of the paradigm is discussed, emphasizing the improvement it makes over traditional scheduling paradigms.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
