# Information Processing Letters

Information Processing Letters > 1995 > 54 > 3 > 139-145

Information Processing Letters > 1995 > 54 > 3 > 179-185

Information Processing Letters > 1995 > 54 > 3 > 175-178

_{m}

_{a}

_{x}criterion is considered. Job processing times are described by increasing linear functions depending on the starting times of the jobs. Two polynomial-time algorithms for finding an optimal schedule are given.

Information Processing Letters > 1995 > 54 > 3 > 163-168

Information Processing Letters > 1995 > 54 > 3 > 129-131

Information Processing Letters > 1995 > 54 > 3 > 155-156

Information Processing Letters > 1995 > 54 > 4 > 205-211

Information Processing Letters > 1995 > 54 > 4 > 187-191

Information Processing Letters > 1995 > 54 > 4 > 229-233

Information Processing Letters > 1995 > 54 > 4 > 199-204

^{2}lETOL) where we require that in each derivation step, k different productions from the selected table have to be applied (if possible). We show that this subtle change leads to a new characterization of programmed grammars (without appearance checking), a result which is still unknown for the originally defined kulETOL...

Information Processing Letters > 1995 > 54 > 4 > 193-198

^{2}) algorithm and generates the two threshold components. The algorithm can be easily adapted to recognize 2-threshold graphs with exactly three cutpoints.

Information Processing Letters > 1995 > 54 > 4 > 235-239

Information Processing Letters > 1995 > 54 > 4 > 241-246

Information Processing Letters > 1995 > 54 > 4 > 213-222

Information Processing Letters > 1995 > 54 > 5 > 301-304