3GPP work on the Evolution of the 3G Mobile System started with the RAN Evolution Work Shop, 2 3 November 2004 in Toronto, Canada. The Work Shop was open to all interested organizations, members and non members of 3GPP. Operators, manufacturers and research institutes presented more than 40 contributions with views and proposals on the evolution of the Universal Terrestrial Radio Access Network...

The paper deals with the open-shop problems with unit-time operations and nonde-creasing symmetric objective functions depending on job completion times. We construct two schedules, one of them is optimal for any symmetric convex function, the other is optimal for any symmetric concave function. Each of these two schedules is given by an analytically deened function which assigns to each operat...

We consider a variation of the classical nonpreemptive open-shop scheduling problem. For the normal open shop, finding whether a schedule exists in T time units is NP-complete [2]. The main difference with the classical model is that we will consider so-called periodical or cyclic schedules; this means that the schedule obtained is repeated periodically. If the length of a period is k time unit...

The problem of maximizing the weighted number of just-in-time jobs in a two-machine ‡ow shop scheduling system is known to be NP-hard [4]. However, the question of whether this problem is strongly or ordinary NP-hard remains an open question. We provide a pseudo-polynomial time algorithm to solve this problem, proving that it is NP-hard in the ordinary sense. Moreover, we show how the pseudo-po...

In previous work we introduced a simple constraint model that combined generic AI strategies and techniques (weighted degree heuristic, geometric restarts, nogood learning from restarts) with naive propagation for job shop and open shop scheduling problems. Here, we extend our model to handle two variants of the job shop scheduling problem: job shop problems with setup times; and job shop probl...

We consider the open shop scheduling problem with uncertain durations modelled as fuzzy numbers. We define the concepts of necessary and possible β-robustness of schedules and set as our goal to maximise them. Additionally, we propose to assess solution robustness by means of Monte Carlo simulations. Experimental results using a genetic algorithm illustrate the proposals.

The concurrent open shop problem is a relaxation of the well known open job shop problem, where the components of a job can be processed in parallel by dedicated, component specific machines. Recently, the problem has attracted the attention of a number of researchers. In particular, Leung et al. (2005) show, contrary to the assertion in Wagneur and Sriskandarajah (1993), that the problem of mi...