Journal: European Journal of Operational Research

Found 7937 papers in total
An interactive approach for vector optimization problems
1996,
This paper deals with an interactive approach for vector optimization problems. The...
Using aspiration levels in an interactive interior multiobjective linear programming algorithm
1996,
In this paper, we propose the use of an interior-point linear programming algorithm...
Using approximate gradients in developing an interactive interior primal–dual multiobjective linear programming algorithm
1996,
We present a new interactive multiobjective linear programming algorithm that is based...
Statistical quality control and improvement
1996,
Quality has become a key determinant of success in all aspects of modern industry,...
Comparative studies in interactive multiple objective mathematical programming
1996,
In the past two decades, there has been a significant increase in the number of...
InterQuad: An interactive quad tree based procedure for solving the discrete alternative multiple criteria problem
1996,
In this paper an interactive procedure based upon a data structure called a quad tree...
Implied constraints and an alternate unified development of nonlinear programming theory
1996,
This paper offers an alternate unified view of nonlinear programming theory from the...
Analysis of a synchronization station for the performance evaluation of a kanban system with a general arrival process of demands
1996,
The kanban system has attracted wide interest in recent years, and a lot of work has...
Pseudo-invexity and duality in nonlinear programming
1996,
The purpose of this paper is to study various duality results in nonlinear programming...
On the M/G/1 machine interference model with spares
1996,
In this paper a recursive method is developed to obtain the steady state probability...
The management of congestion
1996,
The term ‘congestion’ conjures up a variety of undesirable memories of...
A lot sizing model with queueing delays: The issue of safety time
1996,
The objective of this paper is to introduce the concept of safety time in a...
LP relaxation of the two dimensional knapsack problem with box and GUB constraints
1996,
In the present paper we derive an O( n 2 log n ) algorithm for the linear programming...
Optimal access control for broadband services: Stochastic knapsack with advance information
1996,
Suppose that call reservation requests of K different types arrive randomly at a...
Scheduling problems with repetitive projects: A comparison of a simulated annealing, a genetic and pair-wise swap algorithm
1996,
We address the problem of scheduling in programs involving the production of multiple...
A simulated annealing and tabu search mixture algorithm for the scheduling tardiness problem
1996,
In the daily activity of workshops the problem of minimizing delay in dispatching is...
SIMPSON: An intelligent assistant for short-term manufacturing scheduling
1996,
In this paper, we describe the process by which we modeled day-to-day scheduling...
Setting planned lead times for multi-operation jobs
1996,
This paper deals with the problem of how to assign planned lead times for...
Scheduling about a given common due date to minimize mean squared deviation of completion times
1996,
In this paper the problem of minimizing the mean squared deviation (MSDP) of job...
Scheduling jobs with different, job-dependent earliness and tardiness penalties using the Slack Time (SLK) method
1996,
The single machine job scheduling problem, where due dates are assigned using the SLK...
A dominant subset of V-shaped sequences for a class of single machine sequencing problems
1996,
In this note we define a subset of V-shaped sequences, ‘V-shaped about T...
A strategy for evolution of algorithms to increase the computational effectiveness of NP-hard scheduling problems
1996,
We explored a method of applying techniques of inductive learning from artificial...
Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine
1996,
In this paper we propose a hybrid branch and bound algorithm for solving the problem...
Papers per page: