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
An experimental study of LP-based approximation algorithms for scheduling problems
2005,
Savelsbergh Martin W.P.
Recently there has been much progress on the design of approximation algorithms for a...
Models and tabu search heuristics for the berth-allocation problem
2005,
Laporte Gilbert
In the Berth-Allocation Problem (BAP) the aim is to optimally schedule and assign...
Near-optimal solutions of large-scale single-machine scheduling problems
2005,
Avella Pasquale
The single-machine scheduling problem (SMSP) with release dates concerns the optimal...
Lower bounds for the head–body–tail problem on parallel machines: A computational study of the multiprocessor flow shop
2005,
Lenstra Jan Karel
The multiprocessor flow-shop is the generalization of the flow-shop in which each...
An improved augmented neural-network approach for scheduling problems
2006,
Pirkul Hasan
For the task-scheduling problem, we propose an augmented neural-network approach,...
Planning and Scheduling in Manufacturing and Services
2006
Discrete stochastic optimization using variants of the stochastic ruler method
2005,
Andradttir Sigrn
We present two random search methods for solving discrete stochastic optimization...
Modeling Performance Measurement: Applications and Implementation Issues in DEA
2005
Analytic hierarchy process with fuzzy scoring in evaluating multidisciplinary R&D projects in China
2005,
Wang C.K.
A system for evaluating the outcomes of multidisciplinary R&D projects was...
The impact of aggregating benefit and cost criteria in four multicriteria decision analysis methods
2005,
Triantaphyllou E.
Multicriteria decision analysis (MCDA) problems (also known as multicriteria...
Fuzzy Sets in the Management of Uncertainty
2005,
Nikolopoulos K.
A multi-objective model for bank ATM networks
2005,
Thomas L.C.
In this paper we present an application of the core solution concepts for...
On labeling the vertices of products of complete graphs with distance constraints
2005,
Erwin D.J.
Variations of Hale's channel assignment problem, the L ( j , k )-labeling problem and...
Graph distance-dependent labeling related to code assignment in computer networks
2005,
Yeh Roger K.
For nonnegative integers d 1 , d 2 , and L(d 1 , d 2 ) -labeling of a graph G , is a...
Maximal vertex-connectivity of Sn,k
2005,
Cheng Eddie
The class of star graphs is a popular topology for interconnection networks. However,...
A branch-and-price approach for the maximum weight independent set problem
2005,
Wilhelm Wilbert E.
The maximum weight-independent set problem (MWISP) is one of the most well-known and...
The profitable arc tour problem: Solution with a branch-and-price algorithm
2005,
Dejax Pierre
In this article, we introduce a new arc routing problem that we call the profitable...
Shock model in Markovian environment
2005,
Li Gang
A Markov modulated shock model is studied in this paper. In this model, both the...
A generalization of the weighted set covering problem
2005,
Leung Joseph Y.-T.
We study a generalization of the weighted set covering problem where every element...
Quantifying optimal mesh and ring design costs
2005,
Stidsen Thomas
During the last decade telecommunication operators have been deploying WDM (Wavelength...
Flow assignment of a stochastic flow network with multiple node pairs
2003,
Lin Yi-Kuei
This article mainly generalizes the flow problem for a stochastic flow network from...
Finding the Kth shortest path in a time-schedule network
2005,
Tang Kwei
We consider the problem of finding the K th shortest path for a time-schedule network,...
Updating paths in time-varying networks given arc weight changes
2005,
Miller-Hooks Elise
Many transportation applications, including applications in intelligent transportation...
A multiple pairs shortest path algorithm
2005,
Johnson Ellis L.
The multiple pairs shortest path problem (MPSP) arises in many applications where the...
First Page
128
129
130
131
132
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers