Country: United Kingdom

Found 17295 papers in total
Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated
2004,
This paper addresses the m -machine no-wait flowshop problem where the set-up time of...
Receiver set partitioning and sequencing for multicasting traffic in a wavelength division multiplexing lightwave single-hop network
2004,
This paper considers a receiver set partitioning and sequencing problem in a...
A priority list based heuristic for the job shop problem: part 2 tabu search
2004,
Following a recent paper by the same author, a priority list-based tabu search...
Employee scheduling and makespan minimization in a flow shop with multi-processor work stations: a case study
2004,
This paper describes the development of a mixed integer linear programming model for a...
Job scheduling with dual criteria and sequence-dependent setups: mathematical versus genetic programming
2004,
Flexibility, speed, and efficiency are major challenges for operations managers in...
An empirical analysis of integer programming formulations for the permutation flowshop
2004,
An empirical analysis was conducted to assess the relative effectiveness of four...
Real-time schedule adjustment decisions: a case study
2004,
Service capacity management has been extensively studied and successfully applied in...
New heuristics for m-machine no-wait flowshop to minimize total completion time
2004,
This paper presents several new heuristics for the m -machines no-wait flowshop with...
Scheduling two-component products on parallel machines
2004,
We consider a scheduling problem in which N products are processed on M identical...
Impact of process change on customer perception of waiting time: a field study
2004,
Studies in process change have focused on the improvement of operational performance...
Integrated logistics planning for the air and space expeditionary force
2004,
The shift to a US Air Force structured for expeditionary operations has presented the...
A single-stage supply chain system controlled by kanban under just-in-time philosophy
2004,
The production system using kanban was pioneered by Toyota Motor Company in Japan and...
Parallel discrete event simulation algorithm for manufacturing supply chains
2004,
Parallel discrete event simulation (PDES) is concerned with the distributed execution...
How many suppliers are best? A decision-analysis approach
2004,
As more supply chains are becoming dependent upon suppliers, an interruption of supply...
The impact of supplier development on buyer–supplier performance
2004,
In recent years, many companies have come to recognize the crucial role that...
Early supplier involvement in the design process: lessons from the electronics industry
2004,
The movement of activities earlier in the product development process, necessitates a...
Supply chain coordination with demand disruptions
2004,
The purpose of this paper is to investigate a one-supplier–one-retailer supply...
Win–win situations in supply chain partnerships: a tutorial – sharing the gain
2000,
Supply Chain Management (SCM) is one of the key issues, trends and needs in the...
Supply-chain optimisation – players, tools and issues
2001,
This paper starts by describing a study that was undertaken to assess the state of the...
Flexible versus fixed timetabling: a case study
2004,
This case study presents the timetabling problem of the Flight Training Department at...
A Java™ universal vehicle router for routing unmanned aerial vehicles
2004,
We consider vehicle routing problems in the context of the Air Force operational...
Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
2004,
This note introduces a refinement to a previously proposed tabu search algorithm for...
Tabu-search simulation optimisation approach for flowshop scheduling with multiple processors – a case study
2004,
The flowshop with multiple processors (FSMP) environment is relatively common and has...
Vehicle routing in the 1-skip collection problem
2004,
In this paper, we consider a real problem, which we call the 1-skip collection...
Papers per page: