In this paper we will consider a one-machine batching problem which is a combination of a sequencing and a partitioning problem. We will develop an exponential neighborhood for this problem which can be evaluated in quadratic time using shortest path calculations. Results of a computational study are reported.

The effect of time bucket length on the choice of a lot-splitting approach is studied. Due to the continuing pressure to reduce throughput times and increase efficiency, managers apply various measures, such as lot splitting and cycle time reduction programmes, that change the length of the time bucket in their planning systems. It is shown that the choice for a suitable lot-splitting approach ...

We are designing an operating system based on Inferno, which central­ izes everything on a machine we call the PC. Terminals connect to it through the internet to export local devices and viewers and programs wrapped in Styx file servers. The problem this approach faces is that Styx behaves badly for high latency links, no matter what the bandwidth is because of the RPC round-trip time accumula...

This paper studies a general two-stage scheduling problem, in which jobs of different importance are processed by one first-stage processor and then, in the second stage, the completed jobs need to be batch delivered to various pre-specified destinations in one of a number of available transportation modes. Our objective is to minimize the sum of weighted job delivery time and total transportat...

Although the supply chain management literature is extensive, the benefits and challenges of coordinated decision making within supply chain scheduling models have not been studied. We consider a variety of scheduling, batching and delivery problems that arise in an arborescent supply chain where a supplier makes deliveries to several manufacturers, who also make deliveries to customers. The ob...