A characterization of absolute retracts of n-chromatic graphs. - Erwin Pesch; Werner Poguntke (Discret. Math., 1985)

Minimal extensions of graphs to absolute retracts. - Erwin Pesch (J. Graph Theory, 1987)

Products of absolute retracts. - Erwin Pesch (Discret. Math., 1988)

DismantlinG Absolute Retracts of Reflexive Graphs. - Hans-Jürgen Bandelt; Erwin Pesch (Eur. J. Comb., 1989)

Genetic Local Search Algorithms for the Travelling Salesman Problem. - Nico L. J. Ulder; Emile H. L. Aarts; Hans-Jürgen Bandelt; Peter J. M. van Laarhoven; Erwin Pesch (PPSN, 1990)

Efficient characterizations of n-chromatic absolute retracts. - Hans-Jürgen Bandelt; Erwin Pesch (J. Comb. Theory B, 1991)

Batch scheduling on parallel units in acrylic-glass production. - Harald Friedrich; Joachim Keßler; Erwin Pesch; Birgit Schildt (ZOR Methods Model. Oper. Res., 1991)

Genetic Local Search in Combinatorial Optimization. - Antoon W. J. Kolen; Erwin Pesch (Discret. Appl. Math., 1994)

Fast Clustering Algorithms. - Ulrich Dorndorf; Erwin Pesch (INFORMS J. Comput., 1994)

Local Search in Combinatorial Optimization. - Yves Crama; Antoon W. J. Kolen; Erwin Pesch (Artificial Neural Networks, 1995)

Evolution based learning in a job shop scheduling environment. - Ulrich Dorndorf; Erwin Pesch (Comput. Oper. Res., 1995)

Constraint Propagation Based Scheduling of Job Shops. - Erwin Pesch; Ulrich A. W. Tetzlaff (INFORMS J. Comput., 1996)

TSP Ejection Chains. - Erwin Pesch; Fred W. Glover (Discret. Appl. Math., 1997)

Adaptive Suchverfahren zur Projektplanung bei beschränkten Ressourcen. - Ulrich Dorndorf; Andreas Drexl; Erwin Pesch; Toàn Phan Huy (Künstliche Intell., 1998)

Resource-constrained project scheduling: Notation, classification, models, and methods. - Peter Brucker; Andreas Drexl; Rolf H. Möhring; Klaus Neumann 001; Erwin Pesch (Eur. J. Oper. Res., 1999)

Optimal workload allocation between a job shop and an FMS. - Ulrich A. W. Tetzlaff; Erwin Pesch (IEEE Trans. Robotics Autom., 1999)

Constraint propagation techniques for the disjunctive scheduling problem. - Ulrich Dorndorf; Erwin Pesch; Toàn Phan Huy (Artif. Intell., 2000)

The disjunctive graph machine representation of the job shop scheduling problem. - Jacek Blazewicz; Erwin Pesch; Malgorzata Sterna (Eur. J. Oper. Res., 2000)

A branch-and-bound algorithm for the resource-constrained project scheduling problem. - Ulrich Dorndorf; Erwin Pesch; Toàn Phan Huy (Math. Methods Oper. Res., 2000)

Constraint Propagation and Problem Decomposition: A Preprocessing Procedure for the Job Shop Problem. - Ulrich Dorndorf; Erwin Pesch; Toàn Phan Huy (Ann. Oper. Res., 2002)

Flow Shop Scheduling with Late Work Criterion - Choosing the Best Solution Strategy. - Jacek Blazewicz; Erwin Pesch; Malgorzata Sterna; Frank Werner 001 (AACC, 2004)

04231 Abstracts Collection - Scheduling in Computer and Manufacturing Systems. - Jacek Blazewicz; Klaus H. Ecker; Erwin Pesch; Denis Trystram (Scheduling in Computer and Manufacturing Systems, 2004)

Open shop scheduling problems with late work criteria. - Jacek Blazewicz; Erwin Pesch; Malgorzata Sterna; Frank Werner 001 (Discret. Appl. Math., 2004)

