| Publication | Date of Publication | Type |
|---|
Anchor-robust project scheduling with non-availability periods
Discrete Optimization | 2025-01-23 | Paper |
Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems
Journal of Scheduling | 2025-01-07 | Paper |
The Anchor-Robust Project Scheduling Problem
Operations Research | 2024-03-15 | Paper |
Dominance-based linear formulation for the anchor-robust project scheduling problem
European Journal of Operational Research | 2021-11-05 | Paper |
Reactive and proactive single-machine scheduling to maintain a maximum number of starting times
Annals of Operations Research | 2021-05-05 | Paper |
| Anchored rescheduling problems under generalized precedence constraints | 2021-02-04 | Paper |
Maximizing the number of jobs scheduled at their baseline starting times in case of machine failures
Journal of Scheduling | 2020-03-10 | Paper |
Anchored reactive and proactive solutions to the CPM-scheduling problem
European Journal of Operational Research | 2018-05-29 | Paper |
A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines
Discrete Applied Mathematics | 2018-05-24 | Paper |
On scheduling with the non-idling constraint
Annals of Operations Research | 2016-07-22 | Paper |
The location-dispatching problem: polyhedral results and content delivery network design
Discrete Applied Mathematics | 2015-09-22 | Paper |
Network sharing by two mobile operators: beyond competition, cooperation
RAIRO - Operations Research | 2015-08-14 | Paper |
A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem
Discrete Optimization | 2015-04-09 | Paper |
On scheduling with the non-idling constraint
4OR | 2014-09-18 | Paper |
Homogeneously non-idling schedules of unit-time jobs on identical parallel machines
Discrete Applied Mathematics | 2014-04-16 | Paper |
Integrated batch sizing and scheduling on a single machine
Journal of Scheduling | 2014-02-05 | Paper |
| The location-dispatching problem: polyhedral results and content delivery network design | 2013-11-08 | Paper |
| scientific article; zbMATH DE number 5823930 (Why is no real title available?) | 2010-12-08 | Paper |
On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups
Discrete Applied Mathematics | 2010-04-28 | Paper |
On single-machine scheduling without intermediate delays
Discrete Applied Mathematics | 2008-11-19 | Paper |
Biclique completion problems for multicast network design
Discrete Optimization | 2008-05-14 | Paper |
PERT scheduling with convex cost functions.
Theoretical Computer Science | 2003-01-22 | Paper |
A cutting plane algorithm for the unrelated parallel machine scheduling problem
European Journal of Operational Research | 2002-11-17 | Paper |
Fiber-to-object assignment heuristics
European Journal of Operational Research | 2002-11-17 | Paper |
Tabu search method for multiprocessor scheduling with communication delays
RAIRO. Operations Research | 2001-05-06 | Paper |
Minimizing the earliness and tardiness cost of a sequence of tasks on a single machine.
RAIRO. Operations Research | 2001-01-01 | Paper |
Minimizing the earliness and tardiness cost of a sequence of tasks on a single machine.
RAIRO. Operations Research | 2001-01-01 | Paper |
Minimizing the earliness and tardiness cost of a sequence of tasks on a single machine.
RAIRO. Operations Research | 2001-01-01 | Paper |
On Graham's bound for cyclic scheduling
Parallel Computing | 2000-08-21 | Paper |
List schedules for cyclic scheduling
Discrete Applied Mathematics | 1999-06-28 | Paper |
Tree scheduling with communication delays
Discrete Applied Mathematics | 1994-11-17 | Paper |
Task scheduling with interprocessor communication delays
European Journal of Operational Research | 1993-01-16 | Paper |
C.P.M. Scheduling with Small Communication Delays and Task Duplication
Operations Research | 1992-06-26 | Paper |
The basic cyclic scheduling problem with deadlines
Discrete Applied Mathematics | 1991-01-01 | Paper |
A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
European Journal of Operational Research | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4092766 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 3887078 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3896317 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3921988 (Why is no real title available?) | 1984-01-01 | Paper |
Chemins extrémaux d'un graphe doublement valué
RAIRO - Operations Research | 1984-01-01 | Paper |
Un domaine très ouvert : les problèmes d'ordonnancement
RAIRO - Operations Research | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3673846 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3694917 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3468545 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3459675 (Why is no real title available?) | 1974-01-01 | Paper |
