THE DESIGN AND ANALYSIS OF EXPERIMENTS. By Oscar Kempthorne. New York, John Wiley and Sons, Inc., 1952. 631 pp. $8.50. This book by a teacher of statistics (as well as a consultant for \"experimenters\") is a comprehensive study of the philosophical background for the statistical design of experiment. It is necessary to have some facility with algebraic notation and manipulation to be able to use the volume intelligently. The problems are presented from the theoretical point of view, without such practical examples as would be helpful for those not acquainted with mathematics. The mathematical justification for the techniques is given. As a somewhat advanced treatment of the design and analysis of experiments, this volume will be interesting and helpful for many who approach statistics theoretically as well as practically. With emphasis on the \"why,\" and with description given broadly, the author relates the subject matter to the general theory of statistics and to the general problem of experimental inference. MARGARET J. ROBERTSON

The Design and Analysis of Experiments

In most real-world environments, scheduling is an ongoing reactive process where the presence of a variety of unexpected disruptions is usually inevitable, and continually forces reconsideration and revision of pre-established schedules. Many of the approaches developed to solve the problem of static scheduling are often impractical in real-world environments, and the near-optimal schedules with respect to the estimated data may become obsolete when they are released to the shop floor. This paper outlines the limitations of the static approaches to scheduling in the presence of real-time information and presents a number of issues that have come up in recent years on dynamic scheduling.

The paper defines the problem of dynamic scheduling and provides a review of the state-of-the-art of currently developing research on dynamic scheduling. The principles of several dynamic scheduling techniques, namely, heuristics, meta-heuristics, multi-agent systems, and other artificial intelligence techniques are described in detail, followed by a discussion and comparison of their potential.

/pdf/a-survey-of-dynamic-scheduling-in-manufacturing-systems-1u4bc63f51.pdf

A survey of dynamic scheduling in manufacturing systems

http://akturk.bilkent.edu.tr/ie573/aytug.pdf

Executing production schedules in the face of uncertainties: a review and some future directions

An enhanced text entry system using word-level analysis to automatically correct inaccuracies in user keystroke entries on reduced keyboards. The keyboard (105) may be a part of a touch-sensitive panel or display screen (100) or on a mechanical keyboard system. A method and system are defined which determine one or more alternative textual interpretations of each sequence of inputs detected within a designated auto-correcting keyboard region (106). The actual contact locations for the keystrokes may occur outside the boundaries of the specific keyboard key regions, where the distance from each contact location to each corresponding intended character may in general increase with the expected frequency of the intended word in the language or in a particular context. The user can easily select the intended word from among the generated interpretations.

Keyboard system with automatic correction

There is disclosed an enhanced text entry system which uses word-level analysis to correct inaccuracies automatically in user keystroke entries on reduced-size or virtual keyboards. A method and system are defined which determine one or more alternate textual interpretations of each sequence of inputs detected within a designated auto-correcting region. The actual interaction locations for the keystrokes may occur outside the boundaries of the specific keyboard key regions associated with the actual characters of the word interpretations proposed or offered for selection, where the distance from each interaction location to each corresponding intended character may in general increase with the expected frequency of the intended word in the language or in a particular context. Likewise, in a virtual keyboard system, the keys actuated may differ from the keys actually associated with the letters of the word interpretations. Each such sequence corresponds to a complete word, and the user can easily select the intended word from among the generated interpretations. Additionally, when the system cannot identify a sufficient number of likely word interpretation candidates of the same length as the input sequence, candidates are identified whose initial letters correspond to a likely interpretation of the input sequence.

Virtual keyboard system with automatic correction

A comparative study of dispatching rules in dynamic flowshops and jobshops

Efficient dispatching rules for scheduling in a job shop

Scheduling in job shops with machine breakdowns: an experimental study

Many dispatching rules for scheduling in dynamic jobshops have been proposed over many years. The research issues in jobshop scheduling seem to be still open in the sense that no single rule has been found to be the best under all shopfloor conditions even with respect to one single measure of performance. Added to this problem, there are several measures of performance, e.g. the minimizations of mean, maximum and variance of flowtime, percentage of tardy jobs, and mean, maximum and variance of tardiness of jobs. Recent studies have reported the development of more efficient dispatching rules than the popular rules, e.g. SPT, COVERT, MOD and ATC. This study is an attempt to improve some of the recently reported dispatching rules. An extensive simulation study reveals that the improved rules developed in the present study appear to be quite effective in minimizing mean flowtime, and maximum tardiness and variance of tardiness of jobs.

Efficient jobshop dispatching rules: Further developments

The problem of scheduling on a single machine is considered in this paper with the objective of minimizing the sum of weighted tardiness of jobs. A new ant-colony optimization (ACO) algorithm, called fast ACO (FACO), is proposed and analysed for solving the single-machine scheduling problem. By considering the benchmark problems available in the literature for analysing the performance of algorithms for scheduling on a single machine with the consideration of weighted tardiness of jobs, we validate the appropriateness of the proposed local-search schemes and parameter settings used in the FACO. We also present a comparison of the requirements of CPU time for solving the single-machine total-weighted tardiness problem by the FACO and the existing algorithms.

https://link.springer.com/content/pdf/10.1057%2Fpalgrave.jors.2601906.pdf

Oliver Holthaus

Papers

A comparative study of dispatching rules in dynamic flowshops and jobshops

Efficient dispatching rules for scheduling in a job shop

Scheduling in job shops with machine breakdowns: an experimental study

Efficient jobshop dispatching rules: Further developments

A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs