Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Journal: Annals of Operations Research
Found
3339 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Two issues in setting call centre staffing levels
2001,
Henderson Shane G.
Motivated by a problem facing the Police Communication Centre in Auckland, New...
An integrated optimization model for train crew management
2001,
Ernst A.T.
Train crew management involves the development of a duty timetable for each of the...
Elastic constraint branching, the Wedelin/Carmen Lagrangian heuristic and integer programming for personnel scheduling
2001,
Mason Andrew J.
The Wedelin algorithm is a Lagrangian based heuristic that is being successfully used...
Supply chain optimisation in the paper industry
2001,
Philpott Andrew
We describe the formulation and development of a supply-chain optimisation model for...
Minimizing weighted number of early and tardy jobs with a common due window involving location penalty
2001,
Cheng T.C. Edwin
This paper studies a single machine scheduling problem to minimize the weighted number...
Project scheduling under time dependent costs – a branch and bound algorithm
2001,
Achuthan N.R.
In a given project network, execution of each activity in normal duration requires...
An operations research approach to the problem of the sugarcane selection
2001,
Calija Vanja
Selection for superior clones is the most important aspect of sugarcane improvement...
Cane railway scheduling via constraint logic programming: Labelling order and constraints in a real-life application
2001,
Martin Fae
In Australia, cane transport is the largest unit cost in the manufacturing of raw...
A column generation approach to delivery planning over time with inhomogeneous service providers and service interval constraints
2001,
Boland N.
We consider a problem of delivery planning over multiple time periods. Deliveries must...
Operational decisions in automated guided vehicles-served flowshop loops: Scheduling
2001,
Hall Nicholas G.
This paper considers operational issues that arise in repetitive manufacturing systems...
Operational decisions in AGV-served flowshop loops: Fleet sizing and decomposition
2001,
Hall Nicholas G.
This paper considers design and operational issues that arise in repetitive...
Short-term capacity adjustment with offline production for a flexible manufacturing system under abnormal disturbances
2001,
Matta Renato de
Large production variations caused by abnormal disturbances can significantly reduce...
Set-up coordination between two stages of a supply chain
2001,
Agnetis A.
In the material flow of a plant, parts are processed in batches, each having two...
Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times
2001,
Zhou Hong
The importance of job shop scheduling as a practical problem has attracted the...
Preemptive scheduling with two minimax criteria
2001,
Sourd Francis
Two preemptive single-machine bicriteria scheduling problems with release dates and...
Discrete cost multicommodity network optimization problems and exact solution methods
2001,
Minoux Michel
We first introduce a generic model for discrete cost multicommodity network...
An augmented arborescence formulation for the two-level network design problem
2001,
Gouveia Luis
In this paper we discuss formulations for the Two Level Network Design (TLND) problem....
On cost allocation in hub-like networks
2001,
Skorin-Kapov Darko
We consider telecommunication network design in which each pair of nodes can...
Topological design of survivable mesh-based transport networks
2001,
Grover Wayne D.
The advent of Sonet and DWDM mesh-restorable networks which contain explicit...
Constraint generation for network reliability problems
2001,
Shaio Jack
This paper presents a constraint generation approach to the network reliability...
Hop constrained network design problem with partial survivability
2001,
Soni Samit
This paper studies the hop constrained network design problem with partial...
Approximation algorithms for pick-and-place robots
2001,
Srivastav Anand
In this paper we study the problem of finding placement tours for pick-and-place...
Telecommunication link restoration planning with multiple facility types
2001,
Balakrishnan Anantaram
To ensure uninterrupted service, telecommunication networks contain excess (spare)...
Node placement and sizing for copper broadband access networks
2001,
Shallcross David
We consider a node placement and sizing problem that arises in certain types of...
First Page
68
69
70
71
72
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers