An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer

This paper deals with the problem of makespan minimization in a flow shop with two machines when the input buffer of the second machine can only host a limited number of parts. Here we analyze the problem in the context of batch processing, i.e., when identical parts must be processed consecutively. We propose an exact branch-and-bound algorithm, in which the bounds exploit the batching nature of the problem. Extensive computational results show the effectiveness of the approach, and allow us to compare it with a previous heuristic approach. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 141–164, 1998     

On the orbit characteristics of the M/G/ 1 retrial queue

In teletraffic applications of retrial queues only the service zone is observable. Another part of a retrial queue, the orbit, which represents the delay before repeated attempts to get service, cannot be observed. Thus, it is very important to get general results about behavior of the orbit. We investigate two characteristics of the orbit, namely, the orbit busy period and the orbit idle period, which seem to be very useful from this point of view. © 1996 John Wiley & Sons, Inc.     

Properties of a source location estimator in the plane

The statistical properties of an estimator of a source location were established by simulation for the case in which the source location is estimated—using transformation of lines to points—from the angles in which different observers see the source, and both the assumed locations of the observer points and the observed angles are subject to error. It was found that for normal error distributions the estimator is unbiased, and the resulting estimates are approximately normally distributed with a small standard deviation. An easy-to-use and reliable forecasting formula was suggested to forecast the parameters of the distributions of the estimates for different observer-source relationships. © 1993 John Wiley & Sons, Inc.     

Optimizing disaster relief: Real-time operational and tactical decision support

We introduce a real-time decision support system which uses optimization methods, simulation, and the judgement of the decision maker for operational assignment of units to tasks and for tactical allocation of units to task requirements. The system, named ARES for the Greek god of war, accommodates a high degree of detail in the logistics of unit movements during operations, yet separates the assignment and allocation activities in a fashion which naturally accommodates human intervention and judgement—ARES is designed to assist the decision maker, not to replace him. ARES is demonstrated with a hypothetical scenario constructed for 14 Engineering Battalions of the Hellenic Army which are assigned 20 tasks employing 25 resource types in repairing major damage to public works following a great earthquake. (This hypothetical data was prepared prior to the earthquake in Kalamata near Athens on 13 September, 1986, and exhibits uncanny, but coincidental, resemblance to that real situation.) ARES is designed for use in real time, and quick data preparation is aided by the provision from published sources of standard data for many foreseeable tasks; this data can be quickly accessed via visual icons on a computer screen and customized for the actual work at hand. © 1993 John Wiley & Sons, Inc.     

Real-time task scheduling with overheads considered

n periodic tasks are to be processed by a single machine, where each task i has a maximum request rate or periodicity F_i, a processing time E_i, a deadline D_i, relative to each request of task i, a task-request interrupt overhead I_i, and a task-independent scheduling overhead S. Two scheduling strategies are considered for sequencing the execution of an arbitrary arrangement of task requests in time: the preemptive and the nonpreemptive earliest-deadline algorithms. Necessary and sufficient conditions are derived for establishing whether a given set of tasks can be scheduled by each scheduling strategy. The conditions are given in the form of limited simulations of a small number of well-defined task-request arrangements. If all simulations succeed, the schedule is feasible for the given set of tasks. If any simulation fails, the schedule is infeasible. While interrupt handling and scheduling overheads can be handled by such simulations, context switching overhead resulting from preemption cannot. A counterexample illustrates how the simulations fail to uncover unschedulable task sets when context switching overhead is considered.     

Integrating multiple criteria decision making models into the decision support system framework for marketing decisions

A large number of multiple criteria decision making (MCDM) models have evolved over the past decade. This field now seems to have reached a stage of maturity. However, the managerial community has not yet extensively adopted these models in solving practical decision problems. The present article focuses on integrating the MCDM models within the decision support system (DSS) framework to encourage greater use of these models. A DSS framework and the criteria used for the choice of a model is discussed. Based on these criteria MCDM models generally used in the marketing field are evaluated. The possibility of using a mixture of MCDM models within the DSS framework is also explored. Following this, the role of the MCDM models in DSS is delineated. It is argued that, within the problem-solving process, the confluence of MCDM models and DSS plays a vital role in developing high-quality solutions.     

The New Global Security Landscape: The Road Ahead

If one could look through the familiar artificial political lines and colors of a current world map into the twenty-first century strategic reality, one could see a complex new security arena. A deeper look into that picture would provide magical snapshots that show several types of ambiguous and asymmetric conflicts, and state failure - and their causes and consequences. Then, with some additional adjustments of focus, one can discern a number of issues that cannot be shown in two-dimensional space. They are briefly discussed as follows. First and importantly, one can get a better idea of the complex threat situation and the ultimate threat - state failure. Second, an even deeper examination of the vision of contemporary wars reveals the shadows of things that have been and of those that will be on the road ahead. Third, a closer look at the familiar and troubling world map exposes some signposts on the road ahead that indicate the most significant changes in the landscape. Finally, our magical microscope reveals a short list of the basic challenges and tasks that can help discerning civilian and military leaders negotiate the road through the new global security environment.     

Age replacement policies in two time scales

We develop and estimate optimal age replacement policies for devices whose age is measured in two time scales. For example, the age of a jet engine can be measured in the number of flight hours and the number of landings. Under a single‐scale age replacement policy, a device is replaced at age τ or upon failure, whichever occurs first. We show that a natural generalization to two scales is to replace nonfailed devices when their usage path crosses the boundary of a two‐dimensional region M, where M is a lower set with respect to the matrix partial order. For lifetimes measured in two scales, we consider devices that age along linear usage paths. We generalize the single‐scale long‐run average cost, estimate optimal two‐scale policies, and give an example. We note that these policies are strongly consistent estimators of the true optimal policies under mild conditions, and study small‐sample behavior using simulation. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 592–613, 2003.     

Nonparametric estimation of some quantities of interest from renewal theory

In this paper, confidence intervals are given for two quantities of importance related to renewal processes. For each quantity, two confidence intervals are discussed. One confidence interval is given for general, all‐purpose use. Another confidence interval is given which is easier to compute, but not of general use. The case where data are subject to right censorship is also considered. Some numerical comparisons are made. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 638–649, 2003.