default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKlaus Neumann 0001
Person information
- affiliation (former): KIT Karlsruhe, Institute of Operations Research, Germany
Other persons with the same name
- Klaus Neumann 0002 — Bielefeld University, Research Institute for Cognition and Robotics (CoR-Lab), Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
[j28]Klaus Neumann, Christoph Schwindt, Norbert Trautmann
:
Scheduling of continuous and discontinuous material flows with intermediate storage restrictions. Eur. J. Oper. Res. 165(2): 495-509 (2005)- 2004
- [r1]Karsten Gentner, Klaus Neumann, Christoph Schwindt, Norbert Trautmann:
Batch Production Scheduling in the Process Industries. Handbook of Scheduling 2004 - 2003
- [j27]Klaus Neumann, Christoph Schwindt, Jürgen Zimmermann:
Order-based neighborhoods for project scheduling with nonregular objective functions. Eur. J. Oper. Res. 149(2): 325-343 (2003) - [j26]Klaus Neumann, Christoph Schwindt:
Project scheduling with inventory constraints. Math. Methods Oper. Res. 56(3): 513-533 (2003) - 2002
- [j25]Klaus Neumann, Christoph Schwindt, Norbert Trautmann:
Advanced production scheduling for batch plants in process industries. OR Spectr. 24(3): 251-279 (2002) - 2001
- [j24]Birger Franck, Klaus Neumann, Christoph Schwindt:
Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling. OR Spectr. 23(3): 297-324 (2001) - [j23]Birger Franck, Klaus Neumann, Christoph Schwindt:
Project scheduling with calendars. OR Spectr. 23(3): 325-334 (2001) - 2000
- [j22]Klaus Neumann, Jürgen Zimmermann:
Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints. Eur. J. Oper. Res. 127(2): 425-443 (2000) - [j21]Klaus Neumann, Hartwig Nübel, Christoph Schwindt:
Active and stable project scheduling. Math. Methods Oper. Res. 52(3): 441-465 (2000)
1990 – 1999
- 1999
- [j20]Klaus Neumann, Welf G. Schneider:
Heuristic algorithms for job‐shop scheduling problemswith stochastic precedence constraints. Ann. Oper. Res. 92: 45-63 (1999) - [j19]Peter Brucker, Andreas Drexl, Rolf H. Möhring, Klaus Neumann, Erwin Pesch:
Resource-constrained project scheduling: Notation, classification, models, and methods. Eur. J. Oper. Res. 112(1): 3-41 (1999) - [j18]Klaus Neumann, Jürgen Zimmermann:
Resource levelling for projects with schedule-dependent time windows. Eur. J. Oper. Res. 117(3): 591-605 (1999) - 1998
- [j17]Klaus Neumann, Jürgen Zimmermann:
Heuristic procedures for parallel-machine schedulingproblems with stochastic precedence constraints. Ann. Oper. Res. 83: 115-136 (1998) - 1995
- [j16]Klaus Neumann, J. Zhan:
Heuristics for the minimum project-duration problem with minimal and maximal time lags under fixed resource constraints. J. Intell. Manuf. 6(2): 145-154 (1995) - 1994
- [j15]Matthias Bücker, Klaus Neumann, Thomas Rubach:
Algorithms for single-machine scheduling with stochastic outtree precedence relations to minimize expected weighted flow time or maximum expected lateness. Math. Methods Oper. Res. 39(3): 321-348 (1994) - 1993
- [b1]Klaus Neumann, Martin Morlock:
Operations research. Hanser 1993, ISBN 978-3-446-15771-2, pp. I-XIX, 1-779 - 1992
- [j14]Klaus Neumann:
Book review. ZOR Methods Model. Oper. Res. 36(4): 342 (1992)
1980 – 1989
- 1985
- [j13]Klaus Neumann:
EOR project networks. Computing 34(1): 1-15 (1985) - 1984
- [j12]Panayotis N. Delivorias, Klaus Neumann, Ulrich Steinhardt:
Gradient-projection and policy-iteration methods for solving optimization problems in STEOR networks. Z. Oper. Research 28(3): 67-88 (1984)
1970 – 1979
- 1979
- [j11]Wolfgang Fix, Klaus Neumann:
Project scheduling by special GERT networks. Computing 23(3): 299-308 (1979) - [j10]Klaus Neumann:
Recent advances in temporal analysis of GERT networks. Z. Oper. Research 23(5): 153-177 (1979) - 1975
- [j9]Klaus Neumann:
Zur Lösung nichtlinearer Kontrollprobleme mit Hilfe eines Gradientenverfahrens. Computing 14(1-2): 119-130 (1975) - 1970
- [j8]Klaus Neumann:
Ein Verfahren zur Lösung gewisser nichtlinearer Kontrollprobleme. Computing 6(3-4): 249-263 (1970)
1960 – 1969
- 1969
- [j7]Klaus Neumann:
Optimierung von Funktionalen unter nichtholonomen Nebenbedingungen - Teil I. Unternehmensforschung 13(1): 37-57 (1969) - [j6]Klaus Neumann:
Optimierung von Funktionalen unter nichtholonomen Nebenbedingungen - Teil II. Unternehmensforschung 13(2): 110-122 (1969) - 1968
- [j5]Klaus Neumann:
Dynamische Optimierung und PONTRJAGINsches Maximumprinzip. Unternehmensforschung 12(1): 55-70 (1968) - 1966
- [j4]Heiner Müller-Merbach, D. Onigkeit, Klaus Neumann, H. Amann:
Buchbesprechungen. Unternehmensforschung 10(3): 190-195 (1966) - 1965
- [j3]Klaus Neumann:
Zur Theorie und Praxis der dynamischen Optimierung. Unternehmensforschung 9(3): 169-186 (1965) - [j2]Klaus Neumann:
Zur Theorie und Praxis der dynamischen Optimierung - Teil II. Unternehmensforschung 9(4): 201-216 (1965) - 1963
- [j1]Klaus Neumann, Th. Neumann:
Die Anwendung des elektronischen Analogrechners auf das dynamische Optimieren. Unternehmensforschung 7(3): 117-130 (1963)
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-10-18 19:31 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:
