next up previous
Up: Scheduling Previous: Scheduling

References

1
E. Azhanarok, V. Gordon, and F. Werner, Single Machine Preemptive Scheduling with Special Cost Functions, Optimization 34 (1995), 271 - 286.

2
H. Bräsel, D. Kluge, and F. Werner, A Polynomial Algorithm for the $[n/m/O,t_{ij}=1,\mbox{tree}/C_{max}]$ Open Shop Problem, European Journal of Operational Research 72 (1994), 125 - 134.

3
H. Bräsel, D. Kluge, and F. Werner, A Polynomial Algorithm for an Open Shop Problem with Unit Processing Times and Tree Constraints, Discrete Applied Mathematics 59 (1995), 11 - 21.

4
H. Bräsel, D. Kluge, and F. Werner, Polynomial Time Algorithms for Special Open Shop Problems with Unit Processing Times and Precedence Constraints, RAIRO Operations Research 30 (1996), 65 - 79.

5
H. Bräsel, Y.N. Sotskov, and F. Werner, Stability of a Schedule Minimizing Mean Flow Time, Mathematical and Computer Modelling 24 (1996), No. 10, 39 - 56.

6
P. Brucker, J. Hurink, and F. Werner, Improving Local Search Heuristics for Some Scheduling Problems, Discrete Applied Mathematics 65 (1996), 97 - 122.

7
P. Brucker, P.; J. Hurink, and F. Werner, Improving Local Search Heuristics for Some Scheduling Problems. Part II, Discrete Applied Mathematics 72 (1997), 47 - 69.

8
P. Brucker, M.Y. Kovalyov, Y.M. Shafransky, and F. Werner, Parallel Machine Deadline Batch Scheduling, Annals of Operations Research 83 (1998), 23 - 40.

9
D. Danneberg, T. Tautenhahn, and F. Werner A Comparison of Heuristic Algorithms for Flow Shop Scheduling Problems with Batch Setup Times and Limited Batch Size, Preprint 52/97 Otto-von-Guericke-Universität Magdeburg, FMA (1997), to appear in Mathematical and Computer Modelling.

10
V.S. Gordon, E. Potapneva, and F. Werner, Single Machine scheduling with Deadlines, Release and Due Dates, Optimization 42 (1997), 219 - 244.

11
V.S. Gordon, F. Werner, and O.A. Yanushkevich, Single Machine Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release and Due Date Intervals, Preprint 46/97, Otto-von-Guericke-Universität Magdeburg, FMA (1997).

12
J.N.D. Gupta, K. Krüger, V. Lauff, Y.N. Sotskov, and F. Werner, Constructive and Iterative Heuristics for Shop Scheduling Problems with Controllable Processing Times and Due Dates, Preprint 29/98, Otto-von-Guericke-Universität Magdeburg, FMA, 1998.

13
J.N.D. Gupta, V.R. Nepalli, and F. Werner, Minimizing Total Flow Time in a Two-Machine Flowshop Problem with Minimum Makespan, Preprint 21/97, Otto-von-Guericke-Universität Magdeburg, FMA (1997).

14
M.Y. Kovalyov, and F. Werner, A Polynomial Approximation Scheme for Problem F2/rj/Cmax, Operations Research Letters 20 (1997), 75 - 79.

15
S.A. Kravchenko, Y.N. Sotskov, and F. Werner, Optimal Schedules with Infinitely Large Stability Radius, Optimization 33 (1995), 271 - 280.

16
S.V. Kravchenko, and F. Werner, On Parallel Machine Problems with a Single Server, Mathematical and Computer Modelling 26 (1997), No. 12, 1 - 11.

17
S.A. Kravchenko, and F. Werner, Parallel Machine Scheduling with Servers, Preprint 30/98, Otto-von-Guericke-Universität Magdeburg, FMA (1998).

18
K. Krüger, N. Shakhlevich, Y.N. Sotskov, and F. Werner, A Decomposition Algorithm for Scheduling Problems on Mixed Graphs, Journal of the Operational Research Society 46 (1995), 1481 - 1497.

19
K. Krüger, Y.N. Sotskov, and F. Werner, Heuristics for Generalized Shop Scheduling Problems Based on Decomposition, International Journal of Production Research 36 (1998), No. 11, 3013 - 3033.

20
T.C. Lai, Y.N. Sotskov, N.Y. Sotskova, and F. Werner, Optimal Makespan Scheduling with Uncertainty in the Given Processing Times, Mathematical and Computer Modelling 26 (1997), No. 3, 67 - 86.

21
T.C. Lai, Y.N. Sotskov, N.Y. Sotskova, and F. Werner, Mean Flow Time Minimization with Uncertain Processing Times, Otto-von-Guericke-Universität Magdeburg, FMA, Preprint 15/98 (1998).

22
N. Shakhlevich, Y.N. Sotskov, and F. Werner, An Adaptive Algorithm for Minimizing the Makespan by Means of the Mixed Graph Model, IEE Proceedings on Control Theory and Applications 143 (1996), 9 - 16.

23
N.V. Shakhlevich, Y.N. Sotskov, and F. Werner, Shop-Scheduling Problems with Fixed and Non-Fixed Machine Orders of the Jobs, Preprint 14/97, Otto-von-Guericke-Universität Magdeburg, FMA (1997), to appear in Annals of Operations Research.

24
N.V. Shakhlevich, Y.N. Sotskov, and F. Werner, Complexity of Mixed Shop Scheduling problems: a Survey, Preprint 43/97, Otto-von-Guericke-Universität Magdeburg, FMA (1997), to appear in European Journal of Operational Research.

25
Y.N. Sotskov, N.Y. Sotskova, and F. Werner Stability of an Optimal Schedule in a Job Shop, OMEGA 25 (1997), 397- 414.

26
Y.N. Sotskov, V.S. Tanaev, and F. Werner, On the Stability Radius of an Optimal Schedule: a Survey and Recent Developments, in: Industrial Applications of Combinatorial Optimization, Kluwer Academic Publishers, 16, Boston, MA (1998), 72 - 108.

27
Y.N. Sotskov, V.S. Tanaev, and F. Werner, Scheduling Problems and Mixed Graph Colorings, Preprint 38/98, Otto-von-Guericke-Universität Magdeburg (1998).

28
Y.N. Sotskov, T. Tautenhahn, and F. Werner, Heuristics for Permutation Flow Shop Scheduling with Batch Setup Times, OR Spektrum 18 (1996), 67 - 80.

29
Y.N. Sotskov, T. Tautenhahn, F. Werner, On the Application of Insertion Techniques for Job Shop Problems with Setup Times, Preprint 4/96, Otto-von-Guericke-Universität Magdeburg, FMA (1996) to appear in RAIRO Operations Research.

30
Y.N. Sotskov, A.P.M. Wagelmans, and F. Werner, On the Calculation of the Stability Radius of an Optimal or an Approximate Schedule, Annals of Operations Research83 (1998), 213 - 252.

31
F. Werner, and A. Winkler, Insertion Techniques for the Heuristic Solution of the Job Shop Problem, Discrete Applied Mathematics 58 (1995), 191 - 211.


Hugo
2/11/1999