We consider the problem of scheduling n jobs in a pallet-constrained two-machine flowshop so as to minimize the makespan. In such a flowshop environment, each job needs a pallet the entire time, from the start of its first operation until the completion of the last operation, and the number of...

We consider the scheduling problem of cyclic production in a bufferless dual-gripper robot cell processing a family of identical parts. The objective is to find an optimal sequence of robot moves so as to maximize the long-run average throughput rate of the cell. While there has been a...

Constant travel-time robotic cells with a single gripper robot and with one or more machines at each processing stage have been studied in the literature. By contrast, cells with a dual gripper robot, although more productive, have so far received scant attention, perhaps due to their inherent...

Interval robotic cells with several processing stages (chambers) have been increasingly used for diverse wafer fabrication processes in semi-conductor manufacturing. Processes such as low-pressure chemical vapor deposition, etching, cleaning and chemical-mechanical planarization, require strict...

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