A sequence of servers with arbitrary input and regular service times revisited

Article Abstract:

Two papers by Benjamin Avi-Itzhak and Micha Yadin that appeared in the Mar. 1965 issue of Management Science are revisited. The first paper analyzed a two-server tandem system with manufacturing and no intermediate queue, while the second paper investigated an arbitrary number of tandem servers with manufacturing blocking. The present study examines the same systems under k-stage blocking. Under this blocking scheme a job, at each position in the sequence, needs the joint attendance of the server of that position and the servers of the succeeding k-1 positions. One of the most notable findings of the study is that the waiting times for K>1 are not order-intensive even as G/D/1 equivalence is preserved. The findings are expected to hold true for the case of nonoverlapping, arbitrarily distributed service times substituted for constant service times.

Queuing theory

---

Component sharing in the management of product variety: a study of automotive braking systems

Article Abstract:

A study was conducted to analyze component sharing using automotive front brakes as an example through an analytic framework. Key factors influencing component-sharing decisions were examined. The front brakes sharing problem supported several characteristics. The properties correlate with component use and compatibility, performance requirement, and production cost. Variations in actual component-sharing practice were then analyzed. Results indicated that the analytic model explains variations in sharing practice for automotive braking systems. Findings also showed that the optimal number of brake rotors was a function of the range of vehicle weights, fixed component design, sales volume, and tooling costs.

Motor vehicle parts and accessories, Production Management, Management Theory & Techniques, Auto Brakes, Motor Vehicle Brake System Manufacturing, Management, Brakes, Industrial design, Automotive brakes

---

Random review production/inventory systems with compound Poisson demands and arbitrary processing times

Article Abstract:

This paper discusses the (s,S) control policy for production/inventory systems involving the production of specific items with compound Poisson demands, random production schedules, and irregular inspection times. Also presented is a search method to compute for optimal control values that considered the convexity and recursive properties of cost functions.

Usage, Poisson distribution

Similar abstracts:

• Abstracts: Line reversibility of tandem queues with general blocking. Queues with slowly varying arrival and service processes
• Abstracts: A single bottleneck system with binomial yields and rigid demand
• Abstracts: Adjusting replenishment orders to reflect learning in a material requirements planning environment. The influence prism in SMEs: the power of CEOs' perceptions on technology policy and its organizational impacts
• Abstracts: Security baskets and index-linked securities. The agency costs of free cash flow: acquisition activity and equity issues
• Abstracts: Executive share options. Pay, involvement and appraisal. Rewarding top managers for company's success

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.