Pesch Erwin

Erwin Pesch

Information about the author Erwin Pesch will soon be added to the site.
Found 33 papers in total
Two-Way Bounded Dynamic Programming Approach for Operations Planning in Transshipment Yards
2017
We propose a two‐way bounded dynamic programming (TBDP) approach to deal with...
Good Laboratory Practice for optimization research
2016
Good Laboratory Practice has been a part of non‐clinical research for over 40...
Multiproduct batching and scheduling with buffered rework: The case of a car paint shop
2014
We study a problem of scheduling products on the same facility, which is motivated by...
A branch-and-bound algorithm for the acyclic partitioning problem
2014
We focus on the problem of partitioning the vertex set of a directed, edge‐ and...
A Survey on Container Processing in Railway Yards
2013
In spite of extraordinary support programs initiated by the European Union and other...
MLP accompanied beam search for the resonance assignment problem
2013
Resonance signal assignment is a well known problem encountered during the process of...
Exact algorithms for inventory constrained scheduling on a single machine
2013
This paper focuses on single machine scheduling subject to inventory constraints. Jobs...
An FPTAS for the single‐item capacitated economic lot‐sizing problem with supply and demand
2012
We present a fully polynomial time approximation scheme (FPTAS) for the...
Shunting yard operations: Theoretical aspects and applications
2012
Almost ever since freight has been transported via rail, shunting yards (also called...
Sequential competitive location on networks
2012
We present a survey of recent developments in the field of sequential competitive...
Flight gate scheduling with respect to a reference schedule
2012
This paper considers the problem of assigning flights to airport gates. We examine the...
Scheduling Freight Trains in Rail‐Rail Transshipment Yards
2011
Transshipment yards, where gantry cranes enable the efficient transfer of containers...
Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities
2009
We consider a production model with two facilities sharing a resource during a time...
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
2008
In this paper, metaheuristic approaches for the two-machine flow-shop problem with a...
A note on the two machine job shop with the weighted late work criterion
2007
The paper presents a dynamic programming approach for the two-machine nonpreemptive...
Flight gate scheduling: state-of-the-art and recent developments
2007
This paper surveys a large variety of mathematical models and up-to-date solution...
A novel representation of graph structures in web mining and data analysis
2005
The paper presents a new graph representation, the graph matrix, which combines the...
Disruption management in flight gate scheduling
2007
This paper introduces models of robustness in flight gate assignments at airports. We...
The two-machine flow-shop problem with weighted late work criterion and common due date
2005
The paper is on the two-machine non-preemptive flow-shop scheduling problem with a...
A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
2005
The hybrid or flexible flowshop problem is a generalization of the flowshop in such a...
A comparison of solution procedures for two-machine flow shop scheduling with late work criterion
2005
In this paper we analyze different solution procedures for the two-machine flow shop...
A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints
2000
Resource-constrained project scheduling with generalised precedence constraints is a...
Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem
2002
In recent years, constraint propagation techniques have been shown to be highly...
Solving the open shop scheduling problem
2001
Only few exact solution methods are available for the open shop scheduling problem. We...
Papers per page: