default search action
Thomas Tautenhahn
Person information
- affiliation: Otto-von-Guericke-Universität, Magdeburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
- [j12]Heidemarie Bräsel, André Herms, Marc Mörig, Thomas Tautenhahn, Jan Tusch, Frank Werner
:
Heuristic constructive algorithms for open shop scheduling to minimize mean flow time. Eur. J. Oper. Res. 189(3): 856-870 (2008)
1990 – 1999
- 1999
- [j11]Alex E. Gerodimos, Celia A. Glass, Chris N. Potts, Thomas Tautenhahn:
Scheduling multi‐operation jobs on a single machine. Ann. Oper. Res. 92: 87-105 (1999) - [j10]Heidemarie Bräsel, Martin Harborth, Thomas Tautenhahn, Per Willenius:
On the set of solutions of the open shop problem. Ann. Oper. Res. 92: 241-263 (1999) - [j9]Heidemarie Bräsel, Martin Harborth, Thomas Tautenhahn, Per Willenius:
On the hardness of the classical job shop problem. Ann. Oper. Res. 92: 265-279 (1999) - [j8]Yuri N. Sotskov, Thomas Tautenhahn, Frank Werner
On the application of insertion techniques for job shop problems with setup times. RAIRO Oper. Res. 33(2): 209-245 (1999) - [j7]Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger:
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. SIAM J. Comput. 28(4): 1155-1166 (1999) - 1997
- [j6]Thomas Tautenhahn, Gerhard J. Woeginger:
Unit-Time Scheduling Problems with Time Dependent Resources. Computing 58(2): 97-112 (1997) - [j5]Thomas Tautenhahn, Gerhard J. Woeginger:
Minimizing the total completion time in a unit-time open shop with release times. Oper. Res. Lett. 20(5): 207-212 (1997) - 1996
- [j4]Thomas Tautenhahn:
On unit time open shops with additional restrictions. Math. Methods Oper. Res. 43(2): 215-231 (1996) - [c1]Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger:
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. STOC 1996: 418-426 - 1994
- [j3]Thomas Tautenhahn:
Scheduling Unit-Time Open Shops with Deadlines. Oper. Res. 42(1): 189-192 (1994) - 1993
- [j2]Heidemarie Bräsel, Thomas Tautenhahn, Frank Werner
Constructive heuristic algorithms for the open shop problem. Computing 51(2): 95-110 (1993) - [j1]Peter Brucker, Bernd Jurisch, Thomas Tautenhahn, Frank Werner:
Scheduling unit time open shops to minimize the weighted number of late jobs. Oper. Res. Lett. 14(5): 245-250 (1993)
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 2025-01-20 23:04 CET 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: