Alan J. Soper

Learn More
Graph partitioning divides a graph into several pieces by cutting edges. The graph partitioning problem is to divide so that the number of vertices in each piece is the same within some defined tolerance and the number of cut edges separating these pieces is minimised. Important examples of the problem arise in partitioning graphs known as meshes for the(More)
1. We have studied the characteristics of the abnormal properties of damaged myelinated fibers (conduction velocity > 2.0 m/ s) after peripheral nerve injury in a novel in vitro model of the rat sciatic nerve/dorsal root ganglion/dorsal root (L4-5) preparation removed from control naíve or sham-operated rats and animals that had received sciatic neurectomy(More)
Graph partitioning divides a graph into several pieces by cutting edges. The graph partitioning problem is to divide so that the number of vertices in each piece is the same within some defined tolerance and the number of cut edges separating these pieces is minimised. Important examples of the problem arise in partitioning graphs known as meshes for the(More)
We study the two-machine flow shop problem with an uncapacitated interstage transporter. The jobs have to be split into batches, and upon completion on the first machine, each batch has to be shipped to the second machine by a transporter. The best known heuristic for the problem is a |—approximation algorithm that outputs a two-shipment schedule. We design(More)
We consider a scheduling problem on two identical parallel machines, in which the jobs are moved between the machines by an uncapacitated transporter. In the processing preemption is allowed. The objective is to minimize the time by which all completed jobs are collected together on board the transporter. We identify the structural patterns of an optimal(More)