Lowe Timothy J.

Timothy J. Lowe

Information about the author Timothy J. Lowe will soon be added to the site.
Found 25 papers in total
The p-hub center allocation problem
The p-hub center allocation problem
2007
The p -hub center problem is to locate p hubs and to allocate non-hub nodes to hub...
Upgrading arcs to minimize the maximum travel time in a network
Upgrading arcs to minimize the maximum travel time in a network
2006
In transportation and telecommunication systems, the performance of the underlying...
Managing the seed-corn supply chain at Syngenta
Managing the seed-corn supply chain at Syngenta
2003
Each year, Syngenta Seeds, Inc. produces over 50 seed-corn hybrids and the following...
An improved lower bound for the multimedian location problem
An improved lower bound for the multimedian location problem
2002
We consider the problem of locating, on a network, n new facilities that interact with...
Matching supply and demand: The value of a second chance in producing hybrid seed corn
Matching supply and demand: The value of a second chance in producing hybrid seed corn
2001
This paper considers a production-scheduling problem arising when there are random...
Selection and sequencing heuristics to reduce variance in gas turbine engine nozzle assemblies
Selection and sequencing heuristics to reduce variance in gas turbine engine nozzle assemblies
2001
During the maintenance of gas turbine engines, the selection and placement of nozzle...
Dynamic economic lot size models with period-pair-dependent backorders and inventory costs
Dynamic economic lot size models with period-pair-dependent backorders and inventory costs
2001
Inventory and backorder cost functions in the classical Wagner–Whitin economic...
On the location of a tree-shaped facility
On the location of a tree-shaped facility
1996
This paper considers the problem of locating a central facility on a tree network. The...
Structured p-facility location problems on the line solvable in polynomial time
Structured p-facility location problems on the line solvable in polynomial time
1997
In this paper we give an O ( pn 2 ) algorithm for solving the p -facility location...
The Selection Allocation Problem
The Selection Allocation Problem
1999
The Selection Allocation Problem (SAP) is a single period decision problem which...
Capacitated selection problem
Capacitated selection problem
1999
Optimizing the selection of resources to accomplish a set of tasks involves evaluating...
Solving a selected class of location problems by exploiting problem structure: A decomposition approach
Solving a selected class of location problems by exploiting problem structure: A decomposition approach
1998
For many combinatorial optimization problems that are NP-hard, a number of special...
Specially structured uncapacitated facility location problems
Specially structured uncapacitated facility location problems
1995
This paper considers a specially structured uncapacitated facility location problem....
Error-bound driven demand point aggregation for the rectilinear distance p-center model
Error-bound driven demand point aggregation for the rectilinear distance p-center model
1996
We present an algorithm for aggregating demand points for the rectilinear distance p...
An O(nm) algorithm for a special case of the multimedian location problem on a tree
An O(nm) algorithm for a special case of the multimedian location problem on a tree
1992
The multimedian location problem on a connected network G is concerned with locating m...
On the equivalence of dual methods for two location problems
On the equivalence of dual methods for two location problems
1993
Separate algorithms have been reported in the literature to find dual solutions to the...
Flow network design for manufacturing systems layout
Flow network design for manufacturing systems layout
1992
One way to solve a facilities layout planning problem is to use a component approach;...
On worst-case aggregation analysis for network location problems
On worst-case aggregation analysis for network location problems
1993
Network location problems occur when new facilities must be located on a network, and...
Dominance and decomposition heuristics for single machine scheduling
Dominance and decomposition heuristics for single machine scheduling
1991
New heuristic dominance rules and a flexible decomposition heuristic are developed for...
Locating facilities which interact: Some solvable cases
Locating facilities which interact: Some solvable cases
1993
The network version of the m- median problem with mutual communication is to find the...
m-Median and m-center problems with mutual communication: Solvable special cases
m-Median and m-center problems with mutual communication: Solvable special cases
1992
In this paper, the authors consider the network version of the m- median problem with...
Rationalizing tool selection in a flexible manufacturing system for sheet-metal products
Rationalizing tool selection in a flexible manufacturing system for sheet-metal products
1990
Substantial simplification of existing processes and designs may be required before...
Locating a median subtree on a network
Locating a median subtree on a network
1991
This paper concerns the problem of locating a central facility on a connected,...
Locating an absolute center on graphs that are almost trees
Locating an absolute center on graphs that are almost trees
1990
Physical models that exhibit a treelike graph structure frequently arise in...
Papers per page: