Complexity results for single-machine problems with positive finish-start time-lags

Authors:
P. Brucker;S. Knust
Affiliations:
Univ. Osnabrück, Osnabrück, Germany;Univ. Osnabrück, Osnabrück, Germany
Venue:
Computing - Special issue on combinatorial optimization
Year:
1999

Citing 0
Cited 3

Scheduling time-constrained instructions on pipelined processors

ACM Transactions on Programming Languages and Systems (TOPLAS)
Scheduling of coupled tasks with unit processing times

Journal of Scheduling
The m-machine flowshop problem with unit-time operations and intree precedence constraints

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract