default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJürgen Zimmermann 0001
Person information
- affiliation: Clausthal University of Technology, Institute of Management and Economics, Clausthal-Zellerfeld, Germany
- affiliation (PhD 1995): University of Karlsruhe, Institute for Economic Theory and Operations Research, Germany
Other persons with the same name
- Jürgen Zimmermann 0002 — Kaiserslautern University, Germany
- Jürgen Zimmermann 0003 — University of Darmstadt, Germany
- Jürgen Zimmermann 0004 — SAP AG, Walldorf, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Lena Sophie Wohlert
, Jürgen Zimmermann:
Resource overload problems with tardiness penalty: structural properties and solution approaches. Ann. Oper. Res. 338(1): 151-172 (2024)- [j29]Mareike Karnebogen, Jürgen Zimmermann:
Generation schemes for the resource-constrained project scheduling problem with partially renewable resources and generalized precedence constraints. Ann. Oper. Res. 338(1): 173-192 (2024) - 2023
- [j28]Kai Watermeyer, Jürgen Zimmermann:
A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints. J. Sched. 26(1): 95-111 (2023) - 2022
- [j27]Kai Watermeyer, Jürgen Zimmermann:
A partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints. OR Spectr. 44(2): 575-602 (2022) - [c16]Max Reinke, Jürgen Zimmermann:
Solving the Resource Renting Problem with an Adapted Fix-and-optimize Heuristic. IEEM 2022: 1119-1123 - 2021
- [j26]Cinna Seifi, Marco Schulze, Jürgen Zimmermann:
A new mathematical formulation for a potash-mine shift scheduling problem with a simultaneous assignment of machines and workers. Eur. J. Oper. Res. 292(1): 27-42 (2021) - [j25]Cinna Seifi, Marco Schulze, Jürgen Zimmermann:
Solution procedures for block selection and sequencing in flat-bedded potash underground mines. OR Spectr. 43(2): 409-440 (2021) - [j24]Cinna Seifi, Marco Schulze, Jürgen Zimmermann:
Correction to: Solution procedures for block selection and sequencing in flat-bedded potash underground mines. OR Spectr. 43(2): 595 (2021) - [c15]Felix Merz, Christoph Schwindt, Stephan Westphal, Jürgen Zimmermann:
An Auction-based Mechanism for the Formation and Scheduling of Heterogeneous Human-machine Teams. IEEM 2021: 863-868 - [c14]Max Reinke, Jürgen Zimmermann:
A Comparative Performance Analysis of Two MILP Formulations for the Resource-Renting-Problem. IEEM 2021: 979-983 - [c13]Alexander Beckmann, Jürgen Zimmermann:
Multi-start Heuristics for Unit-Capacity Orienteering Problems. OR 2021: 247-253 - 2020
- [j23]Basel Alhaji, Janine Beecken, Rüdiger Ehlers, Jan Gertheiss, Felix Merz, Jörg P. Müller, Michael Prilla, Andreas Rausch, Andreas Reinhardt, Delphine Reinhardt, Christian Rembe, Niels-Ole Rohweder, Christoph Schwindt, Stephan Westphal, Jürgen Zimmermann:
Engineering Human-Machine Teams for Trusted Collaboration. Big Data Cogn. Comput. 4(4): 35 (2020) - [j22]Alexander Franz, Julia Rieck, Jürgen Zimmermann:
A long-term unit commitment problem with hydrothermal coordination for economic and emission control in large-scale electricity systems. OR Spectr. 42(1): 235-259 (2020) - [j21]Kai Watermeyer, Jürgen Zimmermann:
A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints. OR Spectr. 42(2): 427-460 (2020) - [c12]Felix Merz, Christoph Schwindt, Stephan Westphal, Jürgen Zimmermann:
A Multi-Round Auction for Staff to Job Assignment Under Myopic Best Response Dynamics. IEEM 2020: 1137-1141
2010 – 2019
- 2019
- [j20]Alexander Franz, Julia Rieck, Jürgen Zimmermann:
Fix-and-optimize procedures for solving the long-term unit commitment problem with pumped storages. Ann. Oper. Res. 274(1-2): 241-265 (2019) - 2018
- [j19]Stefan Kreter, Andreas Schutt, Peter J. Stuckey, Jürgen Zimmermann:
Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems. Eur. J. Oper. Res. 266(2): 472-486 (2018) - 2017
- [j18]Marco Schulze, Jürgen Zimmermann:
Staff and machine shift scheduling in a German potash mine. J. Sched. 20(6): 635-656 (2017) - 2016
- [j17]Matthias Walter, Jürgen Zimmermann:
Minimizing average project team size given multi-skilled workers with heterogeneous skill levels. Comput. Oper. Res. 70: 163-179 (2016) - [j16]Stefan Kreter, Julia Rieck, Jürgen Zimmermann:
Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars. Eur. J. Oper. Res. 251(2): 387-403 (2016) - [j15]Marco Schulze, Julia Rieck, Cinna Seifi, Jürgen Zimmermann:
Machine scheduling in underground mining: an application in the potash industry. OR Spectr. 38(2): 365-403 (2016) - [c11]Alexander Franz, Jürgen Zimmermann:
A Two-Stage Heuristic Procedure for Solving the Long-Term Unit Commitment Problem with Pumped Storages and Its Application to the German Electricity Market. OR 2016: 149-155 - 2015
- [c10]Alexander Franz, Julia Rieck, Jürgen Zimmermann:
Two-Stage Heuristic Approach for Solving the Long-Term Unit Commitment Problem with Hydro-Thermal Coordination. OR 2015: 667-673 - 2014
- [j14]Julia Rieck, Carsten Ehrenberg, Jürgen Zimmermann:
Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery. Eur. J. Oper. Res. 236(3): 863-878 (2014) - [j13]Stefan Kreter, Julia Rieck, Jürgen Zimmermann:
The total adjustment cost problem: Applications, models, and solution algorithms. J. Sched. 17(2): 145-160 (2014) - 2012
- [j12]Julia Rieck, Jürgen Zimmermann, Thorsten Gather:
Mixed-integer linear programming for resource leveling problems. Eur. J. Oper. Res. 221(1): 27-37 (2012) - [c9]Stefan Kreter, Julia Rieck, Jürgen Zimmermann:
MILP-Formulations for the Total Adjustment Cost Problem. OR 2012: 409-415 - [c8]Carsten Ehrenberg, Jürgen Zimmermann:
Simulation-based optimization in make-to-order production: scheduling for a special-purpose glass manufacturer. WSC 2012: 265:1-265:12 - 2011
- [j11]Jan-Hendrik Bartels, Thorsten Gather, Jürgen Zimmermann:
Dismantling of nuclear power plants at optimal NPV. Ann. Oper. Res. 186(1): 407-427 (2011) - [j10]Thorsten Gather, Jürgen Zimmermann, Jan-Hendrik Bartels:
Exact methods for the resource levelling problem. J. Sched. 14(6): 557-569 (2011) - [c7]Matthias Walter, Jürgen Zimmermann:
On a multi-project staffing problem with heterogeneously skilled workers. OR 2011: 489-494 - 2010
- [j9]Julia Rieck, Jürgen Zimmermann:
A new mixed integer linear model for a rich vehicle routing problem with docking constraints. Ann. Oper. Res. 181(1): 337-358 (2010) - [j8]Matthias Walter, Jürgen Zimmermann:
A heuristic approach to project staffing. Electron. Notes Discret. Math. 36: 775-782 (2010) - [c6]Marco Schulze, Jürgen Zimmermann:
Scheduling in the Context of Underground Mining. OR 2010: 611-616
2000 – 2009
- 2009
- [j7]Jan-Hendrik Bartels, Jürgen Zimmermann:
Scheduling tests in automotive R&D projects. Eur. J. Oper. Res. 193(3): 805-819 (2009) - 2006
- [c5]Julia Rieck, Jürgen Zimmermann:
A Sampling Procedure for Real-Life Rich Vehicle Routing Problems. OR 2006: 355-360 - [c4]Gazi Askar, Jürgen Zimmermann:
Optimal Usage of Flexibility Instruments in Automotive Plants. OR 2006: 479-484 - 2005
- [c3]Julia Rieck, Jürgen Zimmermann:
Tourenplanung mittelständischer Speditionsunternehmen in Stückgutkooperationen. OR 2005: 411-416 - [c2]Jan-Hendrik Bartels, Jürgen Zimmermann:
Scheduling Tests in Automotive R&D Projects. OR 2005: 661-666 - 2004
- [c1]Christoph Stark, Jürgen Zimmermann:
An Exact Branch-and-Price Algorithm for Workforce Scheduling. OR 2004: 207-212 - 2003
- [j6]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) - 2001
- [j5]Christoph Schwindt, Jürgen Zimmermann:
A steepest ascent approach to maximizing the net present value of projects. Math. Methods Oper. Res. 53(3): 435-450 (2001) - 2000
- [j4]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)
1990 – 1999
- 1999
- [j3]Klaus Neumann, Jürgen Zimmermann:
Resource levelling for projects with schedule-dependent time windows. Eur. J. Oper. Res. 117(3): 591-605 (1999) - [j2]Jürgen Zimmermann:
Time complexity of single- and identical parallel-machine scheduling with GERT network precedence constraints. Math. Methods Oper. Res. 49(2): 221-238 (1999) - 1998
- [j1]Klaus Neumann, Jürgen Zimmermann:
Heuristic procedures for parallel-machine schedulingproblems with stochastic precedence constraints. Ann. Oper. Res. 83: 115-136 (1998) - 1995
- [b1]Jürgen Zimmermann:
Mehrmaschinen-Schedulingprobleme mit GERT-Anordnungsbeziehungen. Karlsruhe Institute of Technology, Germany, 1995, pp. 1-150
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-04 01:20 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:
