Erwin Pesch

According to our database1, Erwin Pesch authored at least 99 papers between 1985 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
The Piggyback Transportation Problem: Transporting drones launched from a flying warehouse.
Eur. J. Oper. Res., 2022

2021
New Perspectives in Scheduling Theory.
J. Sched., 2021

Fixed interval scheduling with third-party machines.
Networks, 2021

Dynamic pricing with demand disaggregation for hotel revenue management.
J. Heuristics, 2021

Provision-after-wait with preferences ordered by difference: Tighter complexity and better approximation.
Eur. J. Oper. Res., 2021

Brilliant Challenges Optimization Problem Submission Contest Final Report.
CoRR, 2021

2020
Non-approximability of the single crane container transhipment problem.
Int. J. Prod. Res., 2020

Hybrid adaptive large neighborhood search algorithm for the mixed fleet heterogeneous dial-a-ride problem.
J. Heuristics, 2020

Minimizing maximum cost for a single machine under uncertainty of processing times.
Eur. J. Oper. Res., 2020

2019
The train-to-yard assignment problem.
OR Spectr., 2019

Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas.
Eur. J. Oper. Res., 2019

Solving the single crane scheduling problem at rail transshipment yards.
Discret. Appl. Math., 2019

A parallel machine schedule updating game with compensations and clients averse to uncertain loss.
Comput. Oper. Res., 2019

2018
Container Dispatching and Conflict-Free Yard Crane Routing in an Automated Container Terminal.
Transp. Sci., 2018

Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines.
J. Sched., 2018

New challenges in scheduling theory.
J. Sched., 2018

An overview of revenue management and dynamic pricing models in hotel business.
RAIRO Oper. Res., 2018

Mechanism design for machine scheduling problems: classification and literature overview.
OR Spectr., 2018

Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey.
Networks, 2018

A note on scheduling container storage operations of two non-passing stacking cranes.
Networks, 2018

Scheduling in manufacturing systems: new trends and perspectives.
Int. J. Prod. Res., 2018

Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs.
Discret. Appl. Math., 2018

Complexity and Approximation Results for Setup-Minimal Batch Scheduling with Deadlines on a Single Processor.
Proceedings of the Operations Research Proceedings 2018, 2018

2017
Two-Way Bounded Dynamic Programming Approach for Operations Planning in Transshipment Yards.
Transp. Sci., 2017

An integrated model for the transshipment yard scheduling problem.
J. Sched., 2017

Flight gate assignment and recovery strategies with stochastic arrival and departure times.
OR Spectr., 2017

The windy rural postman problem with a time-dependent zigzag option.
Eur. J. Oper. Res., 2017

2016
Good Laboratory Practice for optimization research.
J. Oper. Res. Soc., 2016

Scheduling dedicated jobs with variative processing times.
J. Comb. Optim., 2016

Corrigendum to 'Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs' [Information Sciences, 224 (2013) 109-117].
Inf. Sci., 2016

Decentralized sequencing of jobs on a single machine.
Proceedings of the 2016 IEEE Symposium Series on Computational Intelligence, 2016

2015
Approximation algorithms for inventory constrained scheduling on a single machine.
J. Sched., 2015

New perspectives in scheduling theory.
J. Sched., 2015

New challenges in scheduling theory.
RAIRO Oper. Res., 2015

The Partitioning Min-Max Weighted Matching Problem.
Eur. J. Oper. Res., 2015

Mathematical formulations for a 1-full-truckload pickup-and-delivery problem.
Eur. J. Oper. Res., 2015

Minimizing maximum weight of subsets of a maximum matching in a bipartite graph.
Discret. Appl. Math., 2015

An Integrated Matching and Partitioning Problem with Applications in Intermodal Transport.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2015

2014
A branch-and-bound algorithm for the acyclic partitioning problem.
Comput. Oper. Res., 2014

2013
A Survey on Container Processing in Railway Yards.
Transp. Sci., 2013

Exact algorithms for inventory constrained scheduling on a single machine.
J. Sched., 2013

Guest editorial: "New trends in scheduling" - Centre CNRS "La Villa Clythia" Frejus Workshop, September 12-17, 2010.
J. Sched., 2013

A Lagrangian lower bound for the container transshipment problem at a railway hub for a fast branch-and-bound algorithm.
J. Oper. Res. Soc., 2013

Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs.
Inf. Sci., 2013

MLP accompanied beam search for the resonance assignment problem.
J. Heuristics, 2013

A truck scheduling problem arising in intermodal container transportation.
Eur. J. Oper. Res., 2013

New bounds and constraint propagation techniques for the clique partitioning problem.
Discret. Appl. Math., 2013

Mathematical Formulations for the Acyclic Partitioning Problem.
Proceedings of the Operations Research Proceedings 2013, 2013

Planning and Scheduling in Intermodal Transport.
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013

A Transfer Line Design Problem with Setup Times and Costs.
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013