Metaheuristics for Late Work Minimization in Two-Machine Flow Shop with Common Due Date. - Jacek Blazewicz; Erwin Pesch; Malgorzata Sterna; Frank Werner 001 (KI, 2005)

A comparison of solution procedures for two-machine flow shop scheduling with late work criterion. - Jacek Blazewicz; Erwin Pesch; Malgorzata Sterna; Frank Werner 001 (Comput. Ind. Eng., 2005)

The two-machine flow-shop problem with weighted late work criterion and common due date. - Jacek Blazewicz; Erwin Pesch; Malgorzata Sterna; Frank Werner 001 (Eur. J. Oper. Res., 2005)

A review of exact solution methods for the non-preemptive multiprocessor flowshop problem. - Tamás Kis; Erwin Pesch (Eur. J. Oper. Res., 2005)

Logistics: From theory to application (ECCO XIV). - Silvano Martello; Erwin Pesch (Eur. J. Oper. Res., 2005)

An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure. - Sergei Chubanov; Mikhail Y. Kovalyov; Erwin Pesch (Math. Program., 2006)

Selected papers from the Dagstuhl workshop. - Jacek Blazewicz; Edmund K. Burke; Klaus Ecker; Erwin Pesch; Denis Trystram (J. Sched., 2007)

A note on the two machine job shop with the weighted late work criterion. - Jacek Blazewicz; Erwin Pesch; Malgorzata Sterna; Frank Werner 001 (J. Sched., 2007)

Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date. - Jacek Blazewicz; Erwin Pesch; Malgorzata Sterna; Frank Werner 001 (Comput. Oper. Res., 2008)

A single-item economic lot-sizing problem with a non-uniform resource: Approximation. - Sergei Chubanov; Mikhail Y. Kovalyov; Erwin Pesch (Eur. J. Oper. Res., 2008)

Guest editorial. - Michael A. Bender; Jacek Blazewicz; Klaus Ecker; Erwin Pesch; Denis Trystram (J. Sched., 2008)

Modelling Robust Flight-Gate Scheduling as a Clique Partitioning Problem. - Ulrich Dorndorf; Florian Jaehn; Erwin Pesch (Transp. Sci., 2008)

Late work minimization in flow shops by a genetic algorithm. - Erwin Pesch; Malgorzata Sterna (Comput. Ind. Eng., 2009)

Analysis, modeling and solution of the concrete delivery problem. - Lasse Asbach; Ulrich Dorndorf; Erwin Pesch (Eur. J. Oper. Res., 2009)

Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities. - Sergei Chubanov; Erwin Pesch (Math. Methods Oper. Res., 2009)

A generic approach to proving NP-hardness of partition type problems. - Mikhail Y. Kovalyov; Erwin Pesch (Discret. Appl. Math., 2010)

Guest editorial - Special issue "New challenges in scheduling theory" (Marseilles Workshop, May 12-16, 2008). - Michael A. Bender; Jacek Blazewicz; Erwin Pesch; Denis Trystram; Guochuan Zhang (J. Sched., 2010)

Protein alignment algorithms with an efficient backtracking routine on multiple GPUs. - Jacek Blazewicz; Wojciech Frohmberg; Michal Kierzynka; Erwin Pesch; Pawel Wojciechowski (BMC Bioinform., 2011)

Scheduling Freight Trains in Rail-Rail Transshipment Yards. - Nils Boysen; Florian Jaehn; Erwin Pesch (Transp. Sci., 2011)

Flight gate scheduling with respect to a reference schedule. - Ulrich Dorndorf; Florian Jaehn; Erwin Pesch (Ann. Oper. Res., 2012)

(r|p)-centroid problems on networks with vertex and edge demand. - Dominik Kress; Erwin Pesch (Comput. Oper. Res., 2012)

Shunting yard operations: Theoretical aspects and applications. - Nils Boysen; Malte Fliedner; Florian Jaehn; Erwin Pesch (Eur. J. Oper. Res., 2012)

Sequential competitive location on networks. - Dominik Kress; Erwin Pesch (Eur. J. Oper. Res., 2012)

