Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Country: United States
Found
17049 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Manufacturing control of a serial system with binomial yields, multiple production runs, and non-rigid demand: A decomposition approach
1999,
Braha D.
In this paper, the problem of ordering a series of production runs to meet a single...
Designing cellular manufacturing systems with dynamic part populations
1999,
Reasor R.J.
The effectiveness of a cellular manufacturing system is sensitive to fluctuations in...
Geometrical reasoning based on attributed graph grammar for prismatic parts
1999,
Ben-Arieh D.
Modern manufacturing systems rely on a smooth and quick transformation of the design...
Constant Work in Progress (CONWIP)-based production lines with multiple bottlenecks: Performance and design implications
1999,
Herer Yale T.
This research focuses on CONWIP, a closed production control system where all...
The capacitated lot sizing problem with setup carry-over
1999,
Sox C.R.
Although there is a significant amount of literature on the capacitated lot sizing...
Analysis of a production system in a general configuration
2001,
Zhao Xiaobo
We consider a production system comprising multiple stations (or workshops) such as an...
The surplus inventory matching problem in the process industry
2000,
Kalagnanam Jayant R.
We introduce a new problem that arises from operations planning in the process...
SMAA-2: Stochastic multicriteria acceptability analysis for group decision making
2001,
Salminen Pekka
Stochastic multicriteria acceptability analysis (SMAA) is a multicriteria decision...
Manufacturing to order with random yield and costly inspection
2000,
Gerchak Yigal
This study considers a situation where a contractor receives an order that it commits...
The batch loading and scheduling problem
2001,
Dobson Gregory
This paper discusses the problem of batching and scheduling of certain kinds of batch...
Linear-implicit strong schemes for Itô–Galerkin approximations of parabolic stochastic partial differential equations
2001,
Kloeden P.E.
Linear-implicit versions of strong Taylor numerical schemes for finite dimensional...
Grade selection and blending to optimize cost and quality
2001,
Karmarkar Uday S.
In many chemical process applications, a large mix of products is produced by blending...
The asymptotic optimality of the shortest processing time rule for the flow shop mean completion time problem
2001,
Simchi-Levi David
In the flow shop mean completion time problem, a set of jobs has to be processed on m...
Multistage lot sizing problems via randomized rounding
2001,
Bertsimas Dimitris
We study the classical multistage lot sizing problem that arises in distribution and...
Quantitative analysis for Internet-enabled supply chains
2001,
Tayur Sridhar
A supply chain, from an operations perspective, has three components: sourcing or...
A modular, parametric vibratory feeder: A case study for flexible assembly tools for mass customization
1998,
Joneja A.
A new class of parametric and modular flexible tools is proposed to improve the setup...
Optimal material control in an assembly system with component commonality
2001,
Cohen Morris A.
Allocation of scarce common components to finished product orders is central to the...
The resource constrained project scheduling problem with multiple crashable modes: An exact solution method
2001,
Erenguc S. Selcuk
We introduce a formulation and an exact solution method for a nonpreemptive resource...
A new kind of fictitious play
2001,
Washburn Alan
Gass, Zafra, and Qiu introduce a modified version of fictitious play for matrix games...
Cascade graphs: Design, analysis and algorithms for relational joins
2001,
Zionts Stanley
The focus of this work is on join optimization in relational database systems. The...
Sorting permutations by reversals through branch-and-price
2001,
Caprara Alberto
We describe an exact algorithm for the problem of sorting a permutation by the minimum...
Iterative coloring extension of a maximum clique
2001,
Dell'Olmo Paolo
In this paper we present an improved branch and bound algorithm for the vertex...
A parallel, linear programming-based heuristic for large-scale set partitioning problems
2001,
Savelsbergh Martin W.P.
We describe a parallel, linear programming and implication-based heuristic for solving...
Fast heuristics for the maximum feasible subsystem problem
2001,
Chinneck John W.
Given an infeasible set of linear constraints, finding the maximum cardinality...
First Page
298
299
300
301
302
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers