We establish the computational complexity of the problem of minimizing makespan in a flowshop, where each jobs requires a pallet the entire time, from the start of its first operation until the completion of the last operation. We prove that the problem is NP-hard in the strong sense for m =2...

We study the problem of scheduling a chain-reentrant shop, in which each job goes for its processing first to a machine called the primary machine, then to a number of other machines in a fixed sequence, and finally back to the primary machine for its last operation. The problem is to schedule...

Scheduling methods are proposed for a class of flexible manufacturing systems consisting of machine centers served by a cyclic conveyor. The minimization of finish time is considered as the optimization criterion. An optimal algorithm is proposed for the minimum conveyor speed (S = 1) for a...

Semiconductor manufacturing performed on expensive machines requires repetitive use of several similar processing operations. Owing to economic considerations, these expensive machines are always shared among many products or a product at different stages of its manufacturing process. The...

In many manufacturing systems, parts must be fed to automatic machines in a specific orientation. This is often accomplished by what are known as part-orienting systems (POSs). A POS consists of one or more separate devices that orient parts, usually with multiple orientations. A theoretical...

We develop a genetic algorithm (GA) for a real-life problem of scheduling of the golf-club-head injection process performed on a set of parallel machines. In our study, the orders for club heads are usually requested by sets with certain due dates and can be shipped only if they are complete....

We investigate the impact of the process of manufacturing and distribution on the safety stock levels in a supply chain. A pipeline hedging method is used to derive a model for estimating the safety stock levels. We propose methods and guidelines to redesign the manufacturing and distribution...

We optimize a large country's currency supply network for its central bank. The central bank provides currency to all branches (who in turn serve consumers and commerce) through its network of big vaults, regional vaults, and retail vaults. The central bank intends to reduce its total...

Job shop scheduling with a bank of machines in parallel is important from both theoretical and practical points of review. Here we focus on a flexible job shop scheduling problem of minimizing the makespan in a two-center job shop, where the first center consists of one machine and the second...