Guest Editorial to the special issue "Operations Research in Health Care" (EURO XXIII, July 5-8, 2009, Bonn). - Erwin Pesch; Gerhard J. Woeginger (Eur. J. Oper. Res., 2012)

An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand. - Sergei Chubanov; Erwin Pesch (Oper. Res. Lett., 2012)

New bounds and algorithms for the transshipment yard scheduling problem. - Nils Boysen; Florian Jaehn; Erwin Pesch (J. Sched., 2012)

A Transfer Line Design Problem with Setup Times and Costs. - Alexandre Dolgui; Sergey Kovalev; Mikhail Y. Kovalyov; Jenny Nossack; Erwin Pesch (MIM, 2013)

Planning and Scheduling in Intermodal Transport. - Erwin Pesch; Jenny Nossack (MIM, 2013)

Mathematical Formulations for the Acyclic Partitioning Problem. - Jenny Nossack; Erwin Pesch (OR, 2013)

New bounds and constraint propagation techniques for the clique partitioning problem. - Florian Jaehn; Erwin Pesch (Discret. Appl. Math., 2013)

A truck scheduling problem arising in intermodal container transportation. - Jenny Nossack; Erwin Pesch (Eur. J. Oper. Res., 2013)

MLP accompanied beam search for the resonance assignment problem. - Marta Szachniuk; Mikolaj Malaczynski; Erwin Pesch; Edmund K. Burke; Jacek Blazewicz (J. Heuristics, 2013)

Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs. - Adam Janiak; Wladyslaw A. Janiak; Mikhail Y. Kovalyov; Erhan Kozan; Erwin Pesch (Inf. Sci., 2013)

A Lagrangian lower bound for the container transshipment problem at a railway hub for a fast branch-and-bound algorithm. - Maksim Barketau; Herbert Kopfer; Erwin Pesch (J. Oper. Res. Soc., 2013)

Guest editorial: "New trends in scheduling" - Centre CNRS "La Villa Clythia" Frejus Workshop, September 12-17, 2010. - Michael A. Bender; Jacek Blazewicz; Erwin Pesch; Denis Trystram; Guochuan Zhang (J. Sched., 2013)

Exact algorithms for inventory constrained scheduling on a single machine. - Dirk Briskorn; Florian Jaehn; Erwin Pesch (J. Sched., 2013)

A Survey on Container Processing in Railway Yards. - Nils Boysen; Malte Fliedner; Florian Jaehn; Erwin Pesch (Transp. Sci., 2013)

A branch-and-bound algorithm for the acyclic partitioning problem. - Jenny Nossack; Erwin Pesch (Comput. Oper. Res., 2014)

An Integrated Matching and Partitioning Problem with Applications in Intermodal Transport. - Erwin Pesch; Dominik Kress; Sebastian Meiswinkel (SSCI, 2015)

Minimizing maximum weight of subsets of a maximum matching in a bipartite graph. - Maksim Barketau; Erwin Pesch; Yakov M. Shafransky (Discret. Appl. Math., 2015)

Mathematical formulations for a 1-full-truckload pickup-and-delivery problem. - Michel Gendreau; Jenny Nossack; Erwin Pesch (Eur. J. Oper. Res., 2015)

The Partitioning Min-Max Weighted Matching Problem. - Dominik Kress; Sebastian Meiswinkel; Erwin Pesch (Eur. J. Oper. Res., 2015)

New challenges in scheduling theory. - Jacek Blazewicz; Erwin Pesch; Cynthia A. Phillips; Denis Trystram; Guochuan Zhang (RAIRO Oper. Res., 2015)

New perspectives in scheduling theory. - Jacek Blazewicz; Erwin Pesch; Denis Trystram; Guochuan Zhang (J. Sched., 2015)

Approximation algorithms for inventory constrained scheduling on a single machine. - Ehab Morsy; Erwin Pesch (J. Sched., 2015)

Decentralized sequencing of jobs on a single machine. - Erwin Pesch; Mikhail Y. Kovalyov; Dominik Kress; Sebastian Meiswinkel (SSCI, 2016)

Corrigendum to 'Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs' [Information Sciences, 224 (2013) 109-117]. - Adam Janiak; Wladyslaw A. Janiak; Mikhail Y. Kovalyov; Erhan Kozan; Erwin Pesch (Inf. Sci., 2016)

