Günter Schmidt

Marcus Pirron

RAIRO Oper. Res., 2021

2019

Optimal online algorithms for the portfolio selection problem, bi-directional trading and -search with interrelated prices.

[BibT_eX]

[DOI]

Pascal Schroeder

Imed Kacem

RAIRO Oper. Res., 2019

2018

Optimal solutions for the online time series search and one-way trading problem with interrelated prices and a profit function.

[BibT_eX]

[DOI]

Pascal Schroeder

Robert Dochow

Comput. Ind. Eng., 2018

2017

Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines.

[BibT_eX]

[DOI]

Imed Kacem

Myriam Sahnoune

RAIRO Oper. Res., 2017

Competitive analysis of bi-directional non-preemptive conversion.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

2016

Automated Credit Rating Prediction in a competitive framework.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2016

Optimal on-line algorithms for bi-directional non-preemptive conversion with interrelated conversion rates.

[BibT_eX]

[DOI]

Pascal Schroeder

Imed Kacem

Proceedings of the International Conference on Control, 2016

2014

SVDD: A proposal for automated credit rating prediction.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Control, 2014

2013

A Comparative Study of Heuristic Conversion Algorithms, Genetic Programming and Return Predictability on the German Market.

[BibT_eX]

[DOI]

Sebastian Jansen

Proceedings of the EVOLVE, 2013

How much is it worth to know the future in online conversion problems?

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Risk-Adjusted On-line Portfolio Selection.

[BibT_eX]

[DOI]

Robert Dochow

Proceedings of the Operations Research Proceedings 2013, 2013

How (in)efficient is after-hours trading?

[BibT_eX]

[DOI]

Aistis Raudys

Proceedings of the 2013 IEEE Conference on Computational Intelligence for Financial Engineering & Economics, 2013

2012

Can online trading algorithms beat the market? An experimental evaluation.

[BibT_eX]

[DOI]

Javeria Iqbal

Proceedings of the 3rd Student Conference on Operational Research, 2012

Competitive Ratio as Coherent Measure of Risk.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2012, 2012

An Experimental Analysis of Online Unidirectional Conversion Problem.

[BibT_eX]

[DOI]

Proceedings of the E-Commerce and Web Technologies - 13th International Conference, 2012

Dynamic Adaptive Algorithm Selection: Profit Maximization for Online Trading.

[BibT_eX]

[DOI]

Javeria Iqbal

Proceedings of the Business Information Systems - 15th International Conference, 2012

2010

Lot-Size Planning with Non-Linear Cost Functions Supporting Environmental Sustainability.

[BibT_eX]

[DOI]

Markus Heck

Int. J. Green Comput., 2010

Experimental Analysis of an Online Trading Algorithm.

[BibT_eX]

[DOI]

Mike Kersch

Electron. Notes Discret. Math., 2010

2008

Empirical Analysis of an Online Algorithm for Multiple Trading Problems.

[BibT_eX]

[DOI]

Proceedings of the Modelling, 2008

Industrialized Generation of Financial Services by Component-Based Information Systems.

[BibT_eX]

[DOI]

Benjamin Olschok

Proceedings of the Business Information Systems, 11th International Conference, 2008

2006

Process Language GPN.

[BibT_eX]

[DOI]

Oliver Braun

Proceedings of the Handbook on Architectures of Information Systems, 2006

2004

How to Model Business Processes with GPN.

[BibT_eX]

[DOI]

Oliver Braun

Proceedings of the Knowledge Sharing in the Integrated Enterprise, 2004

2003

Parallel Processor Scheduling with Limited Number of Preemptions.

[BibT_eX]

[DOI]

Oliver Braun

SIAM J. Comput., 2003

Non-preemptive two-machine open shop scheduling with non-availability constraints.

[BibT_eX]

[DOI]

Joachim Breit

Vitaly A. Strusevich

Math. Methods Oper. Res., 2003

2002

A polynomial algorithm for lot-size scheduling of two type tasks.

[BibT_eX]

[DOI]

Mikhail Y. Kovalyov

Marcus Pattloch

Inf. Process. Lett., 2002

Two-machine flow shops with limited machine availability.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2002

2001

Two-machine open shop scheduling with an availability constraint.

[BibT_eX]

[DOI]

Joachim Breit

Vitaly A. Strusevich

Oper. Res. Lett., 2001

Scheduling with unexpected machine breakdowns.

[BibT_eX]

[DOI]

Susanne Albers

Discret. Appl. Math., 2001

Optimizing Business Processes with Generalised Process Networks.

[BibT_eX]

[DOI]

Proceedings of the Informationsmanagement, 2001

2000

Scheduling preemptable tasks on parallel processors with limited availability.

[BibT_eX]

[DOI]

Parallel Comput., 2000

Scheduling with limited machine availability.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2000

GERAM: Ein Standard für Enterprise Integration.

[BibT_eX]

[DOI]

Proceedings of the Information als Erfolgsfaktor: 2. Liechtensteinisches Wirtschaftsinformatik-Symposium an der Fachhochschule Liechtenstein, 2000

1998

Machine Scheduling with Availability Constraints.

[BibT_eX]

[DOI]

Eric Sanlaville

Acta Informatica, 1998

1996

Lot-size Scheduling of Two Types of Jobs on Identical Machines.

[BibT_eX]

[DOI]

Marcus Pattloch

Discret. Appl. Math., 1996

1994

Scheduling Independent Multiprocessor Tasks on a Uniform k-Processor System.

[BibT_eX]

[DOI]

Parallel Comput., 1994

1993

Scheduling Multiprocessor Tasks on Uniform Processors.

[BibT_eX]

Proceedings of the Parallel Computing: Trends and Applications, 1993

1990

Scheduling independent two processor tasks on a uniform duo-processor system.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1990

1984

Scheduling on semi-identical processors.

[BibT_eX]

[DOI]

Z. Oper. Research, 1984

Netzflußmodelle zur präferenzorientierten dynamischen Einsatz und Ablaufplanung.

[BibT_eX]

[DOI]

Gilbert Kalb

Hans Röck

Z. Oper. Research, 1984

1983

Polynomial lösbare Ablaufplanungsprobleme mit zeitlich begrenzten Ressourcenverfügbarkeiten.

[BibT_eX]

[DOI]