Review of operator&amp;sol;machine interference models

Stecke, Kathryn E.; Aronson, Jay E.

doi:10.1080/00207548508904696

Cited by 111 publications

(46 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…4. Studies on the real-life applications of GAP include those of [11][12][13][14][15][16][17]. To the authors' knowledge, no previous GAP study has examined the staffing problem at a semiconductor fab with the features presented in this paper.…”

Section: Model Developmentmentioning

confidence: 99%

An operator staffing and assignment model for foundry fabs

2005

Int J Adv Manuf Technol

View full text Add to dashboard Cite

This paper presents a linear programming (LP) model for simultaneously solving an operator staffing problem in a semiconductor fab. The problem is to determine the staffing level and assign operators to the staffing positions. The semiconductor fab has the following characteristics: it imposes a no-lay-off policy, but allows overtime; keeps high-quality shop floor operations; aims to control tightly the staffing costs; and faces frequent changes of product mix. The operator staffing problem in such a fab was not addressed in previous literature. The proposed LP model aims to minimize the operator staffing cost. The LP solutions have been examined and were found to be insensitive to stochastic demands modeled by various simulation replicates.

show abstract

Section: Model Developmentmentioning

confidence: 99%

An operator staffing and assignment model for foundry fabs

2005

Int J Adv Manuf Technol

View full text Add to dashboard Cite

show abstract

“…The machine-repairman problem is one of the most well-known finite-population queueing systems (see Stecke and Aronson (1985) and Stecke (1992) for the reviews of literature on the machine-repairman problem). In a general machine-repairman problem, r there is/are one or more repairmen who can repair all machines, or a subset of the machines.…”

Section: Introductionmentioning

confidence: 99%

Optimal server scheduling in nonpreemptive finite-population queueing systems

2006

View full text Add to dashboard Cite

We consider a finite-population queueing system with heterogeneous classes of customers and a single server. For the case of nonpreemptive service, we fully characterize the structure of the server's optimal service policy that minimizes the total average customer waiting costs. We show that the optimal service policy may never serve some classes of customers. For those classes that are served, we show that the optimal service policy is a simple static priority policy. We also derive sufficient conditions that determine the optimal priority sequence.

show abstract

“…As a result, a dedicated repair crew usually exists at the line to clear station jams or machine failures (Stecke and Aron 1985). In the unrealistic case in which one operator per machine is available in the line during each shift, as soon as the failure occurs the repair intervention is started by the operator.…”

Section: Repair Crew Optimizationmentioning

confidence: 99%