Scheduling dedicated jobs with variative processing times. - Maksim Barketau; Erwin Pesch; Yakov M. Shafransky (J. Comb. Optim., 2016)

Good Laboratory Practice for optimization research. - Graham Kendall; Ruibin Bai; Jacek Blazewicz; Patrick De Causmaecker; Michel Gendreau; Robert I. John; Jiawei Li 001; Barry McCollum; Erwin Pesch; Rong Qu; Nasser R. Sabar; Greet Vanden Berghe; et al. (J. Oper. Res. Soc., 2016)

New challenges in scheduling theory. - Jacek Blazewicz; Benjamin Moseley; Erwin Pesch; Denis Trystram; Guochuan Zhang (J. Sched., 2016)

The windy rural postman problem with a time-dependent zigzag option. - Jenny Nossack; Bruce L. Golden; Erwin Pesch; Rui Zhang 025 (Eur. J. Oper. Res., 2017)

Flight gate assignment and recovery strategies with stochastic arrival and departure times. - Ulrich Dorndorf; Florian Jaehn; Erwin Pesch (OR Spectr., 2017)

An integrated model for the transshipment yard scheduling problem. - Mateusz Cichenski; Florian Jaehn; Grzegorz Pawlak; Erwin Pesch; Gaurav Singh 002; Jacek Blazewicz (J. Sched., 2017)

Two-Way Bounded Dynamic Programming Approach for Operations Planning in Transshipment Yards. - Alena Otto; Xiyu Li; Erwin Pesch (Transp. Sci., 2017)

Complexity and Approximation Results for Setup-Minimal Batch Scheduling with Deadlines on a Single Processor. - Dominik Kress; Maksim Barketau; Erwin Pesch; David Müller 006 (OR, 2018)

Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs. - Dominik Kress; Sebastian Meiswinkel; Erwin Pesch (Discret. Appl. Math., 2018)

Scheduling in manufacturing systems: new trends and perspectives. - Ali Allahverdi; Erwin Pesch; Michael L. Pinedo; Frank Werner 001 (Int. J. Prod. Res., 2018)

A note on scheduling container storage operations of two non-passing stacking cranes. - Mikhail Y. Kovalyov; Erwin Pesch; Andrew Ryzhikov (Networks, 2018)

Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey. - Alena Otto; Niels A. H. Agatz; James F. Campbell; Bruce L. Golden; Erwin Pesch (Networks, 2018)

Mechanism design for machine scheduling problems: classification and literature overview. - Dominik Kress; Sebastian Meiswinkel; Erwin Pesch (OR Spectr., 2018)

An overview of revenue management and dynamic pricing models in hotel business. - Andrei M. Bandalouski; Mikhail Y. Kovalyov; Erwin Pesch; S. Armagan Tarim (RAIRO Oper. Res., 2018)

Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines. - Dominik Kress; Maksim Barketau; Erwin Pesch (J. Sched., 2018)

Container Dispatching and Conflict-Free Yard Crane Routing in an Automated Container Terminal. - Jenny Nossack; Dirk Briskorn; Erwin Pesch (Transp. Sci., 2018)

A parallel machine schedule updating game with compensations and clients averse to uncertain loss. - Mikhail Y. Kovalyov; Dominik Kress; Sebastian Meiswinkel; Erwin Pesch (Comput. Oper. Res., 2019)

Solving the single crane scheduling problem at rail transshipment yards. - Xiyu Li; Alena Otto; Erwin Pesch (Discret. Appl. Math., 2019)

Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas. - Dominik Kress; Sebastian Meiswinkel; Erwin Pesch (Eur. J. Oper. Res., 2019)

The train-to-yard assignment problem. - Alena Otto; Erwin Pesch (OR Spectr., 2019)

Minimizing maximum cost for a single machine under uncertainty of processing times. - Ilia Fridman; Erwin Pesch; Yakov M. Shafransky (Eur. J. Oper. Res., 2020)

