Complétion And NotC. Kirchner
List of bibliographic references
Number of relevant bibliographic references: 5.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 000101 | A. Bellanger [France] ; A. Janiak [Pologne] ; M. Y. Kovalyov [Biélorussie] ; A. Oulamara [France] | Scheduling an unbounded batching machine with job processing time compatibilities |
| 000170 | Guillaume Burel [France] ; Claude Kirchner [France] | Regaining cut admissibility in deduction modulo using abstract completion |
| 000411 | Nachum Dershowitz [Israël] ; Claude Kirchner [France] | Abstract canonical presentations |
| 000735 | N. N. Pisaruk [France] | A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time |
| 000D81 | Proceedings/2nd. International conference on rewriting techniques and applications, Bordeaux, France, May 25-27, 1987 |
| This area was generated with Dilib version V0.6.33. |  |