Author:
Błażewicz Jacek,Ecker Klaus H.,Pesch Erwin,Schmidt Günter,Węglarz Jan
Publisher
Springer Berlin Heidelberg
Reference117 articles.
1. H. H. Ali, J. S. Deogun, A polynomial algorithm to find the jump number of interval orders, Preprint, Univ. of Nebraska Lincoln, 1990.
2. D. Adolphson, T. C. Hu, Optimal linear ordering, SIAM J. Appl. Math. 25, 1973, 403–423.
3. U. Bagchi, R. H. Ahmadi, An improved lower bound for minimizing weighted completion times with deadlines, Oper. Res. 35, 1987, 311–313.
4. S. P. Bansal, Single machine scheduling to minimize weighted sum of completion times with secondary criterion — a branch-and-bound approach, European J. Oper. Res. 5, 1980, 177–181.
5. J. Bruno, P. Downey, Complexity of task sequencing with deadlines, set-up times and changeover costs, SIAM J. Comput. 7, 1978, 393–404.