Narrow Results

We study a preemptive scheduling problem on two identical parallel machines that share a common server. Each job has to be loaded by the server before being processed on one of the machines and unloaded by the server after its processing. The loading and unloading times are both equal to one time unit. The goal is to minimize the makespan. We propose a O(n log n) solution algorithm for the preemptive variant of the problem.

FMC (Fixed and Mobile convergence) is the development trend of telecommunication. How to realize the handover between the WiFi domain and GSM domain is one of the key problems of FMC. This paper not only describes the basic call model of WiFi-GSM in WiFi and GSM network, but also gives the VOIP and IN(intelligence network) technique to realize the handover between GSM and WiFi network.