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...

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...

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...

The issue of allocating capacity to accommodate emergent surgery cases while scheduling elective patients has major policy implications for Level-1 trauma centers including most large academic medical centers. This is because operating rooms (ORs) are the greatest source of revenues for...