Publication | Date of Publication | Type |
---|
A data structure for efficiently managing a set of energy functions | 2022-10-18 | Paper |
Polynomial algorithms for some scheduling problems with one nonrenewable resource | 2022-02-21 | Paper |
An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem | 2020-05-27 | Paper |
Lower bounds for the event scheduling problem with consumption and production of resources | 2017-12-20 | Paper |
The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks | 2017-04-04 | Paper |
The data transfer problem in a system of systems | 2016-10-06 | Paper |
A GRASP metaheuristic for the robust mapping and routing of dataflow process networks on manycore architectures | 2015-09-17 | Paper |
A preemptive bound for the resource constrained project scheduling problem | 2014-08-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q2861503 | 2013-11-08 | Paper |
Integer preemptive scheduling on parallel machines | 2013-03-05 | Paper |
Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage | 2012-11-15 | Paper |
Dominance rules in combinatorial optimization problems | 2012-05-14 | Paper |
New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem | 2012-02-04 | Paper |
Exact methods for the robotic cell problem | 2012-01-26 | Paper |
Task Ordering and Memory Management Problem for Degree of Parallelism Estimation | 2011-08-17 | Paper |
Properties of optimal schedules in preemptive shop scheduling | 2011-03-10 | Paper |
The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm | 2010-04-28 | Paper |
An optimization-based heuristic for the robotic cell problem | 2009-11-27 | Paper |
Integrality Property in Preemptive Parallel Machine Scheduling | 2009-08-18 | Paper |
Approximate solution of a resource-constrained scheduling problem | 2009-03-31 | Paper |
A new exact method for the two-dimensional bin-packing problem with fixed orientation | 2008-01-21 | Paper |
A new constraint programming approach for the orthogonal packing problem | 2007-10-19 | Paper |
Dominance-based heuristics for one-machine total cost scheduling problems | 2007-10-10 | Paper |
A new exact method for the two-dimensional orthogonal packing problem | 2007-08-27 | Paper |
On a resource-constrained scheduling problem with application to distributed systems reconfiguration | 2007-07-04 | Paper |
New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation | 2007-02-26 | Paper |
Computing redundant resources for the resource constrained project scheduling problem | 2006-11-15 | Paper |
Heuristic and metaheuristic methods for computing graph treewidth | 2006-07-11 | Paper |
Jackson's pseudo-preemptive schedule and cumulative scheduling problems | 2005-01-31 | Paper |
A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates | 2004-08-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q4426346 | 2003-09-16 | Paper |
On linear lower bounds for the resource constrained project scheduling problem. | 2003-07-30 | Paper |
Improving the finite element ordering for the frontal solver | 2002-02-12 | Paper |
Evaluating network reliability and 2-edge-connected reliability in linear time for bounded pathwidth graphs | 2001-01-11 | Paper |
A new LP-based lower bound for the cumulative scheduling problem | 2000-12-19 | Paper |
An Exact Method for Solving the Multi-Processor Flow-Shop | 2000-08-24 | Paper |
Assigning spare capacities in mesh survivable networks | 2000-01-01 | Paper |
An exact method for minimizing the makespan of an application processed on a master slave bus oriented multiprocessor system | 1999-06-28 | Paper |
Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem | 1998-12-06 | Paper |
Two branch and bound algorithms for the permutation flow shop problem | 1998-11-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q4353616 | 1998-04-22 | Paper |
Reliability evaluation of large telecommunication networks | 1998-02-24 | Paper |
Décomposition d'une application sur une architecture bus : propriétés des ordonnancements optimaux | 1997-12-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q5687266 | 1997-06-09 | Paper |
A decomposition algorithm for network reliability evaluation | 1996-10-24 | Paper |
Adjustment of heads and tails for the job-shop problem | 1995-01-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4313072 | 1994-11-10 | Paper |
Probabilistic approach to the satisfiability problem | 1991-01-01 | Paper |
Factoring and reductions for networks with imperfect vertices | 1991-01-01 | Paper |
Une méthode arborescente pour résoudre les problèmes cumulatifs | 1991-01-01 | Paper |
A practical use of Jackson's preemptive schedule for solving the job shop problem | 1990-01-01 | Paper |
An Algorithm for Solving the Job-Shop Problem | 1989-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3820002 | 1988-01-01 | Paper |
Scheduling jobs with release dates and tails on identical machines to minimize the makespan | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3723699 | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3675537 | 1985-01-01 | Paper |
The one-machine sequencing problem | 1982-01-01 | Paper |
Un domaine très ouvert : les problèmes d'ordonnancement | 1982-01-01 | Paper |
Ordonnancements à contraintes disjonctives | 1978-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4108133 | 1975-01-01 | Paper |