| | |
 |
Veröffentlichungen seit 1990
Andresen, M.; Bräsel, H.; Plauschin, M.; Werner, F.:
Using Simulated Annealing for Open Shop Scheduling with Sum Criteria,
in Cher Ming Tan (ed.): Simulated Annealing, In-Teh, 2008, 49 - 76 (open access book,
ISBN 978-953-7619-07-7,
download)
Andresen, M.; Bräsel, H.; Mörig, M.; Tusch, J.; Werner, F., Willenius, P.:
Simulated Annealing and Genetic Algorithms for Minimizing Mean Flow Time in an Open Shop,
Mathematical and Computer Modelling, Vol. 48, 2008, 1279 - 1293
H. Bräsel:
Matrices in Shop Scheduling Problems; in: Perspectives on Operations Research -
Essays in Honor of Klaus Neumann, herausgegeben von: M. Morlock, C. Schwindt, N.Trautmann und J. Zimmermann;
Gabler Edition Wissenschaft, Deutscher Universitätsverlag, Wiesbaden, (2006), 17-43
H. Bräsel, A. Herms, M. Mörig, T. Tautenhahn, J.Tusch, F.Werner:
Heuristic Algorithms for Open Shop Scheduling to Minimize Mean Flow Time;
Fakultät für Mathematik, Otto-von-Guericke Universität Magdeburg, Preprint Nr. 30 (2005),
zur Veröffentlichung eingereicht
H. Bräsel, H. Hennes:
On the open-shop problem with preemption and minimizing the average completion time; European Journal of Operational Research 157 (2004), 607-619
H. Bräsel, L. Dornheim, S. Kutz, M. Mörig, I. Rössling:
LiSA - A Library of Scheduling Algorithms; Fakultät für Mathematik, Otto-von-Guericke Universität Magdeburg, Preprint Nr. 34 (2003), zur Veröffentlichung eingereicht
H. Bräsel, T. N. Dhamala:
On the Decomposition of the Super-Sequence Group Fakultät für Mathematik, Otto-von-Guericke Universität Magdeburg (2002), zur Veröffentlichung eingereicht
H. Bräsel, M. Harborth, P. Willenius:
Isomorphism for digraphs and sequences of shop scheduling
problems; J. Combin. Math. Combin. Comput. 37 (2001), 115-128
H. Bräsel, M. Harborth, T. Tautenhahn, P. Willenius:
On the Hardness of the Classical Job Shop Problem;
Annals of Operations Research 92 (1999), 265-279
H. Bräsel, M. Harborth, T. Tautenhahn, P. Willenius: On the Set of Solutions of an Open Shop Problem;
Annals of Operations Research 92 (1999), 241-263
H. Bräsel, F. Werner (Gasteditoren): Models and Algorithms for Planning and Scheduling Problems; Annals of Operations Research,
Vol.83 (1998)
H. Bräsel, N. Shakhlevich: On the solution region for certain scheduling problems with preemption;
Annals of Operations Research 83 (1998), 1-21
H. Bräsel, Y. N. Sotskov, F. Werner: Stability of a schedule minimizing mean flow time;
Mathematical and Computer Modelling, Vol.24 (1996), 39-56
H. Bräsel, D. Kluge, F. Werner: Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times;
RAIRO Operations Research, Vol.30, N 1 (1996), 65-79
H. Bräsel, D. Kluge, F. Werner: A polynomial algorithm for an open shop problem with unit processing times and tree constraints;
Discrete Applied Mathematics, Vol.59, number 1 (1995), 11-21
H. Bräsel, D. Kluge, F. Werner: A polynomial algorithm for the n|m|O,t_ij=1,tree|C_max open-shop problem;
European Journal of Operational Research 72 (1994), 125-134
H. Bräsel, T. Tautenhahn, F. Werner: Heuristic constructive algorithms for the
n|m|O|C_max problem;
Computing 51 (1993) 95-110
H. Bräsel, M. Kleinau: On the number of feasible schedules of the open-shop-problem - an application of special latin rectangles:
Optimization (1992), Vol.23, 251-260
H. Bräsel, M. Kleinau: On number problems for the open shop problem;
Proceedings of the 15. IFIP Conference, Zwich, Switzerland, Springer Verlag (1992), 145-154
H. Bräsel, F. Werner: The job-shop problem - modelling by latin rectangles, exact and heuristic solution;
Proceedings of the 14. IFIP Conference, Leipzig, GDR, Lecture Notes Control Inf. Sci. 143 (1990), 456-465
|
| | |
| |
Preprints (soweit nicht eingereicht)
H. Bräsel, E. Girlich; 15. Workshop on Discrete Optimization;
Fakultät für Mathematik, Otto-von-Guericke Universität, Magdeburg, Preprint Nr.12 (2002)
H. Bräsel, T.N. Dhamala: On Algebraic Properties in Shop-Scheduling Problems;
Fakultät für Mathematik, Otto-von-Guericke Universität, Magdeburg, Preprint Nr.8 (2001)
H. Bräsel, T.N. Dhamala: On Algebraic Structures in Shop-Scheduling Problems:
The Super-Sequence Group; Fakultät für Mathematik, Otto-von-Guericke Universität, Magdeburg, Preprint Nr.15 (2000)
H. Bräsel, V. Hadwich: On the Complexity of Line-Distinguishing-Coloring
of Simple Graphs;
Fakultät für Mathematik, Otto-von-Guericke Universität, Magdeburg, Preprint Nr.5 (1996)
|
| | |
|
