### Table 1: Complexity results for the single machine scheduling problems.

### Table 2: Complexity boundary involving single machine chain scheduling problems and the makespan

1989

"... In PAGE 8: ... These results lead naturally to the question of where is the boundary between polynomial time solvable problems and NP-complete problems. Table2 presents the known boundary for the single machine case with respect to the makespan and mean #0Dow time objective functions. Polynomial time solvable problems are denoted by a `p.... ..."

### Table 3 Input data, subcontracting, continuous problem

"... In PAGE 18: ....1.2. A Problem with 5 Families and 12 Components We consider a problem with 12 components that belong to 5 di erent fam- ilies, and f = 0:5 for all f 2 1; : : : ; q. The uncertain costs can be found in the rst part of Table3 . The fact that the scenario set depends on the decision values, and furthermore the fact that it is the cross product of the c and h space, makes it di cult to index the scenarios.... In PAGE 19: ....1.3. A Problem with 7 Families and 17 Components In this example we consider 17 components belonging to 7 di erent families. The cost coe cients and capacity requirements are those listed in Table3 , and... ..."

### Table 1. Single-Machine Problem

"... In PAGE 2: ...Consider the set of jobs shown in Table1 with the corre- sponding processing times and due dates (Salvendy 1982). Since each job has only one operation, the two terms are... ..."

### Table 13. Machine-readable sources Options and

"... In PAGE 39: ... Depending on the options and conditions you have, the source of machine-readable code differs. These sources appear in Table13 on page 32. Also, the machine-readable source should have no %NOPRINT statements, unless they relate to the problem.... ..."

### Table 3: Complexity boundary involving multiple machine chain scheduling problems and the

1989

"... In PAGE 7: ...Thus, Pmjchain;p j =1j P w j C j is strongly NP-complete. Table3 presents the known boundary involving multiple machine unit execution time chain scheduling problems and makespan, mean #0Dow time, and weighted mean #0Dow time objective func- tions. 3 Arbitrary Precedence Structured Tasks Wenow examine the complexity of several problems involving tree and prec precedence constraint topologies.... ..."

### Table 1: Performance bounds for stochastic machine scheduling problems.

2005

Cited by 9

### Table 3: Complexity results for the general parallel machine scheduling problems.

### Table 2. Single Machine Multiple Capacity Random Generated Problems

"... In PAGE 9: ... We can observe that the effect of doing the propagation procedure first does not seem to affect the heuristics. Table2 shows the execution time and number of nodes in single machine multi- capacity problems. We have two sets of problems, the set S (5x5) and the set P (6X6).... In PAGE 9: ... We can observe also that EB seems to confuse the heuristics in these kinds of problems. In fact, searching using only heuristics is better than using EB in some of the problems from Table2 . For CPMB this is not the case, because the combination of the heuristics and CPMB did not lead to bad performance.... ..."