Polynomial lösbare Ablaufplanungsprobleme mit zeitlich begrenzten Ressourcenverfügbarkeiten. - Günter Schmidt 002 (1983)

Netzflußmodelle zur präferenzorientierten dynamischen Einsatz und Ablaufplanung. - Gilbert Kalb; Hans Röck; Günter Schmidt 002 (Z. Oper. Research, 1984)

Scheduling on semi-identical processors. - Günter Schmidt 002 (Z. Oper. Research, 1984)

Scheduling independent two processor tasks on a uniform duo-processor system. - Jacek Blazewicz; Maciej Drozdowski; Günter Schmidt 002; Dominique de Werra (Discret. Appl. Math., 1990)

Scheduling Multiprocessor Tasks on Uniform Processors. - Jacek Blazewicz; Maciej Drozdowski; Günter Schmidt 002; Dominique de Werra (PARCO, 1993)

Scheduling Independent Multiprocessor Tasks on a Uniform k-Processor System. - Jacek Blazewicz; Maciej Drozdowski; Günter Schmidt 002; Dominique de Werra (Parallel Comput., 1994)

Lot-size Scheduling of Two Types of Jobs on Identical Machines. - Marcus Pattloch; Günter Schmidt 002 (Discret. Appl. Math., 1996)

Machine Scheduling with Availability Constraints. - Eric Sanlaville; Günter Schmidt 002 (Acta Informatica, 1998)

GERAM: Ein Standard für Enterprise Integration. - Günter Schmidt 002 (Liechtensteinisches Wirtschaftsinformatik-Symposium, 2000)

Scheduling with limited machine availability. - Günter Schmidt 002 (Eur. J. Oper. Res., 2000)

Scheduling preemptable tasks on parallel processors with limited availability. - Jacek Blazewicz; Maciej Drozdowski; Piotr Formanowicz; Wieslaw Kubiak; Günter Schmidt 002 (Parallel Comput., 2000)

Optimizing Business Processes with Generalised Process Networks. - Günter Schmidt 002 (Liechtensteinisches Wirtschaftsinformatik-Symposium, 2001)

Scheduling with unexpected machine breakdowns. - Susanne Albers; Günter Schmidt 002 (Discret. Appl. Math., 2001)

Two-machine open shop scheduling with an availability constraint. - Joachim Breit; Günter Schmidt 002; Vitaly A. Strusevich (Oper. Res. Lett., 2001)

Two-machine flow shops with limited machine availability. - Wieslaw Kubiak; Jacek Blazewicz; Piotr Formanowicz; Joachim Breit; Günter Schmidt 002 (Eur. J. Oper. Res., 2002)

A polynomial algorithm for lot-size scheduling of two type tasks. - Mikhail Y. Kovalyov; Marcus Pattloch; Günter Schmidt 002 (Inf. Process. Lett., 2002)

Non-preemptive two-machine open shop scheduling with non-availability constraints. - Joachim Breit; Günter Schmidt 002; Vitaly A. Strusevich (Math. Methods Oper. Res., 2003)

Parallel Processor Scheduling with Limited Number of Preemptions. - Oliver Braun; Günter Schmidt 002 (SIAM J. Comput., 2003)

How to Model Business Processes with GPN. - Günter Schmidt 002; Oliver Braun (ICEIMT/DIISM, 2004)

Process Language GPN. - Günter Schmidt 002; Oliver Braun (Handbook on Architectures of Information Systems, 2006)

Industrialized Generation of Financial Services by Component-Based Information Systems. - Benjamin Olschok; Günter Schmidt 002 (BIS, 2008)

Empirical Analysis of an Online Algorithm for Multiple Trading Problems. - Esther Mohr; Günter Schmidt 002 (MCO, 2008)

Experimental Analysis of an Online Trading Algorithm. - Günter Schmidt 002; Esther Mohr; Mike Kersch (Electron. Notes Discret. Math., 2010)

Lot-Size Planning with Non-Linear Cost Functions Supporting Environmental Sustainability. - Markus Heck; Günter Schmidt 002 (Int. J. Green Comput., 2010)

Dynamic Adaptive Algorithm Selection: Profit Maximization for Online Trading. - Iftikhar Ahmad 004; Javeria Iqbal; Günter Schmidt 002 (BIS, 2012)

An Experimental Analysis of Online Unidirectional Conversion Problem. - Iftikhar Ahmad 004; Günter Schmidt 002 (EC-Web, 2012)

Competitive Ratio as Coherent Measure of Risk. - Iftikhar Ahmad 004; Esther Mohr; Günter Schmidt 002 (OR, 2012)

Can online trading algorithms beat the market? An experimental evaluation. - Javeria Iqbal; Iftikhar Ahmad 004; Günter Schmidt 002 (SCOR, 2012)

How (in)efficient is after-hours trading? - Aistis Raudys; Esther Mohr; Günter Schmidt 002 (CIFEr, 2013)

Risk-Adjusted On-line Portfolio Selection. - Robert Dochow; Esther Mohr; Günter Schmidt 002 (OR, 2013)

How much is it worth to know the future in online conversion problems? - Esther Mohr; Günter Schmidt 002 (Discret. Appl. Math., 2013)

A Comparative Study of Heuristic Conversion Algorithms, Genetic Programming and Return Predictability on the German Market. - Esther Mohr; Günter Schmidt 002; Sebastian Jansen (EVOLVE, 2013)

SVDD: A proposal for automated credit rating prediction. - Claude Gangolf; Robert Dochow; Günter Schmidt 002; Thomas Tamisier (CoDIT, 2014)

Optimal on-line algorithms for bi-directional non-preemptive conversion with interrelated conversion rates. - Pascal Schroeder; Günter Schmidt 002; Imed Kacem (CoDIT, 2016)

Automated Credit Rating Prediction in a competitive framework. - Claude Gangolf; Robert Dochow; Günter Schmidt 002; Thomas Tamisier (RAIRO Oper. Res., 2016)

Competitive analysis of bi-directional non-preemptive conversion. - Günter Schmidt 002 (J. Comb. Optim., 2017)

Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines. - Imed Kacem; Myriam Sahnoune; Günter Schmidt 002 (RAIRO Oper. Res., 2017)

Optimal solutions for the online time series search and one-way trading problem with interrelated prices and a profit function. - Pascal Schroeder; Robert Dochow; Günter Schmidt 002 (Comput. Ind. Eng., 2018)

Optimal online algorithms for the portfolio selection problem, bi-directional trading and -search with interrelated prices. - Pascal Schroeder; Imed Kacem; Günter Schmidt 002 (RAIRO Oper. Res., 2019)

Analysis of threat based algorithm using different performance measures. - Iftikhar Ahmad 004; Marcus Pirron; Günter Schmidt 002 (RAIRO Oper. Res., 2021)