#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2006

2015

- This year (0)
- Last 5 years (1)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Yann Hendel, Francis Sourd
- Computers & OR
- 2007

- Yann Hendel, Francis Sourd
- European Journal of Operational Research
- 2006

- Yann Hendel, Nina Runge, Francis Sourd
- Discrete Optimization
- 2009

This paper investigates thenotion of preemption in scheduling,with earliness and tardiness penalties. Starting from the observation that the classical cost model where penalties only depend on completion times does not capture the just-in-time philosophy, we introduce a new model where the earliness costs depend on the start times of the jobs. To solve this… (More)

- Yann Hendel, Wieslaw Kubiak, Denis Trystram
- J. Scheduling
- 2015

This paper deals with the decompositions of a flow into paths. Given a weighted directed acyclic graph and a compatible flow, we look for a decomposition of this flow such that the longest path stemming from this decomposition is the shortest possible. The complexity of this problem and some of its particular cases are first addressed, then a… (More)

- Yann Hendel, Francis Sourd
- 2006

We use the Akers-Friedman geometric approach to solve the two jobs job-shop problem when there is an earliness cost on the first operation and a tardiness cost on the last operation of each job. We then generalize the problem by imposing earliness and tardiness costs on each operation and finally, we solve it using a dynamic programming algorithm.… (More)

- ‹
- 1
- ›