### Table 1 An illustration of a quay crane schedule Quay Crane 1 Quay Crane 2

"... In PAGE 1: ... For instance, there are ten holds in a container vessel, and two quay cranes are allocated to handle the container vessel. Table1 illustrates a feasible quay crane schedule for this instance. It shows the handling sequence of holds for every quay crane, the processing time of each hold and the time schedule for handling every hold.... ..."

### Table 3: Effect of quay crane rate on waiting time and late jobs.

2005

"... In PAGE 22: ...er hour. The yard crane rate is set to 24 containers per hour. Each AGV is assumed to travel at an uniform speed. Table3 displays the simulation results obtained for this problem. For the quay Table 3: Effect of quay crane rate on waiting time and late jobs.... ..."

Cited by 1

### Table 2: Linear model estimation

2006

"... In PAGE 9: ...Computational experience (MIPLIB instances) 3 OUR METHOD Table2 compares the size of the measurement tree obtained by the linear model with the actual number of nodes in T. The last column shows the ratio between the two.... ..."

Cited by 2

### Table 1. Experimental results on a set of 10 10 benchmark problems. In a second experiment we examined whether we can compete with other algorithms. A set of 3000 10 10 job shop scheduling problems was generated and solved with a schedule construction algorithm based on constraint logic programming (CLP) known to produce good solutions [3]. Each of the 27 available variable ordering heuristics was applied and the best schedule obtained was compared with the solution generated by our algorithm. We made two runs, one with the parameters and proven to be the best to solve the ft10 benchmark problem and a second modi ed run, additionally allowing repetitions based on random re-initializations after self-organizing has failed.

1999

"... In PAGE 5: ... We varied the makespan reduction value as well as the parameter . Table1 summarizes the results, showing the best and average makespan obtained and the known optimum for each problem. Each run took about 9 seconds on a 233MHz i686 PC, the best schedule usually emerged after half the time.... ..."

Cited by 2

### Table 4: the constraint algorithm solves problems up to 30 nodes.

1997

Cited by 30

### Table 4: the constraint algorithm solves problems up to 30 nodes.

### Table 3: pseudo code for SORP solve(SvcSchedule, C, Overflow Set)

1999

"... In PAGE 19: ... VW IS2 IS9 IS8 IS7 IS5 IS6 IS4 IS1 IS3 1:00 2:00 4:00 3:00 5:00 7:00 8:00 6:00 : Duration of the file stay ( Storage Cost) : Transfer of the file ( Network Cost) Figure 9: Service schedule of a file 5.3 Storage Overflow Resolution Algorithm Algorithm in Table3 depicts the skeleton algorithm for storage overflow resolution problem. SORP solve() in Table 3 takes service schedule S, information about intermediate storages, which includes the overflow sets, storage usage information, and storage capacity as input.... In PAGE 19: ...3 Storage Overflow Resolution Algorithm Algorithm in Table 3 depicts the skeleton algorithm for storage overflow resolution problem. SORP solve() in Table3 takes service schedule S, information about intermediate storages, which includes the overflow sets, storage usage information, and storage capacity as input. Network rate nrate and storage rate srate are globally available.... In PAGE 21: ... The ultimate objective in the Storage Overflow Resolution phase is to minimize Cost. For each iteration of the outermost while loop (line 7 - 28) of SORP solve() in Table3 , SORP solve examines all residency information ci which it is involved in one of the overflows. SORP solve() computes the new service schedule for the respective video file Snew idi ( t; ISj) for file idi in ci and computes the effective improvement of the rescheduling.... In PAGE 22: ...re provided in Sec. 6. 5.4 Reflective Greedy Heuristic The rescheduling algorithm reflective greedy() in line 18 of Table3 receives a tuple (ci; t; ISj) as an input. It reschedules the file idi of ci with the constraint that there is no space available during t at ISj.... ..."

Cited by 3

### Table 8: Constraint solving process in the Scheduling problem on Reals Ch.P. C

"... In PAGE 29: ...Table8 . Two choice points are introduced as consequence of the disjunctive constraints (_).... ..."

### Table 8: Constraint solving process in the Scheduling problem on Reals Ch.P. C

"... In PAGE 29: ...Table8 . Two choice points are introduced as consequence of the disjunctive constraints (_).... ..."

### Table 6: Lagrangean algorithm and CPLEX results - Instance set III

"... In PAGE 17: ... Actually, the largest instances of this set overestimate the size of real cellular networks. Table6 reports the results of the Lagrangean algorithm and CPLEX. The meaning of each column is the same previously defined for table 2.... ..."