Given an i.i.d. sequence of n letters from a finite alphabet, we consider the length of the longest run of any letter. In the equiprobable case, results for this run turn out to be closely related to the well-known results for the longest run of a given letter. For coin-tossing, tail probabilities are compared for both kinds of runs via Poisson approximation.

This paper considers an economic production quantity (EPQ) model with imperfect production processes, in which the setup cost and process quality are functions of capital expenditure. The mathematical model is derived to investigate the effects of an imperfect production process on the optimal production cycle time when capital investment strategies in setup reduction and process quality improv...

The purpose of this article is to present an optimization model for designing an acceptance sampling plan based on cumulative sum of run length of conforming items. The objective is to minimize the total loss including both the producer and consumer losses. The concept of minimum angle method is applied to consider producer and consumer risks in the optimization model. Also the average number o...

We present a test resource partitioning (TRP) technique that simultaneously reduces test data volume, test application time, and scan power. The proposed approach is based on the use of alternating run-length codes for test data compression. We present a formal analysis of the amount of data compression obtained using alternating run-length codes. We show that a careful mapping of the don’t-car...