Hybrid adaptive large neighborhood search algorithm for the mixed fleet heterogeneous dial-a-ride problem. - Mohamed Amine Masmoudi; Manar Hosny 001; Emrah Demir; Erwin Pesch (J. Heuristics, 2020)

Non-approximability of the single crane container transhipment problem. - Erwin Pesch; Katarzyna Anna Kuzmicz (Int. J. Prod. Res., 2020)

Brilliant Challenges Optimization Problem Submission Contest Final Report. - Jan Badura; Artur Laskowski; Maciej Antczak; Jacek Blazewicz; Grzegorz Pawlak; Erwin Pesch; Thomas Villmann; Szymon Wasik (CoRR, 2021)

Provision-after-wait with preferences ordered by difference: Tighter complexity and better approximation. - Mikhail Y. Kovalyov; Erwin Pesch; Alain Quilliot (Eur. J. Oper. Res., 2021)

Dynamic pricing with demand disaggregation for hotel revenue management. - Andrei M. Bandalouski; Natalja G. Egorova; Mikhail Y. Kovalyov; Erwin Pesch; S. Armagan Tarim (J. Heuristics, 2021)

Fixed interval scheduling with third-party machines. - Ilia Fridman; Mikhail Y. Kovalyov; Erwin Pesch; Andrew Ryzhikov (Networks, 2021)

New Perspectives in Scheduling Theory. - Jacek Blazewicz; Benjamin Moseley; Erwin Pesch; Denis Trystram; Guochuan Zhang (J. Sched., 2021)

OR and analytics for digital, resilient, and sustainable manufacturing 4.0. - Tsan-Ming Choi; Alexandre Dolgui; Dmitry A. Ivanov 001; Erwin Pesch (Ann. Oper. Res., 2022)

An algorithm selection approach for the flexible job shop scheduling problem: Choosing constraint programming solvers through machine learning. - David Müller 006; Marcus Gerhard Müller; Dominik Kress; Erwin Pesch (Eur. J. Oper. Res., 2022)

The Piggyback Transportation Problem: Transporting drones launched from a flying warehouse. - Kai Wang 018; Erwin Pesch; Dominik Kress; Ilia Fridman; Nils Boysen (Eur. J. Oper. Res., 2022)

Solving a hybrid mixed fleet heterogeneous dial-a-ride problem in delay-sensitive container transportation. - Sezgi Tekil-Ergün; Erwin Pesch; Katarzyna Anna Kuzmicz (Int. J. Prod. Res., 2022)

Stronger mixed-integer programming-formulations for order- and rack-sequencing in robotic mobile fulfillment systems. - Jan-Erik Justkowiak; Erwin Pesch (Eur. J. Oper. Res., 2023)

Cost minimizing planning of container inspection and repair in multiple facilities. - Mikhail Y. Kovalyov; Mikhail N. Lukashevich; Erwin Pesch (OR Spectr., 2023)

Single machine scheduling with assignable due dates to minimize maximum and total late work. - Jan-Erik Justkowiak; Sergey Kovalev; Mikhail Y. Kovalyov; Erwin Pesch (Eur. J. Oper. Res., 2023)

Mathematical challenges in scheduling theory. - Jacek Blazewicz; Benjamin Moseley; Erwin Pesch; Denis Trystram; Guochuan Zhang (J. Sched., 2023)

Planning container inspection and repair: A case study. - Mikhail Y. Kovalyov; Katarzyna Anna Kuzmicz; Mikhail N. Lukashevich; Erwin Pesch (Comput. Oper. Res., 2024)

Scheduling in manufacturing with transportation: Classification and solution techniques. - Amir Hosseini; Alena Otto; Erwin Pesch (Eur. J. Oper. Res., 2024)

A dynamic programming algorithm for order picking in robotic mobile fulfillment systems. - Jan-Erik Justkowiak; Mikhail Y. Kovalyov; Erwin Pesch (Networks, 2024)

Digital manufacturing and supply chain: creating benefits through operations research and artificial intelligence. - Weiwei Chen 003; Tsan-Ming Choi; Alexandre Dolgui; Dmitry A. Ivanov 001; Erwin Pesch (Ann. Oper. Res., 2025)