2009 |
24 | EE | Lasse Asbach,
Ulrich Dorndorf,
Erwin Pesch:
Analysis, modeling and solution of the concrete delivery problem.
European Journal of Operational Research 193(3): 820-835 (2009) |
2008 |
23 | EE | Jacek Blazewicz,
Erwin Pesch,
Malgorzata Sterna,
Frank Werner:
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date.
Computers & OR 35(2): 574-599 (2008) |
22 | EE | Sergei Chubanov,
Mikhail Y. Kovalyov,
Erwin Pesch:
A single-item economic lot-sizing problem with a non-uniform resource: Approximation.
European Journal of Operational Research 189(3): 877-889 (2008) |
21 | EE | Michael Bender,
Jacek Blazewicz,
Klaus Ecker,
Erwin Pesch,
Denis Trystram:
Guest editorial.
J. Scheduling 11(5): 309-310 (2008) |
2007 |
20 | EE | Jacek Blazewicz,
Edmund K. Burke,
Klaus Ecker,
Erwin Pesch,
Denis Trystram:
Selected papers from the Dagstuhl workshop.
J. Scheduling 10(2): 85-86 (2007) |
19 | EE | Jacek Blazewicz,
Erwin Pesch,
Malgorzata Sterna,
Frank Werner:
A note on the two machine job shop with the weighted late work criterion.
J. Scheduling 10(2): 87-95 (2007) |
2006 |
18 | EE | Sergei Chubanov,
Mikhail Y. Kovalyov,
Erwin Pesch:
An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure.
Math. Program. 106(3): 453-466 (2006) |
2005 |
17 | EE | Jacek Blazewicz,
Erwin Pesch,
Malgorzata Sterna,
Frank Werner:
Metaheuristics for Late Work Minimization in Two-Machine Flow Shop with Common Due Date.
KI 2005: 222-234 |
16 | EE | Silvano Martello,
Erwin Pesch:
Logistics: From theory to application (ECCO XIV).
European Journal of Operational Research 162(1): 1-3 (2005) |
15 | EE | Tamás Kis,
Erwin Pesch:
A review of exact solution methods for the non-preemptive multiprocessor flowshop problem.
European Journal of Operational Research 164(3): 592-608 (2005) |
14 | EE | Jacek Blazewicz,
Erwin Pesch,
Malgorzata Sterna,
Frank Werner:
The two-machine flow-shop problem with weighted late work criterion and common due date.
European Journal of Operational Research 165(2): 408-415 (2005) |
2004 |
13 | EE | Jacek Blazewicz,
Erwin Pesch,
Malgorzata Sterna,
Frank Werner:
Flow Shop Scheduling with Late Work Criterion - Choosing the Best Solution Strategy.
AACC 2004: 68-75 |
12 | EE | Jacek Blazewicz,
Erwin Pesch,
Malgorzata Sterna,
Frank Werner:
Open shop scheduling problems with late work criteria.
Discrete Applied Mathematics 134(1-3): 1-24 (2004) |
2002 |
11 | EE | Ulrich Dorndorf,
Erwin Pesch,
Toàn Phan Huy:
Constraint Propagation and Problem Decomposition: A Preprocessing Procedure for the Job Shop Problem.
Annals OR 115(1-4): 125-145 (2002) |
2000 |
10 | EE | Ulrich Dorndorf,
Erwin Pesch,
Toàn Phan Huy:
Constraint propagation techniques for the disjunctive scheduling problem.
Artif. Intell. 122(1-2): 189-240 (2000) |
1998 |
9 | | Ulrich Dorndorf,
Andreas Drexl,
Erwin Pesch,
Toàn Phan Huy:
Adaptive Suchverfahren zur Projektplanung bei beschränkten Ressourcen.
KI 12(4): 25-32 (1998) |
1997 |
8 | EE | Erwin Pesch,
Fred Glover:
TSP Ejection Chains.
Discrete Applied Mathematics 76(1-3): 165-181 (1997) |
1995 |
7 | | Yves Crama,
Antoon W. J. Kolen,
Erwin Pesch:
Local Search in Combinatorial Optimization.
Artificial Neural Networks 1995: 157-174 |
6 | EE | Ulrich Dorndorf,
Erwin Pesch:
Evolution based learning in a job shop scheduling environment.
Computers & OR 22(1): 25-40 (1995) |
1994 |
5 | EE | Antoon W. J. Kolen,
Erwin Pesch:
Genetic Local Search in Combinatorial Optimization.
Discrete Applied Mathematics 48(3): 273-284 (1994) |
1991 |
4 | EE | Hans-Jürgen Bandelt,
Erwin Pesch:
Efficient characterizations of n-chromatic absolute retracts.
J. Comb. Theory, Ser. B 53(1): 5-31 (1991) |
1990 |
3 | | Nico L. J. Ulder,
Emile H. L. Aarts,
Hans-Jürgen Bandelt,
Peter J. M. van Laarhoven,
Erwin Pesch:
Genetic Local Search Algorithms for the Travelling Salesman Problem.
PPSN 1990: 109-116 |
1988 |
2 | EE | Erwin Pesch:
Products of absolute retracts.
Discrete Mathematics 69(2): 179-188 (1988) |
1985 |
1 | EE | Erwin Pesch,
Werner Poguntke:
A characterization of absolute retracts of n-chromatic graphs.
Discrete Mathematics 57(1-2): 99-104 (1985) |