Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Journal: Computers and Operations Research
Found
2748 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Delivering complex decision rules to top level managers through decision support systems: A case study in army housing management
1998,
Forgionne Guisseppi A.
Mathematical or heuristic programming can be used to solve a particular allocation...
Crew scheduling of light rail transit in Hong Kong: From modeling to implementation
1998,
Chu Sydney C.K.
This work concerns the problem of crew scheduling for the Hong Kong Light Rail Transit...
Covering a graph with cycles
1998,
Laporte Gilbert
This article describes a lower bounding procedure and heuristics for the Cycle Cover...
Spectral methods for graph bisection problems
1998,
Tu Chih-Chien
In this paper, we study the spectral methods for graph bisection problems and conclude...
The minimal deceptive problem revisited: The role of ‘genetic waste’
1998,
Novkovic Sonja
Using Goldberg's minimal deceptive problem, we devise a simple method for setting the...
A local search template
1998,
Lenstra J.K.
A template is presented that captures a vast majority of the local search algorithms...
On the robust shortest path problem
1998,
Yu Gang
The shortest path (SP) problem in a network with nonnegative arc lengths can be solved...
Minimum time paths in a network with mixed time constraints
1998,
Chen Y.L.
The time-constrained shortest path problem is an important generalization of the...
On the sum–max bicriterion path problem
1998,
Pelegrn B.
In this paper, we study a special class of bicriterion path problems where the...
Least possible time paths in stochastic, time-varying networks
1998,
Mahmassani Hani S.
In this paper, two computationally efficient algorithms are presented for determining...
An enhanced response surface methodology (RSM) algorithm using gradient deflection and second-order search strategies
1998,
Sherali Hanif D.
This paper attempts to improve the search techniques being currently used in standard...
A new lower bounding scheme for the total weighted tardiness problem
1998,
Akturk M. Selim
We propose a new dominance rule that provides a sufficient condition for local...
Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups
1998,
Bard Jonathan F.
This paper presents a branch-and-cut (B&C) algorithm for the problem of minimizing...
Learning complementarity and setup time reduction
1998,
Pratsini Eleni
This article studies the effects of transmission of learning in setups for the...
A composite heuristic for the single machine early/tardy job scheduling problem
1998,
Almeida Maria Teresa
The single machine early/tardy job scheduling problem (SMETP) is an NP-hard problem...
Total flowtime in no-wait flowshops with separated setup times
1998,
Allahverdi Ali
This paper addresses the two-machine no-wait flowshop problem where the setup time of...
A new approximation algorithm for unit execution time scheduling with chain-type precedence constraints
1998,
Han Jiye
In this paper a new approximation algorithm with worst case performance ratio 3/2 is...
Probabilistic load scheduling with priorities in distributed computing systems
1998,
Ghose D.
In this paper a distributed computing system/network in which two types of loads (or...
An efficient two-phase algorithm for cyclic days-off scheduling
1998,
Alfares Hesham K.
An efficient two-phase algorithm is presented for solving the cyclic manpower days-off...
RTSS: An interactive decision support system for solving real time scheduling problems considering customer and job priorities with schedule interruptions
1998,
Banerjee Avijit
Traditional research on dynamic job shop scheduling (DJSS) is largely based on...
A design of self-healing ATM networks based on backup virtual paths
1998,
Lee Chae Y.
We propose a design of self-healing ATM virtual path (VP) networks based on backup VP....
Designing tributary networks with multiple ring families
1998,
Luss Hanan
A common architecture for a telecommunications network consists of several tributary...
An analysis of the number of tasks in a parallel multi-processor system with task-splitting and feedback
1998,
Haghighi Aliakbar Montazer
In this paper we have analyzed a parallel multi-processor system with task-splitting...
HOPE: A genetic algorithm for the unequal area facility layout problem
1998,
Heragu Sunderesh S.
In this paper we outline a Genetic Algorithm (GA) based algorithm for solving the...
First Page
81
82
83
84
85
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers