Showing papers in "Operations Research Letters in 1993"

TL;DR: In this paper, a branch-and-cut procedure for stochastic integer programs with complete recourse and first stage binary variables is presented, which is shown to provide a finite exact algorithm for a number of integer programs, even in the presence of binary variables or continuous random variables in the second stage.

TL;DR: The results obtained from this problem, which are definitely better than those provided by standard iterative-improvement methods and compare favorably with those of simulated annealing, show the relevance of the noising method.

TL;DR: A dynamic programming algorithm of polynomial time complexity when the number of job families is fixed is developed, motivated by the problem of scheduling burn-in ovens in the semiconductor industry.

TL;DR: In this paper it is proved that the CTV problem is NP-hard.

TL;DR: This paper presents an on-line algorithm for the d-dimensional bin packing problem and shows that for uniformly distributed items the algorithm has an expected asymptotic efficiency of (2([email protected]^2 - 1))^d.

TL;DR: A large class of separable quadratic programming problems is presented, which includes the separable convexquadratic transportation problem with a fixed number of sources and separables convex quadRatic programming with nonnegativity constraints and a fixedNumber of linear equality constraints.

TL;DR: The concept that allergy is not the only cause for nasal polyps and that the accumulation of eosinophilic granulocytes observed in most polyps is often not related to allergy is supported.

TL;DR: The concept of conditional risk is considered, and a model that minimizes the conditional risk, keeping the accident probability within a set threshold is presented.

TL;DR: The problem of finding a set of constraints of minimum cardinality which when relaxed in an infeasible linear program, make it feasible is shown to be NP-hard even when the constraint matrix is totally unimodular and polynomial-time solvability is proved.

TL;DR: The classic Lin-Kernighan traveling-salesman heuristic is modified so that the scope of its depth search is widened, resulting in a simple yet effective heuristic that can be easily coded and adapted for general OR applications.

TL;DR: An extremely simple algorithm to solve the problem of maintaining a near-constant production rate for every model in the line in a just-in-time (JIT) production system is provided.

TL;DR: This paper shows that Tsuchiya and Muramatsu's result is sharp by providing a simple linear programming problem for which the sequence of dual variables fails to converge for every step size greater than two-thirds.

TL;DR: An algorithm is proposed that derives heuristic cyclic schedules and is able to find the optimal schedule under certain conditions and results evaluating the effectiveness of the heuristic under general conditions are given.

TL;DR: F Fukushima's results can be extended to monotone and Lipschitz continuous and continuously differentiable variational inequalities, if one is willing to modify slightly the basic algorithmic scheme.

TL;DR: The normal ultrasound (US) anatomy of the salivary glands along with tumoral, lithiasic, and inflammatory pathologies are reviewed, allowing correct identification of the benign nature of a lesion in over 80% of the cases.

TL;DR: Three-dimensional cultures in agar gel may allow the in vitro production of bioartificial cartilage for transplantation and suggest that chondrocytes remained morphologically, phenotypically and functionally differentiated.

TL;DR: Motivated by a practical scheduling problem, this work studies the class of problems where setup times are bounded by processing times and develops tight worst case error bounds for list scheduling algorithms to minimize Cmax and Lmax.

TL;DR: This paper provides an exact formulation of the relevant costs which, when minimized, give the true optimal lot size.

TL;DR: Simulation Graphs are described and shown to possess many of the desirable features of a modern model-based problem-solving environment.

TL;DR: The lower bound 1+1/e+O(n^-^1^+^@e)@k 1.368 is established for the expected minimal cost in the n x n random Assignment Problem where the cost matrix entries are drawn independently from the Uniform(0, 1) probability distribution.

TL;DR: A simple 2-approximate greedy heuristic that runs within the time needed to compute a minimum spanning tree such that each of its trees spans at least m vertices is described.

TL;DR: The M^x/G/1 queue without server vacations, with multiple vacations is studied under the LIFO service regime, and explicit formulae are derived for the Laplace-Stieltjes transform and second moment of the waiting time of an arbitrary customer.

TL;DR: Results indicate that the Lagrangian relaxation using a mixed selection strategy is effective on the largest problems, and the best overall algorithms divide the computer resources into two distinct searches, which communicate only to update global information on lower and upper bounds.

TL;DR: A spindle cell lipoma was removed surgically from the right intralaryngeal lesion of a 68-year-old man, the first reported case of a spindlecell lipoma within the larynx.

TL;DR: This paper attempts to justify a weighting system proposed as a normalizer in the literature by proving that weights inversely proportional to the ideal are good shadow prices in economic scenarios.

TL;DR: A parametric method is proposed for solving a special production - transportation problem with two factories, and the minimum concave cost flow problem on a single source uncapacitated network with a single nonlinear arc cost.

TL;DR: A VA dissection should be suspected in a case of vertigo following chiropractic neck manipulations, and vestibular tests should be done carefully, avoiding Rose's positions.

TL;DR: The results appear to demonstrate that enkephalin acts as a neurotransmitter or a neuromodulator in the efferent neurones of inner hair cells which have synaptic contact to the afferents of the innerhair cells.

TL;DR: In this paper, it is shown that the matrix-geometric approach is very well suited to find the equilibrium probabilities of the queue lengths and that a proper choice for the state space partitioning depends on the aspect one is interested in.

TL;DR: A new property of the LPT schedules is explored and Graham's bound of 43 - 1/(3m) and the generalized bound for the performance of LPT heuristic is readily obtained from this property.