AAAAAA

   
Results: 1-7 |
Results: 7
Solving the open shop scheduling problem
Authors: Dorndorf, U Pesch, E Phan-Huy, T
Citation: U. Dorndorf et al., Solving the open shop scheduling problem, J SCHED, 4(3), 2001, pp. 157-174
Editors' preface
Authors: Brucker, P Drexl, A Mohring, RH Neumann, E Pesch, E
Citation: P. Brucker et al., Editors' preface, MATH M O R, 52(3), 2000, pp. 353-354
A branch-and-bound algorithm for the resource-constrained project scheduling problem
Authors: Dorndorf, U Pesch, E Phan-Huy, T
Citation: U. Dorndorf et al., A branch-and-bound algorithm for the resource-constrained project scheduling problem, MATH M O R, 52(3), 2000, pp. 413-439
A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints
Authors: Dorndorf, U Pesch, E Phan-Huy, T
Citation: U. Dorndorf et al., A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints, MANAG SCI, 46(10), 2000, pp. 1365-1384
Constraint propagation techniques for the disjunctive scheduling problem
Authors: Dorndorf, U Pesch, E Toan, PH
Citation: U. Dorndorf et al., Constraint propagation techniques for the disjunctive scheduling problem, ARTIF INTEL, 122(1-2), 2000, pp. 189-240
Optimal workload allocation between a job shop and an FMS
Authors: Tetzlaff, UAW Pesch, E
Citation: Uaw. Tetzlaff et E. Pesch, Optimal workload allocation between a job shop and an FMS, IEEE ROBOT, 15(1), 1999, pp. 20-32
Efficient facility layout planning in a maximally planar graph model
Authors: Pesch, E Glover, F Bartsch, T Salewski, F Osman, I
Citation: E. Pesch et al., Efficient facility layout planning in a maximally planar graph model, INT J PROD, 37(2), 1999, pp. 263-283
Risultati: 1-7 |