Country: United States

Found 17049 papers in total
Sequencing of parts in robotic cells
Sequencing of parts in robotic cells
1997,
This paper considers scheduling problems in robotic cells that produce a set of part...
Interval coverage in multiclass queues using batch mean estimates
Interval coverage in multiclass queues using batch mean estimates
1996,
We investigate the fixed, sample-size, batch-mean procedure for creating confidence...
The lagged PSA for estimating peak congestion in multiserver Markovian queues with periodic arrival rates
The lagged PSA for estimating peak congestion in multiserver Markovian queues with periodic arrival rates
1997,
We propose using a modification of the simple peak hour approximation (SPHA) for...
On the quantitative Steinitz theorem in the plane
On the quantitative Steinitz theorem in the plane
1997,
We prove that for any k ≥ 4, any set X of points in the plane, and any point P...
Polytopes and the mean value property
Polytopes and the mean value property
1997,
Let P be any (not necessarily convex nor connected) solid polytope in the n...
Lower bound on testing membership to a polyhedron by algebraic decision and computation trees
Lower bound on testing membership to a polyhedron by algebraic decision and computation trees
1997,
We introduce a new method of proving lower bounds on the depth of algebraic d -degree...
Extremal properties of 0/1-polytopes
Extremal properties of 0/1-polytopes
1997,
We provide lower and upper bounds for the maximal number of facets of a d -dimensional...
Heuristic, optimal, static, and dynamic schedules when processing times are uncertain
Heuristic, optimal, static, and dynamic schedules when processing times are uncertain
1997,
In this paper we compare the static and dynamic application of heuristic and optimal...
A branch and bound procedure for the resource constrained project scheduling problem with discounted cash flows
A branch and bound procedure for the resource constrained project scheduling problem with discounted cash flows
1996,
Management of projects is complicated by the scarcity of resources required to execute...
Heuristics for multimachine scheduling problems with earliness and tardiness costs
Heuristics for multimachine scheduling problems with earliness and tardiness costs
1996,
We consider multimachine scheduling problems with earliness and tardiness costs. We...
Remarks on: ‘Some extensions of the discrete lotsizing and scheduling problem’
Remarks on: ‘Some extensions of the discrete lotsizing and scheduling problem’
1997,
Salomon et al. claim the NP-completeness of different variants of the discrete...
Scheduling workforce and workflow in a high volume factory
Scheduling workforce and workflow in a high volume factory
1997,
We define a high volume factory to be a connected network of workstations, at which...
Efficient methods for sequencing minimum job sets on mixed model assembly lines
Efficient methods for sequencing minimum job sets on mixed model assembly lines
1997,
For sequencing different models on a paced assembly line, the commonly accepted...
Mixed-model assembly line sequencing at Hyundai Motor Company
Mixed-model assembly line sequencing at Hyundai Motor Company
1996,
In this article we describe and illustrate the mixed-model sequencing approach used by...
Integrating the planning and scheduling systems in a job shop
Integrating the planning and scheduling systems in a job shop
1996,
This article is an examination of work-load smoothing and due-date assignment...
A practical application of a multi-project scheduling heuristic
A practical application of a multi-project scheduling heuristic
1996,
This article is a review of the development and application of a multi-project...
Lower bounds for off-line range searching
Lower bounds for off-line range searching
1997,
This paper proves three lower bounds for variants of the following range-searching...
A stochastic version of a Stackelberg–Nash–Cournot equilibrium model
A stochastic version of a Stackelberg–Nash–Cournot equilibrium model
1997,
We consider a stochastic version of the Stackelberg–Nash–Cournot model...
An object-oriented modeling and simulation environment for reactive systems development
An object-oriented modeling and simulation environment for reactive systems development
1997,
An environment to support the modeling, analysis, simulation, and development of state...
Considerations in applying dynamic-programming filters to the smoothing of noisy data
Considerations in applying dynamic-programming filters to the smoothing of noisy data
1994,
Dynamic programming techniques are useful in smoothing and differentiating noisy data...
Routing in packet-switched communication networks with different criticality classes of communicating node pairs
Routing in packet-switched communication networks with different criticality classes of communicating node pairs
1997,
This paper addresses the routing problem with reliability requirements in...
Microsoft Secrets: How the World's most Powerful Software Company Creates Technology, Shapes Markets, and Manages People
Microsoft Secrets: How the World's most Powerful Software Company Creates Technology, Shapes Markets, and Manages People
1997,
Network externalities in microcomputer software: An econometric analysis of the spreadsheet market
Network externalities in microcomputer software: An econometric analysis of the spreadsheet market
1996,
Because of network externalities, the success of a software product may depend in part...
Network and Discrete Location Models, Algorithms and Applications
Network and Discrete Location Models, Algorithms and Applications
1997,
Papers per page: