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

Online retailers utilize lateral transshipment to meet the immediate shortage of demand at one location from surplus at another location within their retailing network. One option to reduce such potentially expensive transshipment is to hold additional safety stock at each location. We...

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 minimizing makespan in a two-machine job shop with unit processing time operations. An efficient algorithm with respect to a succinct encoding of the problem instances is proposed. The algorithm is an improvement of earlier algorithms proposed for the problem by Brucker [...

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