2012
New bounds and algorithms for the transshipment yard scheduling problem.
J. Sched., 2012

An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand.
Oper. Res. Lett., 2012

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

Sequential competitive location on networks.
Eur. J. Oper. Res., 2012

Shunting yard operations: Theoretical aspects and applications.
Eur. J. Oper. Res., 2012

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

Flight gate scheduling with respect to a reference schedule.
Ann. Oper. Res., 2012

2011
Scheduling Freight Trains in Rail-Rail Transshipment Yards.
Transp. Sci., 2011

Protein alignment algorithms with an efficient backtracking routine on multiple GPUs.
BMC Bioinform., 2011

2010
Guest editorial - Special issue "New challenges in scheduling theory" (Marseilles Workshop, May 12-16, 2008).
J. Sched., 2010

A generic approach to proving NP-hardness of partition type problems.
Discret. Appl. Math., 2010

2009
Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities.
Math. Methods Oper. Res., 2009

Analysis, modeling and solution of the concrete delivery problem.
Eur. J. Oper. Res., 2009

Late work minimization in flow shops by a genetic algorithm.
Comput. Ind. Eng., 2009

2008
Modelling Robust Flight-Gate Scheduling as a Clique Partitioning Problem.
Transp. Sci., 2008

Guest editorial.
J. Sched., 2008

A single-item economic lot-sizing problem with a non-uniform resource: Approximation.
Eur. J. Oper. Res., 2008

Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date.
Comput. Oper. Res., 2008

2007
A note on the two machine job shop with the weighted late work criterion.
J. Sched., 2007

Selected papers from the Dagstuhl workshop.
J. Sched., 2007

2006
An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure.
Math. Program., 2006

2005
Logistics: From theory to application (ECCO XIV).
Eur. J. Oper. Res., 2005

A review of exact solution methods for the non-preemptive multiprocessor flowshop problem.
Eur. J. Oper. Res., 2005

The two-machine flow-shop problem with weighted late work criterion and common due date.
Eur. J. Oper. Res., 2005

A comparison of solution procedures for two-machine flow shop scheduling with late work criterion.
Comput. Ind. Eng., 2005

Metaheuristics for Late Work Minimization in Two-Machine Flow Shop with Common Due Date.
Proceedings of the KI 2005: Advances in Artificial Intelligence, 2005

2004
Open shop scheduling problems with late work criteria.
Discret. Appl. Math., 2004

04231 Abstracts Collection - Scheduling in Computer and Manufacturing Systems.
Proceedings of the Scheduling in Computer and Manufacturing Systems, 31.05. - 04.06.2004, 2004

Flow Shop Scheduling with Late Work Criterion - Choosing the Best Solution Strategy.
Proceedings of the Applied Computing, Second Asian Applied Computing Conference, 2004

2002
Constraint Propagation and Problem Decomposition: A Preprocessing Procedure for the Job Shop Problem.
Ann. Oper. Res., 2002

2000
A branch-and-bound algorithm for the resource-constrained project scheduling problem.
Math. Methods Oper. Res., 2000

The disjunctive graph machine representation of the job shop scheduling problem.
Eur. J. Oper. Res., 2000

Constraint propagation techniques for the disjunctive scheduling problem.
Artif. Intell., 2000

1999
Optimal workload allocation between a job shop and an FMS.
IEEE Trans. Robotics Autom., 1999

Resource-constrained project scheduling: Notation, classification, models, and methods.
Eur. J. Oper. Res., 1999

1998
Adaptive Suchverfahren zur Projektplanung bei beschränkten Ressourcen.
Künstliche Intell., 1998

1997
TSP Ejection Chains.
Discret. Appl. Math., 1997

1996
Constraint Propagation Based Scheduling of Job Shops.
INFORMS J. Comput., 1996

1995
Evolution based learning in a job shop scheduling environment.
Comput. Oper. Res., 1995

Local Search in Combinatorial Optimization.
Proceedings of the Artificial Neural Networks: An Introduction to ANN Theory and Practice, 1995

1994
Fast Clustering Algorithms.
INFORMS J. Comput., 1994

Genetic Local Search in Combinatorial Optimization.
Discret. Appl. Math., 1994

1991
Batch scheduling on parallel units in acrylic-glass production.
ZOR Methods Model. Oper. Res., 1991

Efficient characterizations of <i>n</i>-chromatic absolute retracts.
J. Comb. Theory, Ser. B, 1991

1990
Genetic Local Search Algorithms for the Travelling Salesman Problem.
Proceedings of the Parallel Problem Solving from Nature, 1st Workshop, 1990

1989
DismantlinG Absolute Retracts of Reflexive Graphs.
Eur. J. Comb., 1989

1988
Products of absolute retracts.
Discret. Math., 1988

1987
Minimal extensions of graphs to absolute retracts.
J. Graph Theory, 1987

1985
A characterization of absolute retracts of n-chromatic graphs.
Discret. Math., 1985


  Loading...