Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGünter Schmidt 0002
Person information
- affiliation: Saarland University, Saarbrücken, Germany
- affiliation: University of Cape Town, Rondebosch, South Africa
Other persons with the same name
- Günter Schmidt — disambiguation page
- Günter Schmidt 0001 — Definiens AG, München, Germany
- Günter Schmidt 0003 — Ruhr University Bochum, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j23]Iftikhar Ahmad
, Marcus Pirron, Günter Schmidt:
Analysis of threat based algorithm using different performance measures. RAIRO Oper. Res. 55(Supplement): S2393-S2401 (2021)
2010 – 2019
- 2019
- [j22]Pascal Schroeder, Imed Kacem, Günter Schmidt:
Optimal online algorithms for the portfolio selection problem, bi-directional trading and -search with interrelated prices. RAIRO Oper. Res. 53(2): 559-576 (2019) - 2018
- [j21]Pascal Schroeder, Robert Dochow, Günter Schmidt:
Optimal solutions for the online time series search and one-way trading problem with interrelated prices and a profit function. Comput. Ind. Eng. 119: 465-471 (2018) - 2017
- [j20]Günter Schmidt:
Competitive analysis of bi-directional non-preemptive conversion. J. Comb. Optim. 34(4): 1096-1113 (2017) - [j19]Imed Kacem, Myriam Sahnoune, Günter Schmidt:
Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines. RAIRO Oper. Res. 51(4): 1177-1188 (2017) - 2016
- [j18]Claude Gangolf, Robert Dochow, Günter Schmidt, Thomas Tamisier:
Automated Credit Rating Prediction in a competitive framework. RAIRO Oper. Res. 50(4-5): 749-765 (2016) - [c14]Pascal Schroeder, Günter Schmidt, Imed Kacem:
Optimal on-line algorithms for bi-directional non-preemptive conversion with interrelated conversion rates. CoDIT 2016: 28-33 - 2014
- [c13]Claude Gangolf, Robert Dochow, Günter Schmidt, Thomas Tamisier:
SVDD: A proposal for automated credit rating prediction. CoDIT 2014: 48-53 - 2013
- [j17]Esther Mohr, Günter Schmidt:
How much is it worth to know the future in online conversion problems? Discret. Appl. Math. 161(10-11): 1546-1555 (2013) - [c12]Aistis Raudys, Esther Mohr, Günter Schmidt:
How (in)efficient is after-hours trading? CIFEr 2013: 27-33 - [c11]Robert Dochow, Esther Mohr, Günter Schmidt:
Risk-Adjusted On-line Portfolio Selection. OR 2013: 113-119 - [p2]Esther Mohr, Günter Schmidt, Sebastian Jansen:
A Comparative Study of Heuristic Conversion Algorithms, Genetic Programming and Return Predictability on the German Market. EVOLVE 2013: 393-414 - 2012
- [c10]Iftikhar Ahmad, Javeria Iqbal, Günter Schmidt:
Dynamic Adaptive Algorithm Selection: Profit Maximization for Online Trading. BIS 2012: 236-248 - [c9]Iftikhar Ahmad, Günter Schmidt:
An Experimental Analysis of Online Unidirectional Conversion Problem. EC-Web 2012: 176-187 - [c8]Iftikhar Ahmad, Esther Mohr, Günter Schmidt:
Competitive Ratio as Coherent Measure of Risk. OR 2012: 63-69 - [c7]Javeria Iqbal, Iftikhar Ahmad, Günter Schmidt:
Can online trading algorithms beat the market? An experimental evaluation. SCOR 2012: 43-52 - 2010
- [j16]Günter Schmidt, Esther Mohr, Mike Kersch:
Experimental Analysis of an Online Trading Algorithm. Electron. Notes Discret. Math. 36: 519-526 (2010) - [j15]Markus Heck, Günter Schmidt:
Lot-Size Planning with Non-Linear Cost Functions Supporting Environmental Sustainability. Int. J. Green Comput. 1(1): 34-39 (2010) - [c6]Markus Heck, Günter Schmidt:
Lot-Size Planning with Non-linear Cost Functions Supporting Environmental Sustainability. NDT (2) 2010: 1-6
2000 – 2009
- 2008
- [c5]Benjamin Olschok, Günter Schmidt:
Industrialized Generation of Financial Services by Component-Based Information Systems. BIS 2008: 309-320 - [c4]Esther Mohr, Günter Schmidt:
Empirical Analysis of an Online Algorithm for Multiple Trading Problems. MCO 2008: 293-302 - 2006
- [p1]Günter Schmidt, Oliver Braun:
Process Language GPN. Handbook on Architectures of Information Systems 2006: 197-214 - [e1]Peter Bernus, Kai Mertins, Günter Schmidt:
Handbook on Architectures of Information Systems. International handbooks on information systems, Springer 2006, ISBN 978-3-540-25472-0 [contents] - 2004
- [c3]Günter Schmidt, Oliver Braun:
How to Model Business Processes with GPN. ICEIMT/DIISM 2004: 289-302 - 2003
- [j14]Joachim Breit, Günter Schmidt, Vitaly A. Strusevich:
Non-preemptive two-machine open shop scheduling with non-availability constraints. Math. Methods Oper. Res. 57(2): 217-234 (2003) - [j13]Oliver Braun, Günter Schmidt:
Parallel Processor Scheduling with Limited Number of Preemptions. SIAM J. Comput. 32(3): 671-680 (2003) - 2002
- [j12]Wieslaw Kubiak, Jacek Blazewicz, Piotr Formanowicz, Joachim Breit, Günter Schmidt:
Two-machine flow shops with limited machine availability. Eur. J. Oper. Res. 136(3): 528-540 (2002) - [j11]Mikhail Y. Kovalyov, Marcus Pattloch, Günter Schmidt:
A polynomial algorithm for lot-size scheduling of two type tasks. Inf. Process. Lett. 83(4): 229-235 (2002) - 2001
- [j10]Susanne Albers, Günter Schmidt:
Scheduling with unexpected machine breakdowns. Discret. Appl. Math. 110(2-3): 85-99 (2001) - [j9]Joachim Breit, Günter Schmidt, Vitaly A. Strusevich:
Two-machine open shop scheduling with an availability constraint. Oper. Res. Lett. 29(2): 65-77 (2001) - 2000
- [j8]Günter Schmidt:
Scheduling with limited machine availability. Eur. J. Oper. Res. 121(1): 1-15 (2000) - [j7]Jacek Blazewicz, Maciej Drozdowski, Piotr Formanowicz, Wieslaw Kubiak, Günter Schmidt:
Scheduling preemptable tasks on parallel processors with limited availability. Parallel Comput. 26(9): 1195-1211 (2000)
1990 – 1999
- 1999
- [c2]Susanne Albers, Günter Schmidt:
Scheduling with Unexpected Machine Breakdowns. RANDOM-APPROX 1999: 269-280 - 1998
- [j6]Eric Sanlaville, Günter Schmidt:
Machine Scheduling with Availability Constraints. Acta Informatica 35(9): 795-811 (1998) - 1996
- [j5]Marcus Pattloch, Günter Schmidt:
Lot-size Scheduling of Two Types of Jobs on Identical Machines. Discret. Appl. Math. 65(1-3): 409-419 (1996) - 1994
- [j4]Jacek Blazewicz, Maciej Drozdowski, Günter Schmidt, Dominique de Werra:
Scheduling Independent Multiprocessor Tasks on a Uniform k-Processor System. Parallel Comput. 20(1): 15-28 (1994) - 1993
- [c1]Jacek Blazewicz, Maciej Drozdowski, Günter Schmidt, Dominique de Werra:
Scheduling Multiprocessor Tasks on Uniform Processors. PARCO 1993: 249-256 - 1990
- [j3]Jacek Blazewicz, Maciej Drozdowski, Günter Schmidt, Dominique de Werra:
Scheduling independent two processor tasks on a uniform duo-processor system. Discret. Appl. Math. 28(1): 11-20 (1990)
1980 – 1989
- 1984
- [j2]Günter Schmidt:
Scheduling on semi-identical processors. Z. Oper. Research 28(5): 153-162 (1984) - [j1]Gilbert Kalb, Hans Röck, Günter Schmidt:
Netzflußmodelle zur präferenzorientierten dynamischen Einsatz und Ablaufplanung. Z. Oper. Research 28(8) (1984) - 1983
- [b1]Günter Schmidt:
Polynomial lösbare Ablaufplanungsprobleme mit zeitlich begrenzten Ressourcenverfügbarkeiten. Technical University of Berlin, Germany, 1983
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-11 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
