scientific article; zbMATH DE number 1600182
From MaRDI portal
Publication:2715768
Cited in
(5)- The multi-spreader crane scheduling problem: partitions and supersequences
- Comparison of some descriptional complexities of 0L systems obtained by a unifying approach
- Decidability of code properties
- Scheduling tasks on a flexible manufacturing machine to minimize tool change delays
- Sequential grammars and automata with valences
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2715768)