### Table 2: Yard Map

2005

"... In PAGE 48: ...he pickup-scheduling problem for a piece of yard equipment (e.g., a yard crane) can be described as follows (Kim and Kim, 1999b; Narashimhan and Palekar, 2002): In a terminal yard, containers are classified into groups, each yard bay holding a number of containers of a number of particular groups. Table2 illustrates a yard map, that is, the distribution of containers by container group over the yard bays. It is a simplified case where each yard bay contains containers of one group only: 14 containers of group A are in yard-bay 1, 14 containers of group B are in yard-bay 2, and so on.... ..."

### 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 3b. Solution Statistics for Model 2 (Minimization)

1999

"... In PAGE 4: ...6 Table 2. Problem Statistics Model 1 Model 2 Pt Rows Cols 0/1 Vars Rows Cols 0/1 Vars 1 4398 4568 4568 4398 4568 170 2 4546 4738 4738 4546 4738 192 3 3030 3128 3128 3030 3128 98 4 2774 2921 2921 2774 2921 147 5 5732 5957 5957 5732 5957 225 6 5728 5978 5978 5728 5978 250 7 2538 2658 2658 2538 2658 120 8 3506 3695 3695 3506 3695 189 9 2616 2777 2777 2616 2777 161 10 1680 1758 1758 1680 1758 78 11 5628 5848 5848 5628 5848 220 12 3484 3644 3644 3484 3644 160 13 3700 3833 3833 3700 3833 133 14 4220 4436 4436 4220 4436 216 15 2234 2330 2330 2234 2330 96 16 3823 3949 3949 3823 3949 126 17 4222 4362 4362 4222 4362 140 18 2612 2747 2747 2612 2747 135 19 2400 2484 2484 2400 2484 84 20 2298 2406 2406 2298 2406 108 Table3 a. Solution Statistics for Model 1 (Maximization) Pt Initial First Heuristic Best Best LP Obj.... In PAGE 5: ...) list the elapsed time when the heuristic procedure is first called and the objective value corresponding to the feasible integer solution returned by the heuristic. For Table3 a, the columns Best LP Obj. and Best IP Obj.... In PAGE 5: ... report, respectively, the LP objective bound corresponding to the best node in the remaining branch-and-bound tree and the incumbent objective value corresponding to the best integer feasible solution upon termination of the solution process (10,000 CPU seconds). In Table3 b, the columns Optimal IP Obj., bb nodes, and Elapsed Time report, respectively, the optimal IP objective value, the total number of branch-and-bound tree nodes solved, and the total elapsed time for the solution process.... ..."

### Table 4: Storage Capacity of Yard Crane Designs

### Table 9: MCA of Alternative Yard Crane Designs Single

### Table 1. Schedule table The problem formulation can be stated as follows: considering a system specified as a CTG, find a mapping, a schedule table and the voltage scaling such that the deadline is satisfied and the energy consumption is minimized. The execution of a CTG can proceed along different tracks depending on the actual condition values. Our objective is to minimize the total energy consumption assuming that every track is executed with equal probability.

2003

"... In PAGE 2: ... The output of the algorithm is a schedule table which contains activation times for each task, corresponding to different values of the conditions. Table1 is an example schedule table for the CTG of Figure 1(a), assuming task mappings and task execution times as shown in the figure. The table has one row for each task, which contains start and end time for that task corresponding to different condition values.... In PAGE 3: ... Let us assume that the deadline of the system is 30ms. Figures 2(a)-(c) show the schedules of the three possible tracks through the CTG, as given in Table1 . The schedules are produced using the algorithm reported in [1], where the aim is to produce a schedule such that the worst case delay is as small as possible.... In PAGE 3: ... Each scaling region is then scaled with a certain, suitable scaling factor. Examining Table1 , it can be found that the schedules of the tasks in each column correspond to such a scaling region. However, a column of the initial schedule table has not necessarily to directly correspond to a scaling region.... ..."

Cited by 5

### Table 1. Schedule table The problem formulation can be stated as follows: considering a system specified as a CTG, find a mapping, a schedule table and the voltage scaling such that the deadline is satisfied and the energy consumption is minimized. The execution of a CTG can proceed along different tracks depending on the actual condition values. Our objective is to minimize the total energy consumption assuming that every track is executed with equal probability.

2003

"... In PAGE 2: ... The output of the algorithm is a schedule table which contains activation times for each task, corresponding to different values of the conditions. Table1 is an example schedule table for the CTG of Figure 1(a), assuming task mappings and task execution times as shown in the figure. The table has one row for each task, which contains start and end time for that task corresponding to different condition values.... In PAGE 3: ... Let us assume that the deadline of the system is 30ms. Figures 2(a)-(c) show the schedules of the three possible tracks through the CTG, as given in Table1 . The schedules are produced using the algorithm reported in [1], where the aim is to produce a schedule such that the worst case delay is as small as possible.... In PAGE 3: ... Each scaling region is then scaled with a certain, suitable scaling factor. Examining Table1 , it can be found that the schedules of the tasks in each column correspond to such a scaling region. However, a column of the initial schedule table has not necessarily to directly correspond to a scaling region.... ..."

Cited by 5

### Table 1. Energy consumption (normalized w.r.t optimal schedule) by various schedul- ing policies for different number of tasks in a taskgraph

### 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