Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Country: Netherlands
Found
18376 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
A modelling study of the effects of continuous incremental improvement in the case of a process shop
1998,
Chandrashekar Ashok
Today's extremely competitive markets demand that businesses emphasize continuous...
Lead time selection and the behaviour of work flow in job shops
1998,
Enns S.T.
Few studies in job shop scheduling consider dynamic shop load and work flow issues....
Robust responses to climate change via stochastic MARKAL: The case of Québec
1998,
Loulou Richard
Future patterns of climate change and economic growth are critical parameters in...
A capacity allocation problem with integer side constraints
1998,
Uzsoy Reha
We address a capacity allocation problem arising as a subproblem of an artificial...
A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
1998,
Elmaghraby Salah E.
We treat a problem of scheduling n jobs on a three stages hybrid flowshop of...
Hesitant adaptive search for global optimisation
1998,
Wood G.R.
Pure adaptive search is a stochastic algorithm which has been analysed in distinct...
Analysis of the temporal decomposition procedure for scheduling with release and due dates
1998,
Rabenasolo Besoa
This paper first presents an improved method of temporal decomposition for minimising...
A simulation-based approach to two-stage stochastic programming with recourse
1998,
Shapiro Alexander
In this paper we consider stochastic programming problems where the objective function...
Flowshop scheduling with identical jobs and uniform parallel machines
1998,
Dessouky Maged M.
The single-stage scheduling problem to minimize the makespan of identical jobs on...
Optimal streaming of a single job in a two-stage flow shop
1998,
Sen Alper
Lot streaming is moving some portion of a process batch ahead to begin a downstream...
Infeasibility analysis for systems of quadratic convex inequalities
1998,
Obuchowska Wieslawa T.
In this paper we address the problem of the infeasibility of systems defined by...
Heuristics for the flow line problem with setup costs
1998,
Bard Jonathan F.
This paper presents two new heuristics for the flowshop scheduling problem with...
Approximating the independence number via the ϑ-function
1998,
Alon Noga
We describe an approximation algorithm for the independence number of a graph. If a...
The course scheduling problem at Lufthansa Technical Training
1998,
Haase Knut
Lufthansa Technical Training GmbH (LTT) performs training courses for Lufthansa...
A unified analysis for a class of long-step primal–dual path-following interior-point algorithms for semidefinite programming
1998,
Monteiro Renato D.C.
We present a unified analysis for a class of long-step primal–dual...
Note on a sufficient condition for a local minimum of a class of nonconvex quadratic programs
1998,
Scheimberg Susana
A counterexample is given to show that a previously proposed sufficient condition for...
The use of nested hulls in the symmetric traveller problem
1998,
Brimberg Jack
Many heuristic algorithms for solving geometric traveller problems utilize the extreme...
An empirical study of a new metaheuristic for the traveling salesman problem
1998,
Evans James R.
We present a deceptively simple, yet empirically powerful metaheuristic, called jump...
New edges not used in shortest tours of travelling salesman problems
1998,
Sakakibara Katsuaki
For the symmetric travelling salesman problem in an Euclidian plane, a geometrical...
Minimum directed 1-subtree relaxation for score orienteering problem
1998,
Kataoka Seiji
Score orienteering is a variant of the orienteering game where competitors start at a...
Relaxed tours and path ejections for the traveling salesman problem
1998,
Rego Csar
We describe an edge based ejection chain method to generate compound neighborhood...
A tabu search heuristic for the undirected selective travelling salesman problem
1998,
Laporte Gilbert
The undirected Selective Travelling Salesman Problem (STSP) is defined on a graph G =...
A new Markovian description of the M/G/1 retrial queue
1998,
Falin G.
This article deals with a new Markovian description of the M/G/1 retrial queue. We...
Weak k-majorization and polyhedra
1998,
Dahl Geir
For integers k and n with k ⩽ n a vector x ∈ ℝ n is said to be weakly k...
First Page
464
465
466
467
468
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers