Günter Schmidt

According to our database1, Günter Schmidt authored at least 31 papers between 1983 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Optimal online algorithms for the portfolio selection problem, bi-directional trading and -search with interrelated prices.
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.
Comput. Ind. Eng., 2018

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

Competitive analysis of bi-directional non-preemptive conversion.
J. Comb. Optim., 2017

2016
Automated Credit Rating Prediction in a competitive framework.
RAIRO Oper. Res., 2016

Optimal on-line algorithms for bi-directional non-preemptive conversion with interrelated conversion rates.
Proceedings of the International Conference on Control, 2016

2014
SVDD: A proposal for automated credit rating prediction.
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.
Proceedings of the EVOLVE, 2013

How much is it worth to know the future in online conversion problems?
Discret. Appl. Math., 2013

Risk-Adjusted On-line Portfolio Selection.
Proceedings of the Operations Research Proceedings 2013, 2013

How (in)efficient is after-hours trading?
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.
Proceedings of the 3rd Student Conference on Operational Research, 2012

Competitive Ratio as Coherent Measure of Risk.
Proceedings of the Operations Research Proceedings 2012, 2012

An Experimental Analysis of Online Unidirectional Conversion Problem.
Proceedings of the E-Commerce and Web Technologies - 13th International Conference, 2012

Dynamic Adaptive Algorithm Selection: Profit Maximization for Online Trading.
Proceedings of the Business Information Systems - 15th International Conference, 2012

2010
Experimental Analysis of an Online Trading Algorithm.
Electron. Notes Discret. Math., 2010

2008
Empirical Analysis of an Online Algorithm for Multiple Trading Problems.
Proceedings of the Modelling, 2008

2006
Process Language GPN.
Proceedings of the Handbook on Architectures of Information Systems, 2006

2004
How to Model Business Processes with GPN.
Proceedings of the Knowledge Sharing in the Integrated Enterprise, 2004

2003
Parallel Processor Scheduling with Limited Number of Preemptions.
SIAM J. Comput., 2003

Non-preemptive two-machine open shop scheduling with non-availability constraints.
Math. Methods Oper. Res., 2003

2002
A polynomial algorithm for lot-size scheduling of two type tasks.
Inf. Process. Lett., 2002

Two-machine flow shops with limited machine availability.
Eur. J. Oper. Res., 2002

2001
Two-machine open shop scheduling with an availability constraint.
Oper. Res. Lett., 2001

2000
Scheduling preemptable tasks on parallel processors with limited availability.
Parallel Comput., 2000

1996
Lot-size Scheduling of Two Types of Jobs on Identical Machines.
Discret. Appl. Math., 1996

1994
Scheduling Independent Multiprocessor Tasks on a Uniform k-Processor System.
Parallel Comput., 1994

1993
Scheduling Multiprocessor Tasks on Uniform Processors.
Proceedings of the Parallel Computing: Trends and Applications, 1993

1990
Scheduling independent two processor tasks on a uniform duo-processor system.
Discret. Appl. Math., 1990

1984
Netzflußmodelle zur präferenzorientierten dynamischen Einsatz und Ablaufplanung.
Z. Oper. Research, 1984

1983
Polynomial lösbare Ablaufplanungsprobleme mit zeitlich begrenzten Ressourcenverfügbarkeiten.
PhD thesis, 1983


  Loading...