Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Screening and selection procedures with control variates and correlation induction techniques

We consider the problem of identifying the simulated system with the best expected performance measure when the number of alternatives is finite and small (often < 500). Recently, more research efforts in the simulation community have been directed to develop ranking and selection (R&S) procedures capable of exploiting variance reduction techniques (especially the control variates). In this article, we propose new R&S procedures that can jointly use control variates and correlation induction techniques (including antithetic variates and Latin hypercube sampling). Empirical results and a realistic illustration show that the proposed procedures outperform the conventional procedures using sample means or control variates alone. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Computational study of the multiechelon production planning problem

In this article we try to identify appropriate solution procedures for different types of multiechelon production planning problems. We conduct an extensive computational study on uncapacitated multiechelon production planning problems with serial and assembly types of bill-of-material structures. Problems are formulated as both single-source fixed charge network problems and as multicommodity flow problems with fixed charges. Solution procedures considered are branch and cut, Lagrangean relaxation (for the network formulation), and branch and bound (for the multicommodity formulation). Three hundred problems with various problem structures are tested. Our conclusions suggest the best approach for each type of problem structure. © 1997 John Wiley & Sons, Inc.     

Combined variance reduction techniques in fully sequential selection procedures

In the past several decades, many ranking‐and‐selection (R&S) procedures have been developed to select the best simulated system with the largest (or smallest) mean performance measure from a finite number of alternatives. A major issue to address in these R&S problems is to balance the trade‐off between the effectiveness (ie, making a correct selection with a high probability) and the efficiency (ie, using a small total number of observations). In this paper, we take a frequentist's point of view by setting a predetermined probability of correct selection while trying to reduce the total sample size, that is, to improve the efficiency but also maintain the effectiveness. In particular, in order to achieve this goal, we investigate combining various variance reduction techniques into the fully sequential framework, resulting in different R&S procedures with either finite‐time or asymptotic statistical validity. Extensive numerical experiments show great improvement in the efficiency of our proposed procedures as compared with several existing procedures.     

The assignment of storage locations to containers for a container stack

Assigning storage locations to incoming or reshuffled containers is a fundamental problem essential to the operations efficiency of container terminals. The problem is notoriously hard for its combinatorial and dynamic nature. In this article, we minimize the number of reshuffles in assigning storage locations for incoming and reshuffled export containers. For the static problem to empty a given stack without any new container arrival, the optimum reshuffle sequence is identified by an integer program (IP). The integer program captures the evolution of stack configurations as a function of decisions and is of interest by itself. Heuristics based on the integer program are then derived. Their competitiveness in accuracy and time are established by extensive numerical runs comparing them with existing heuristics in literature and in practice as well as with extensions of the existing heuristics. Variants of the IP‐based heuristics are then applied to the dynamic problem with continual retrievals and arrivals of containers. Again, numerical runs confirm that the IP‐based heuristic is competitive. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009