Anticipation and flexibility in dynamic scheduling¶

Problem Description¶

Scheduling on a rolling planning horizon

Why was tailoring needed?¶

The time linkage in the problem makes it sub-optimal to optimise over each horizon.

Baseline algorithm¶

Evolutionary algorithm

Tailoring process¶

Modify the objective function to make sure the resulting solution will remain flexible in future time steps, by penalising early idle time.

What was tailored¶

Objective function

Main problem characteristics¶

rolling time horizon; new jobs arriving over time

References¶

Branke, J., & Mattfeld, D. C. (2005). Anticipation and flexibility in dynamic scheduling. International Journal of Production Research, 43(15), 3103–3129. https://doi.org/10.1080/00207540500077140

Contact information (optional)¶

juergen.branke@wbs.ac.uk

Author¶

Juergen Branke No response