Journal: INFOR

Found 387 papers in total
A computational study of a new heuristic for the site-dependent vehicle routing problem
1999,
In the site-dependent vehicle routing problem, a fleet of heterogeneous vehicles...
Using rules to specify classification strategies in the credit card industry
1999,
Classifying accounts is a critical part of efficiently servicing credit cards. The use...
Reactive grasp and tabu search based heuristics for the single source capacitated plant location problem
1999,
This paper considers the Single Source Capacitated Plant Location Problem (SSCPLP)....
A neural heuristic for the Multisource Weber Problem
1999,
The Multisource Weber Problem consists of finding the location of α facilities...
A decision framework for nonsymmetric losses
1999,
This paper presents a case study of an application of decision analysis to the...
Distance-based classification methods
1999,
Given a set of points in a Euclidean space, and a partitioning of this ‘training...
Municipal solid waste collection: An effective data structure for solving the sectorization problem with local search methods
1999,
This paper deals with the crucial sectorization problems regarding household waste...
Tabu search with exact neighbour evaluation for multicommodity location with balancing requirements
1999,
In this paper, we present a tabu search heuristic for solving the multicommodity...
Lagranian decomposition based heuristic for the generalized assignment problem
1999,
This paper defines a new Lagrangian heuristic for the generalized assignment problem...
A note on the uniqueness of solutions to the transportation problem
1999,
Let μ and ν be two probability measures on the real line and c be a lower...
Computational evaluation of a transformation procedure for the symmetric generalized traveling salesman problem
1999,
This note proposes a transformation of the Generalized Traveling Salesman Problem on...
Flow shop no-wait scheduling with sequence dependent setup times and release dates
1999,
We consider the problem of scheduling no-wait jobs, with release dates and sequence...
On a conjecture about robotic cells: New simplified proof for the three-machine case
1999,
We consider a robotic cell, consisting of a flow-shop in which the machines are served...
Compact scheduling in open shop with zero–one time operations
1999,
A problem of no-wait scheduling of zero–one time operations in an open shop...
Waiting time distribution of a FIFO/LIFO Geo/D/1 queue
1999,
We consider a Geo/D/1 queue operating under a hybrid FIFO/LIFO discipline and obtain...
A 7/6-approximation algorithm for 3-partitioning and its application to multiprocessor scheduling
1999,
The optimization version of the classical 3-partitioning problem is considered. 3 m...
Some results on scheduling flat trees in LogP model
1999,
This paper deals with the problem of scheduling a flat tree in the Log P model. A flat...
Avoiding run-time infeasibility in systems containing coupled tasks
1999,
This paper investigates the problem of guaranteeing stability and run-time feasibility...
Discrete lot streaming in two-machine flow shops
1999,
Lot streaming is the process of splitting a job or lot to allow overlapping between...
Infeasibility of super-efficiency data envelopment analysis models
1999,
The paper investigates the infeasibility of super-efficiency data envelopment analysis...
A mixed integer nonlinear program for oilfield production planning
1999,
A multi-period model, the Oil Production Optimization Program, has been developed as a...
Assessing aggregate cost efficiency and the related policy implications for Greek local municipalities
1998,
The assessment of local government performance is a major issue for a number of...
Variation in inefficiency among US hospitals
1998,
This study analyzes the impact of policy variables and other factors on hospital...
An index approach for the measurement of patient benefits from surgery – illustrated in the case of cataract extraction
1998,
An issue of growing interest within the field of measurement of efficiency in health...
Papers per page: