default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNorbert Trautmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Tamara Bigler
, Mario Gnägi, Norbert Trautmann:
MIP-based solution approaches for multi-site resource-constrained project scheduling. Ann. Oper. Res. 337(2): 627-647 (2024)- [j14]Nicklas Klein, Mario Gnägi, Norbert Trautmann:
Mixed-integer linear programming for project scheduling under various resource constraints. Eur. J. Oper. Res. 319(1): 79-88 (2024) - 2023
- [c17]Nicklas Klein, Norbert Trautmann:
Planning Electric Vehicle Charging Stations Under Uncertainty. IEEM 2023: 612-616 - [c16]Jonas Saupe, Mario Gnägi, Norbert Trautmann:
Workload-based Extensions of Mixed-integer Programming Models for Resource-constrained Project Scheduling. IEEM 2023: 645-649 - 2022
- [e1]Norbert Trautmann, Mario Gnägi:
Operations Research Proceedings 2021, Selected Papers of the International Conference of the Swiss, German and Austrian Operations Research Societies (SVOR/ASRO, GOR e.V., ÖGOR), University of Bern, Switzerland, August 31 - September 3, 2021. Lecture Notes in Operations Research, Springer 2022, ISBN 978-3-031-08623-6 [contents] - 2020
- [c15]Chantal Schöni, Philipp Baumann, Norbert Trautmann:
An Order-First Split-Second Approach to a Novel Variant of the Cardinality-Constrained Covering Traveling Salesperson Problem. IEEM 2020: 615-619
2010 – 2019
- 2019
- [j13]Mario Gnägi, Tom Rihm, Adrian Zimmermann, Norbert Trautmann:
Two continuous-time assignment-based models for the multi-mode resource-constrained project scheduling problem. Comput. Ind. Eng. 129: 346-353 (2019) - [j12]Oliver Strub, Norbert Trautmann:
A two-stage approach to the UCITS-constrained index-tracking problem. Comput. Oper. Res. 103: 167-183 (2019) - [c14]Dennis Lerch, Norbert Trautmann:
A Lazy-Constraints Approach to Resource-Constrained Project Scheduling. IEEM 2019: 144-148 - [c13]Mario Gnägi, Norbert Trautmann:
A Continuous-Time Mixed-Binary Linear Programming Formulation for the Multi-Site Resource-Constrained Project Scheduling Problem. IEEM 2019: 611-614 - 2018
- [j11]Adrian Zimmermann, Norbert Trautmann:
A list-scheduling heuristic for the short-term planning of assessment centers. J. Sched. 21(2): 131-142 (2018) - [c12]Mario Gnägi, Adrian Zimmermann, Norbert Trautmann:
A Continuous-Time Unit-Based MILP Formulation for the Resource-Constrained Project Scheduling Problem. IEEM 2018: 432-436 - [c11]Mario Gnägi, Tom Rihm, Norbert Trautmann:
A Continuous-Time MILP Formulation for the Multi-Mode Resource-Constrained Project Scheduling Problem. IEEM 2018: 452-456 - 2017
- [c10]Oliver Strub, Norbert Trautmann:
A genetic algorithm for the UCITS-constrained index-tracking problem. CEC 2017: 822-829 - 2016
- [c9]Oliver Strub, Norbert Trautmann:
An Iterated Greedy Heuristic for the 1/N Portfolio Tracking Problem. ICORES 2016: 424-431 - 2015
- [c8]Norbert Trautmann, Mario Gnägi:
On an application of Microsoft Excel's evolutionary solver to the resource-constrained project scheduling problem RCPSP. IEEM 2015: 646-650 - 2014
- [j10]Philipp Baumann, Norbert Trautmann:
A hybrid method for large-scale short-term scheduling of make-and-pack production processes. Eur. J. Oper. Res. 236(2): 718-735 (2014) - [j9]Gianluca Brandinu, Norbert Trautmann:
A mixed-integer linear programming approach to the optimization of event-bus schedules: a scheduling application in the tourism sector. J. Sched. 17(6): 621-629 (2014) - [c7]Philipp Baumann, Norbert Trautmann:
Efficient symmetry-breaking formulations for grouping customer orders in a printing shop. IEEM 2014: 506-510 - 2013
- [j8]Philipp Baumann, Norbert Trautmann:
Portfolio-optimization models for small investors. Math. Methods Oper. Res. 77(3): 345-356 (2013) - [c6]Joëlle Grüter, Norbert Trautmann, Adrian Zimmermann:
An MBLP Model for Scheduling Assessment Centers. OR 2013: 161-167 - 2011
- [c5]Philipp Baumann, Norbert Trautmann:
Heuristic decomposition and LP-based scheduling in make-and-pack production. IEEM 2011: 362-366 - [c4]Norbert Trautmann, Gianluca Brandinu:
A serial scheme for minimizing the duration of resource-constrained projects within Microsoft Project. IEEM 2011: 893-897 - 2010
- [j7]Cord-Ulrich Fündeling, Norbert Trautmann:
A priority-rule method for project scheduling with work-content constraints. Eur. J. Oper. Res. 203(3): 568-574 (2010)
2000 – 2009
- 2009
- [j6]Norbert Trautmann, Christoph Schwindt:
A cyclic approach to large-scale short-term planning in chemical batch production. J. Sched. 12(6): 595-606 (2009) - 2006
- [c3]Norbert Trautmann, Cord-Ulrich Fündeling:
Supply Chain Management and Advanced Planning in the Process Industries. OR 2006: 503-508 - 2005
- [j5]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) - [c2]Norbert Trautmann, Christoph Schwindt:
A Heuristic Method for Large-Scale Batch Scheduling in the Process Industries. OR 2005: 155-160 - 2004
- [j4]Christoph Mellentien, Christoph Schwindt, Norbert Trautmann:
Scheduling the factory pick-up of new cars. OR Spectr. 26(4): 579-601 (2004) - [r1]Karsten Gentner, Klaus Neumann, Christoph Schwindt, Norbert Trautmann:
Batch Production Scheduling in the Process Industries. Handbook of Scheduling 2004 - 2002
- [j3]Klaus Neumann, Christoph Schwindt, Norbert Trautmann:
Advanced production scheduling for batch plants in process industries. OR Spectr. 24(3): 251-279 (2002) - [c1]Christoph Schwindt, Norbert Trautmann:
Scheduling of Rolling Ingots Production. OR 2002: 83-88 - 2001
- [j2]Christoph Mellentien, Norbert Trautmann:
Resource allocation with project management software. OR Spectr. 23(3): 383-394 (2001) - 2000
- [j1]Christoph Schwindt, Norbert Trautmann:
Batch scheduling in process industries: an application of resource-constrained project scheduling. OR Spectr. 22(4): 501-524 (2000)
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-09-10 01:17 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:
