Since the introduction of exible manufacturing systems, researchers have investigated the various planning and scheduling problems that the users of such systems are facing. Several of these problems are not encountered in more classical production settings, and so called tool mamagement...

In this paper we consider the two-machine ow shop problem with varying machine speeds. We present an algorithm which determines the optimal permutations for all machine speeds in O ( n log n ) time, where n is the number of jobs. To achieve this bound on the running time, the algorithm employs...

In this paper a typical situation arising in the assembly of printed circuit boards is investigated. The planning problem we face is how to assemble boards of different types using a single line of placement machines. From a practical viewpoint, the multiplicity of board types adds significantly...

We consider the single-item discrete lot-sizing and scheduling problem. We present a partial linear description of the convex hull of feasible solutions that solves this problem in the presence of Wagner-Whitin costs.

The minimization of the makespan of a printed circuit board assembly process is a complex problem. Decisions involved in this problem concern the specification of the order in which components are to be placed on the board, and the assignment of component types to the feeder slots of the...

In this paper we analyse limit pricing by an incumbent when faced by a multi-market entrant which can produce (subject to a constraint) in several markets simultaneously. We find that using three sizes of fixed costs, signalling occurs in even when entry cannot be deterred and that the limit...

In this paper a typical situation arising in the assembly of printed circuit boards is investigated. The planning problem we face is how to assemble boards of different types using a single line of placement machines. From a practical viewpoint, the multiplicity of board types adds significantly...

In this paper we consider the two-machine ow shop problem with varying machine speeds. We present an algorithm which determines the optimal permutations for all machine speeds in O ( n log n ) time, where n is the number of jobs. To achieve this bound on the running time, the algorithm employs...

The minimization of the makespan of a printed circuit board assembly process is a complex problem. Decisions involved in this problem concern the specification of the order in which components are to be placed on the board, and the assignment of component types to the feeder slots of the...

In this paper we analyse limit pricing by an incumbent when faced by a multi-market entrant which can produce (subject to a constraint) in several markets simultaneously. We find that using three sizes of fixed costs, signalling occurs in even when entry cannot be deterred and that the limit...