| Tail Behaviour for Suprema of Empirical Processes |
SEP 1984 |
|
| Authors:
R. J. Adler; L. D. Brown; TECHNION - ISRAEL INST OF TECH HAIFA FACULTY OF INDUSTRIAL AND MANAGEMENT ENGINEERING
|
 | This document considers multi-variate empirical processes with an empirical distribution function based on i.i.d. variables with certain distribution functions. |
|
| Interpretations of Task Difficulty in Terms of Resources: Efficiency, Load, Demand, and Cost Composition. |
NOV 1978 |
|
| Authors:
David Navon; Daniel Gopher; TECHNION - ISRAEL INST OF TECH HAIFA FACULTY OF INDUSTRIAL AND MANAGEMENT ENGINEERING
|
| The effect of task difficulty on performance can be conceptualized within a theory which posits that performance depends on the use of resources from a single pool. When the difficulty of a task is said to increase it may mean either that resources invested in it can now do less (i.e., a decrease in efficiency), or are now required to do more (i.e., an increase in load), or have now ... |
|
| Tracking in Two Dimensions as a Function of Dimension Priorities and Tracking Difficulty (II). |
DEC 1977 |
|
| Authors:
Daniel Gopher; David Navon; Nela Chillag; Hanna Dotan; TECHNION - ISRAEL INST OF TECH HAIFA FACULTY OF INDUSTRIAL AND MANAGEMENT ENGINEERING
|
| Major issues in this study are the degree of voluntary control the operator has on his resources, his ability and willingness to meet demands set by the experimentor, and the extent to which resource allocation affects joint performance in various task combinations and different difficulty manipulations. An experiment is presented in which each of the dimensions (horizontal and vertical) in a two dimensional tracking task was treated as a separate ... |
|
| On the Economy of the Human Processing System: A Model of Multiple Capacity. |
NOV 1977 |
|
| Authors:
David Navon; Daniel Gopher; TECHNION - ISRAEL INST OF TECH HAIFA FACULTY OF INDUSTRIAL AND MANAGEMENT ENGINEERING
|
| An approach to human performance which is based on economic concepts is proposed. This approach hinges on the idea that the human processing system has a number of mechanisms each having its own capacity. Those capacities can at any moment be allocated among several processes. Since tasks may differ with respect to the types of mechanisms they call for and the demands they pose for the use of those mechanisms, ... |
|
| OPTIMIZATION OF INSPECTION POLICIES BY DYNAMIC PROGRAMMING, |
MAR 1970 |
|
| Authors:
Z. Kander; P. Naor; TECHNION - ISRAEL INST OF TECH HAIFA FACULTY OF INDUSTRIAL AND MANAGEMENT ENGINEERING
|
| Inspection models deal with operating systems whose stochastic failure is detected by observations carried out intermittently. Solutions of the problems under consideration using differentiation have previously been given by the authors. In the current study Dynamic Programming methodology is introduced for this purpose. The approach has many potential advantages - it can be utilized for any type of failure rate - increasing, decreasing or mixed. Furthermore, the method is applicable ... |
|
| SOCIAL OPTIMIZATION VERSUS SELF-OPTIMIZATION IN WAITING LINES |
OCT 1969 |
29 pages |
| Authors:
I. Adler; P. Naor; TECHNION - ISRAEL INST OF TECH HAIFA FACULTY OF INDUSTRIAL AND MANAGEMENT ENGINEERING
|
 | A queueing model is considered where customers arriving in a Poisson stream are given the choice of either joining the waiting line or - by declining to do so - of foregoing the benefits accruing through service. The decision of each customer is based on his concrete benefit-cost analysis. As his service time is constant, and exhaustive information as to the actual state of the system is available, both of ... |
|
| QUEUEING PROBLEMS WITH HETEROGENEOUS ARRIVALS AND SERVICE, |
JUL 1969 |
|
| Authors:
U. Yechiali; P. Naor; TECHNION - ISRAEL INST OF TECH HAIFA FACULTY OF INDUSTRIAL AND MANAGEMENT ENGINEERING
|
| A two-level modification of the M/M/1 queueing model is studied where the rate of arrival and the service capacity are subject to Poisson alternations. The ensuing 'two-dimensional' problem is analyzed by the use of partial generating function techniques which appear to be essential in the present context. The steady state probabilities and the expected queue are evaluated and numerous special and extreme cases are analyzed in detail. (Author) |
|
| THE OPTIMAL CONTROL OF A QUEUEING PROCESS, |
JUN 1969 |
|
| Authors:
M. Yadin; S. Zacks; TECHNION - ISRAEL INST OF TECH HAIFA FACULTY OF INDUSTRIAL AND MANAGEMENT ENGINEERING
|
| Controlled queueing processes have been studied by several authors. The common model is a one-station queueing system at which customers arrive at a steady rate. The important feature is that management can vary the capacity of the service station according to the queue size, and thus, by increasing or decreasing the service intensity, control the queue size. The present paper describes the problem of determining the optimal control policy. Intervals ... |
|
| SORTING FEASIBLE BASIC SOLUTIONS OF A LINEAR PROGRAM, |
MAY 1969 |
|
| Authors:
M. A. Pollatschek; B. Avi-Itzhak; TECHNION - ISRAEL INST OF TECH HAIFA FACULTY OF INDUSTRIAL AND MANAGEMENT ENGINEERING
|
| An algorithm for sorting feasible basic solutions of a linear program is proposed. The algorithm proceeds from one basic solution to the next in order of non-increasing values of the objective function. The use of the proposed procedure is demonstrated through numerical examples and geometrical interpretations. The algorithm solves problems where a basic feasible solution is sought, maximizing a linear objective function and satisfying some prescribed conditions. This category includes ... |
|
| ON THE PROBLEM OF ASSEMBLY LINE BALANCING, |
APR 1969 |
|
| Authors:
E. M. Mansoor; M. Yadin; TECHNION - ISRAEL INST OF TECH HAIFA FACULTY OF INDUSTRIAL AND MANAGEMENT ENGINEERING
|
| Assembly line balancing involves the sequencing of jobs and their assignment to work stations, according to given precedence relations and the work content of each job, in order to minimize the maximum work content of the jobs which are assigned to each of the stations, that is, to minimize the so-called 'cycle time'. There are two approaches: one being to determine the optimal cycle time for a given number of ... |
|
| OPTIMIZATION OF INSPECTION POLICIES BY CLASSICAL METHODS, |
APR 1969 |
|
| Authors:
Z. Kander; P. Naor; TECHNION - ISRAEL INST OF TECH HAIFA FACULTY OF INDUSTRIAL AND MANAGEMENT ENGINEERING
|
| Inspection models deal with operating systems whose stochastic failure is detected by observations carried out intermittently. Previous authors calculated an optimal policy for a system possessing a given life time distribution. In these models two types of cost are introduced: one pertains to the expense incurred for each check; the other is associated with the time which elapses between system failure and its discovery at the subsequent check. The optimal ... |
|
| MULTIPLE-SERVERS QUEUE WITH BULK ARRIVALS, |
DEC 1968 |
|
| Authors:
D. Z. Mittwoch; B. Avi-Itzhak; TECHNION - ISRAEL INST OF TECH HAIFA FACULTY OF INDUSTRIAL AND MANAGEMENT ENGINEERING
|
| The transient and steady-state behaviour of the M/M/r queueing process with bulk arrivals is analysed. The transient behaviour is treated in terms of Laplace transforms, and steady-state behaviour - in terms of generating functions and probabilities. The influence of the bulk-size variance on the expected queue size is discussed at some length. (Author) |
|
| QUEUEING MODELS FOR TIME-SHARING SERVICE SYSTEMS, |
OCT 1968 |
|
| Authors:
I. Adiri; B. Avi-Itzhak; TECHNION - ISRAEL INST OF TECH HAIFA FACULTY OF INDUSTRIAL AND MANAGEMENT ENGINEERING
|
| In most queueing situations, it is desirable that service to customers be free from interruptions causing time and service losses. It is recognized, however, that in certain circumstances controlled interruptions may improve overall system performance, and this idea is the bais of all time-sharing systems. In the latter, service is given in segments; the customer may be served, uninterrupted, for no longer than some predetermined time interval called a quantum. ... |
|
| A TIME-SHARING MODEL WITH MANY QUEUES, |
JUL 1968 |
|
| Authors:
I. Adiri; B. Avi-Itzhak; TECHNION - ISRAEL INST OF TECH HAIFA FACULTY OF INDUSTRIAL AND MANAGEMENT ENGINEERING
|
| The paper presents a mathematical study of a time-sharing system with a single server and many queues. In each queue a customer receives one quantum of service and is then sent to the end of the next queue, provided his service demand has not been completely satisfied. When a quantum of service is completed the server attends to the first customer in the lowest index non-empty queue. The discipline of ... |
|
Reports by Corporate Author
