Country: Canada

Found 531 papers in total
Business Process Reengineering in the small firm: A case study
1996,
Although there is no universal methodology for business process reengineering (BPR), a...
Dynamic modelling for re-engineering organizations
1996,
Dynamics is an essential characteristic of our society and of organizations. The...
Culture-sensitive, strategy-level reengineering
1996,
The application of business process reengineering (BPR) in organizations has met with...
A new methodology for Business Process Re-engineering
1995,
This paper describes a new methodology for Buinsess Process Reeningeering. It builds...
Reengineering business processes: A complexity theory approach to value added
1995,
Today, there is no objective, countable way to measure value added by component...
Requirements for successful reengineering
1995,
During the 1990s, reengineering has become the preferred method of introducing major...
An approach to business process reengineering: The contribution of socio-technical and soft or concepts
1995,
Current thinking on business process reingineering (BPR) is evaluated in the context...
Cross-evaluation in DEA: Improving discrimination among DMUs
1995,
There is a need to distinguish among efficient DMUs in Data Envelopment Analysis...
Decision support systems for dangerous goods transportation
1995,
This paper describes three information and decision support systems for the...
Sensitivity of optimal hazmat routes to limited preference specification
1995,
The authors show that a multi-attribute utility (MAU) formulation of the single...
Service and inventory level implications of a particular simple method of establishing the reorder point
1995,
In a consulting study for a major North American distributor it was observed that the...
A stability concept for zero-one knapsack problems and approximation algorithms
1995,
The concept of reducing the feasible range of decision variables or fixing the value...
The inspection station location problem in hazardous material transportation: Some heuristics and bounds
1995,
To enforce rules regarding hazardous material transportation, regulating agencies need...
Turning the tables: Using location science to specify technology rather than allowing technology to constrain location: A commentary
1995,
In this commentary, the authors advocate the use of location models to assess or even...
Approximate analysis of bulk closed queueing networks
1995,
The paper presents an approximate analysis of closed queueing networks where batch...
An evolutionary tabu search algorithm and the National Hockey League scheduling problem
1995,
This paper presents a new evolutionary procedure for solving general optimization...
Linear versus nonlinear models for hazmat routing
1995,
Two models for hazardous routing are briefly described. A condition is derived which,...
Performance of two heuristics for solving large scale two-dimensional guillotine cutting problems
1995,
The two dimensional cutting problem consists of cutting a rectangular plate into...
Location of stabilised waste storage facilities: The case of Francophone Switzerland
1995,
The search for sites to locate stabilised special waste storage facilities (SWSF)...
A simple and quick approximation algorithm for tandem, split and merge queueing networks with blocking
1994,
A simple and quick approximation algorithm for the analysis of tandem, split and merge...
A multiobjective model for locating solid waste transfer facilities using an empirical opposition function
1995,
Solid waste transfer stations (SWTS) are facilities where municipal refuse is...
Risk-based transportation planning practice: Overall methodology and a case example
1995,
We are faced with various types of risks in our everyday lives and continue to be...
A multiple route conditional risk model for transporting hazardous materials
1995,
This paper considers the problem of developing effective routes for transporting...
Some experiences on solving multiconstraint zero-one knapsack problems with genetic algorithms
1994,
In the multiconstraint zero-one knapsack problem one has to decide on how to make...
Papers per page: