Für eine korrekte Darstellung dieser Seite benötigen Sie einen XHTML-standardkonformen Browser, der die Darstellung von CSS-Dateien zulässt.

..
Suche
Erweiterte Suche

Personensuche
Veranstaltungssuche
Katalog der UB Siegen

Papers in Journals and Books

Papers in Journals and Books

  • A characterization of absolute retracts of n-chromatic graphs. Discrete Mathematics 57 (1985), 99-104, (with W. Poguntke).
  • Minimal extensions of graphs to absolute retracts. Journal of Graph Theory 11 (1987), 585- 598.
  • Products of absolute retracts. Discrete Mathematics 69 (1988), 179-188.
  • A Radon theorem for Helly graphs. Archiv Math. 52 (1989), 95-98, (with H.-J. Bandelt).
  • Dismantling absolute retracts of reflexive graphs. European Journal of Combinatorics 10 (1989), 211-220, (with H.-J. Bandelt).
  • Efficient characterizations of n-chromatic absolute retracts. Journal of Combinatorial Theory, Ser. B 53 (1991), 5-31, (with H.-J. Bandelt).
  • Genetic local search algorithms for the traveling salesman problem. Lecture Notes in Computer Science 496 (1991), 109-116, (with E.H.L. Aarts, H.-J. Bandelt, P.J.M. van Laarhoven and N.L.J. Ulder).
  • Batch scheduling on parallel units in acrylic-glass production. ZOR - Zeitschrift Operations Research 35 (today MMOR) 35 (1991), 321-345, (with H. Friedrich, J. Keßler and B. Schildt).
  • Competitive location on a network. European Journal of Operational Research 66 (1993), 372- 391, (with A. Bauer and W. Domschke).
  • Genetic local search in combinatorial optimization. Discrete Applied Mathematics 48 (1994), 273-284, (with A. Kolen).
  • Fast clustering algorithms. ORSA Journal on Computing 6 (1994), 141-153, (with U. Dorndorf).
  • Einlastungsstrategien in der Werkstattfertigung, (H. Isermann, ed.). Logistik, Verlag Moderne Industrie (1994), 281-295.
  • Modellbasierte Inferenz in CHARME. OR Spektrum 16 (1994), 193-202, (with A. Drexl and A. Kolen).
  • Evolution based learning in a job shop scheduling environment. Computers & Operations Research 22 (1995), 25-40, (with U. Dorndorf).
  • Local search in combinatorial optimization. Lecture Notes in Computer Science 931 (1995), 157-174, (with Y. Crama and A. Kolen).
  • Strategies with memories: local search in an application-oriented environment. OR Spektrum 17 (1995), 55-66, (with S. Voß).
  • Zur Bedeutung der Modellbildung für die Entwicklung wissensbasierter Systeme. Zeitschrift für Betriebswirtschaft 65 (1995), 1135-1153, (with A. Drexl and F. Salewski).
  • Auftragsterminierung für die taktisch-operative Personaleinsatzplanung in Wirtschaftsprüfungsgesellschaften. Zeitschrift für Betriebswirtschaft 66 (1996), 327-351, (with T. Bartsch and F. Salewski).
  • Constraint propagation based scheduling of job shops. INFORMS Journal on Computing 8 (1996), 144-157, (with U. Tetzlaff).
  • The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research 93 (1996), 1-33, (with J. Blazewicz and W. Domschke).
  • TSP ejection chains. Discrete Applied Mathematics 76 (1997), 165-181, (with F. Glover).
  • A branch and bound algorithm for the job shop scheduling problem, (A. Drexl and A. Kimms, eds.). Beyond Manufacturing Resource Planning (MRP II), Springer Verlag, Berlin (1998), 219-254 (with J. Blazewicz and M. Sterna).
  • Einlastungsstrategien in der Werkstattfertigung, (H. Isermann, ed.). Logistik, 2. Aufl., Verlag Moderne Industrie (1998), 353-367.
  • Lokale Suchverfahren zur Projektplanung bei beschränkten Ressourcen. Künstliche Intelligenz 4/98 (1998), 25-32, (with U. Dorndorf, A. Drexl and T. Phan Huy).
  • Resource-constrained project scheduling: notation, classification, models, and methods. European Journal of Operational Research 112 (1999), 3-41, (with P. Bruckner, A. Drexl, R. Möhring and K. Neumann).
  • Efficient facility layout planning in a maximally planar graph model. International Journal of Production Research 37 (1999) 263-283, (with F. Glover, T. Bartsch, F. Salewski and I. Osman).
  • A note on disjunctive graph representation. Bulletin of the Polish Academy of Sciences 47 (1999), 103-114, (with J. Blazewicz and M. Sterna).
  • Optimal workload allocation between a job shop and a flexible manufacturing system. IEEE Transactions on Robotics and Automation 15 (1999), 20-32, (with U. Tetzlaff).
  • Lower bounds in different problem classes of project schedules with resource constraints, (J. Weglarz, ed.). Project Scheduling - Recent Models, Algorithms and Applications, Kluwer Academic Publ., (1999), 53-76.
  • A survey of interval capacity consistency tests for Time- and Resource Constrained Scheduling, (J. Weglarz, ed.). Project Scheduling - Recent Models, Algorithms and Applications, Kluwer Academic Publ., (1999), 213-238, (with U. Dorndorf and T. Phan Huy).
  • Finanzinnovationen und Debt-Equity-Swaps. Betriebswirtschaftliche Forschung und Praxis 6/99 (1999), 671-682, (with J. Hiltrop).
  • Ansatz für eine neue rechnergestützte Personaleinsatzplanung bei Feuerwehren. Brandschutz Deutsche Feuerwehr-Zeitung 53 (1999), 955-960, (with T. Beier and R. Schmiedel).
  • The disjunctive graph machine representation of the job shop scheduling problem. European Journal of Operational Research 127 (2000), 317-331 (with J. Blazewicz and M. Sterna).
  • Constraint propagation techniques for disjunctive scheduling problems. Artificial Intelligence 122 (2000), 189-240, (with U. Dorndorf and T. Phan Huy).
  • A branch and bound algorithm for the resource-constrained project scheduling problem. ZOR-Mathematical Methods in Operations Research 52 (2000), 413-439, (with U. Dorndorf and T. Phan Huy).
  • Einige grundlegende Fragen zu Finanzinnovationen - Finanzinnovationen im Rahmen der Innovationstheorie. WISU - Das Wirtschaftsstudium 11/00 (2000), 1480-1483, (with J. Hiltrop).
  • A time-oriented branch-and-bound algorithm for resource constrained project scheduling with generalised precedence constraints. Management Science 46 (2000), 1365-1384, (with U. Dorndorf and T. Phan Huy).
  • Solving the open shop scheduling problem. Journal of Scheduling 4 (2001), 157-174, (with U. Dorndorf and T. Phan Huy).
  • Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem. Annals of Operations Research 115 (2002), 125-145, (with U. Dorndorf and T. Phan Huy).
  • Machine learning by schedule decomposition - Prospects for an integration of AI and OR techniques for job shop scheduling, (A. Ghosh, S. Tsutsui, eds.). Advances in Evolutionary Computation, Springer, (2003), 773-798, (with U. Dorndorf and T. Phan Huy).
  • Data Warehouses, (J. Blazewicz, W. Kubiak, T. Morzy, M. Rusinkiewicz, eds.). Handbook on Data Management in Information Systems, Springer, (2003), 387-430 (with U. Dorndorf).
  • Open shop scheduling problems with late work criteria. Discrete Applied Mathematics 134 (2004), 1-24, (with J. Blazewicz, M. Sterna and F. Werner).
  • Flow shop scheduling with late work criterion - choosing the best solution strategy. Lecture Notes in Computer Science 3285 (2004), 68-75, (with J. Blazewicz, M. Sterna and F. Werner).
  • A novel representation of graph structures in web mining and data analysis. Omega, The International Journal of Management Science 33 (2005), 65-71, (with J. Blazewicz and M. Sterna).
  • Logistics: From Theory to Application. European Journal of Operational Research 162 (2005), 1-3, (with S. Martello).
  • A review of exact solution methods for the non-preemptive multiprocessor flow shop problem. European Journal of Operational Research 164 (2005), 592-608 (with T. Kis).
  • The two-machine flow-shop problem with weighted late work criterion and common due date, European Journal of Operational Research 165 (2005), 408-415, (with J. Blazewicz, M. Sterna and F. Werner).
  • Metaheuristics for late work minimization in two‑machine flow shops with common due date. Lecture Notes in Artificial Intelligence 3698 (2005), 222-234, (with J. Blazewicz, M. Sterna and F. Werner).
  • Scheduling personnel for press machines in the automotive industry. Pacific Journal on Optimization 1 (2005), 545-564, (with U. Tetzlaff).
  • A comparison of solution procedures for the flow shop scheduling with late work criterion. Computers & Industrial Engineering 49 (2005), 611-624, (with J. Blazewicz, M. Sterna and F. Werner).
  • A fully polynomial time approximation scheme for the single-item capacitated economic lot-sizing problem with general cost structure. Mathematical Programming 106 (2006), 453-466, (with S. Chubanov and M. Kovalyov).
  • A note on the two-machine job shop with the weighted late work criterion. Journal of Scheduling 10 (2007), 87-95, (with J. Blazewicz, M. Sterna and F. Werner).
  • Flight gate scheduling: state-of-the-art and recent developments. Omega - The International Journal of Management Science 35 (2007), 326-334, (with U. Dorndorf, A. Drexl and Y. Nikulin).
  • Disruption management in flight gate scheduling. Statistica Neerlandica 61 (2007), 92-114, (with U. Dorndorf, F. Jaehn, C. Lin and H. Ma).
  • Metaheuristic approaches for two-machine flow-shop problems with weighted late work criterion and common due date, Computers & Operations Research 35 (2008), 574-599, (with J. Blazewicz, M. Sterna and F. Werner).
  • A single-item economic lotsizing problem with a non-uniform resource: approximation. European Journal of Operational Research 189 (2008), 877-889, (with S. Chubanov and M. Kovalyov).
  • Analysis, modelling and solution of the concrete delivery problem. European Journal of Operational Research 193 (2009), 820-835, (with L. Asbach and U. Dorndorf).
  • Modelling robust flight-gate scheduling as a clique partitioning problem. Transportation Science 42 (2008), 292-301, (with U. Dorndorf and F. Jaehn).
  • Lernen, Constraint Propagation und Sudokus, WISU-Das Wirtschaftsstudium 8-9/08 (2008), 1186-1193, (with T. Phan Huy).
  • Clustering of Web search results, Information Technology and Intelligent Computing 3 (2008), (with S. Lieberam-Schmidt).
  • Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities, Mathematical Methods of Operations Research (MMOR), (with S. Chubanov).
  • Late work minimization in flow shops by a genetic algorithm, Computers & Industrial Engineering 57 (2009), 1202-1209, (with M. Sterna).
  • Scheduling freight trains in rail-rail transshipment yards, Transportation Science (with N. Boysen and F. Jaehn), (to appear).
  • Flight gate scheduling with respect to a reference schedule, Annals of Operations Research, (with U. Dorndorf and F. Jaehn), (to appear).
  • A generic approach to proving NP-hardness of partition type problems, Discrete Applied Mathematics 158 (2010), 1908-1912, (with M.Y. Kovalyov).
  • New bounds and algorithms for the Transshipment Yard Scheduling Problem, Journal of Scheduling (with N. Boysen and F. Jaehn), (to appear).
  • Sequential competitive location on networks, European Journal of Operational Research (2012), 483-499, (with D. Kress).


Aktualisiert via XIMS am 28.11.2011 von R. Eifler