Country: United Kingdom

Found 17295 papers in total
A queuing model for designing an optimal three-dimensional maintenance float system
1997,
In this paper, the authors consider a float system that consists of a single...
Using lexicographic parametric programming for searching a non-dominated set in multiple-objective linear programming
1996,
This paper proposes an approach which makes it possible to search non-dominated and...
Analysis of an asymmetric polling system
1997,
Polling models are used extensively in the field of operations research to analyze the...
Utility functions: A compromise programming approach to specification and optimization
1997,
Nowadays, utility theory and compromise programming (CP) are considered very different...
On the determination of minimal facets and edges of a polyhedral set
1997,
This paper investigates the image of a polyhedral set under a linear map. Moreover, it...
An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points
1997,
A new algorithm for addressing multiple objective linear programming (MOLP) problems...
Convergence of stochastic algorithms: From the Kushner-Clark theorem to the Lyapounov functional method
1996,
In the first part of this paper a global Kushner-Clark theorem about the convergence...
A class of single machine central tendency-dispersion bicriteria problems
1996,
In this paper, a number of non-regular bicriteria penalty functions of completion...
A note on the relation between the product rate variation problem and the apportionment problem
1996,
This note establishes a connection between two problems that appear in different...
On the undiscounted tax problem with precedence constraints
1996,
A single machine is available to process a collection of jobs J, each of which evolves...
New insights on the single machine total tardiness problem
1997,
Virtually all algorithmic studies on the single machine total tardiness problem use...
Single facility scheduling with major and minor setups
1997,
This article considers the problem of scheduling a given set of jobs at a single...
A fast finite loading algorithm for job oriented scheduling
1997,
Job oriented scheduling (JOS) has been the most commonly used technique in actual job...
Using tabu search to solve the common due date early/tardy machine scheduling problem
1997,
This article uses tabu search to solve the restricted, common-due-date, early/tardy...
On steady-state queue size distributions of the discrete-time GI/G/1 queue
1996,
In this paper, the authors present results for the steady-state system length...
Dynamic routing and jockeying controls in a two-station queueing system
1996,
This paper studies optimal routing and jockeying policies in a two-station parallel...
The throughput rate of interchangeable parallel two-stage tandem queue with correlated service times
1997,
A parallel two-stage tandem queueing system with no intermediate waiting room is...
M(n)/G1/N queues with generalized vacations
1997,
The authors consider M/G/1/N queues with generalized vacations and exhaustive service,...
Simulation and optimization of a new waste remediation process
1996,
In the development of large scale technologically advanced projects and procedures, it...
The efficiency distribution approach in data envelopment analysis: An application
1996,
A method is developed here for characterizing the empirical distribution of the...
Measuring the efficiency of prescribing by general practitioners
1996,
Data envelopment analysis (a mathematical programming technique) has often been...
Some mathematical properties of a DEA model for the joint determination of efficiencies
1997,
This paper explores the Karush-Kuhn-Tucker conditions and convexity issues in a...
Searching for targets who want to be found
1997,
The paper reports some simulation results for models of the types of search that might...
A managerial assessment of the waiting-time performance for alternative service process designs
1996,
The paper develops an analytical model and, by applying it to a set of service process...
Papers per page: