• Extended abstracts on any theoretical or practical aspects of dynamic scheduling problems are welcome.
• Submitted abstracts should include a precise formulation of presented results, a summary of relevant previous research and a list of basic references. Full proofs are not required but a brief description of reasoning in the proofs should be given.
• The maximum length of an abstract is 6 pages in a standard LaTeX article format, 11pt, including references.