INFORMS Journal on Computing articles from January 2002

INFORMS Journal on Computing archives from January 2002

Editorial mission.
January 1, 2002... The INFORMS Journal on Computing (JOC) is a quarterly journal that publishes papers the intersection of operations research (OR) and computer science (CS). Most papers contain original research, but we also welcome special papers in a variety...

From the Editor.
January 1, 2002... Kelton, W. David Over the years, JOC has published different kinds of "special" papers that, in one way or another, venture outside our usual mainstay of technical papers reporting on specific research findings. Most of these special...

Ranking and selection for steady-state simulation: procedures and perspectives. (Research Perspective).
January 1, 2002... We present and evaluate three ranking-and-selection procedures for use in steady-state simulation experiments when the goal is to find which among a finite number of alternative systems has the largest or smallest long-run average performance....

A MINSAT approach for learning in logic domains.
January 1, 2002... This paper describes a method for learning logic relationships that correctly classify a given data set. The method derives from given logic data certain minimum cost satisfiability problems, solves these problems, and deduces from the...

Combining column generation and Lagrangean relaxation to solve a single-machine common due date problem.
January 1, 2002... Column generation has proved to be an effective technique for solving the linear programming relaxation of huge set covering or set partitioning problems, and column generation approaches have led to state-of-the-art so-called branch-and-price...

An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem.
January 1, 2002... This paper introduces a new neighborhood search technique, called dynasearch, that uses dynamic programming to search an exponential size neighborhood in polynomial time. While traditional local search algorithms make a single move at each...

Assembly-line scheduling with concurrent operations and parallel machines.
January 1, 2002... This paper addresses the assembly-line scheduling problem with concurrent operations per stage and parallel machines. This problem can be briefly described as the problem of sequencing a predetermined set of parts with known processing-time...

Minimax models for diverse routing.
January 1, 2002... An important task in the management and administration of communication networks is constructing routes for messages to follow from source to destination. A common approach is to route along the shortest available path connecting the source to...