Country: United Kingdom

Found 17295 papers in total
Algorithms for Toyota's goal of sequencing mixed models on an asembly line with multiple workstations
Algorithms for Toyota's goal of sequencing mixed models on an asembly line with multiple workstations
1999,
Toyota's goal of sequencing mixed models on an assembly line is to keep the constant...
Seeking optimum project duration extensions
Seeking optimum project duration extensions
1999,
It is well-known that changes to a project's definition during the course of the...
Optimal project selection: Stochastic knapsack with finite time horizon
Optimal project selection: Stochastic knapsack with finite time horizon
1999,
A time-constrained capital-budgeting problem arises when projects, which can...
A zero–one model for project portfolio selection and scheduling
A zero–one model for project portfolio selection and scheduling
1999,
A zero–one integer linear programming model is proposed for selecting and...
Powergraph – a network-based approach to modelling and managing corporate strategic conflict and co-operation
Powergraph – a network-based approach to modelling and managing corporate strategic conflict and co-operation
1999,
Strategic relationships between companies are characterised by a combination of...
The use of resampling for estimating control chart limits
The use of resampling for estimating control chart limits
1999,
This paper proposes a resampling procedure for estimating the control limits of any...
Quality control circles – the implementation of QCC in Malaysia, its advent and success
Quality control circles – the implementation of QCC in Malaysia, its advent and success
1998,
This article describes the implementation of quality control circle (QCC) in Malaysia....
Expansion method for the throughput analysis of open finite manufacturing/queueing networks with N-policy
Expansion method for the throughput analysis of open finite manufacturing/queueing networks with N-policy
1999,
In this paper we consider arbitrary topology manufacturing (queueing) systems with...
Delays caused by a queue at a freeway exit ramp
Delays caused by a queue at a freeway exit ramp
1999,
We consider here what happens to traffic on a freeway when a queue from an exit ramp...
Queueing delay models for two-lane highway work zones
Queueing delay models for two-lane highway work zones
1999,
The paper describes the adaptation and application of queueing models to estimate...
Risk compensation – the case of road lighting
Risk compensation – the case of road lighting
1999,
The hypothesis of this article is that drivers will not adjust their behavior, i.e....
An efficient evolutionary programming algorithm
An efficient evolutionary programming algorithm
1999,
A novel evolutionary programming algorithm, which not only has a rapid convergence...
Intensification and diversification with elite tabu search solutions for the linear ordering problem
Intensification and diversification with elite tabu search solutions for the linear ordering problem
1999,
In this paper, we develop a new heuristic procedure for the linear ordering problem...
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
1999,
This paper addresses the problem of scheduling a given set of independent jobs on a...
The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine
The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine
1999,
The problem of interest is to schedule two types of jobs on a two-stage flowshop with...
One-operator–two-machine flowshop scheduling with setup and dismounting times
One-operator–two-machine flowshop scheduling with setup and dismounting times
1999,
In this paper we study the problem of scheduling n jobs in a...
The time dependent machine makespan problem is strongly NP-complete
The time dependent machine makespan problem is strongly NP-complete
1999,
The computational complexity of the problem of scheduling a set of start-time...
Parallel machine scheduling with earliness and tardiness penalties
Parallel machine scheduling with earliness and tardiness penalties
1999,
In the parallel machine scheduling problem with earliness and tardiness penalties...
A genetic algorithm for multi-level, multi-machine lot sizing and scheduling
A genetic algorithm for multi-level, multi-machine lot sizing and scheduling
1999,
This contribution introduces a mixed-integer programming formulation for the...
A new branch-and-bound approach for the n/2/flowshop/αF + βCmax flowshop scheduling problem
A new branch-and-bound approach for the n/2/flowshop/αF + βCmax flowshop scheduling problem
1999,
In this study, a special situation involving a computationally difficult flowshop...
On censored Markov chains, best augmentations and aggregation/disaggregation procedures
On censored Markov chains, best augmentations and aggregation/disaggregation procedures
1999,
Consider the stationary distribution of a Markov chain censored to a subset of the...
Exponential neighbourhood local search for the traveling salesman problem
Exponential neighbourhood local search for the traveling salesman problem
1999,
We analyse an approach to the TSP, introduced by Punnen, which is a generalization of...
Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour
Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour
1999,
A neighbourhood N ( T ) of a tour T (in the travelling salesman problem (TSP) with n...
Gilmore–Gomory type traveling salesman problems
Gilmore–Gomory type traveling salesman problems
1999,
One of the well-known, solvable cases of the traveling salesman problem (TSP) is the...
Papers per page: