| | |
- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 3 |      | A. Bellanger, Adam Janiak, Mikhail Y. Kovalyov, Ammar Oulamara: Scheduling an unbounded batching machine with job processing time compatibilities. Discrete Applied Mathematics 160(1-2): 15-23 (2012) |
| 2010 | ||
| 2 | | A. Bellanger, Ammar Oulamara, Mikhail Y. Kovalyov: Minimizing total completion time on a batching machine with job processing time compatibilities. Electronic Notes in Discrete Mathematics 36: 1295-1302 (2010) |
| 2009 | ||
| 1 | | A. Bellanger, Ammar Oulamara: Scheduling hybrid flowshop with parallel batching machines and compatibilities. Computers & OR 36(6): 1982-1992 (2009) |
| 1 | Adam Janiak | [3] |
| 2 | Mikhail Y. Kovalyov | [2] [3] |
| 3 | Ammar Oulamara | [1] [2] [3] |
Data released under the ODC-BY 1.0 license — See also our legal information page