Scheduling Dynamic Job Shops

Add to your list(s) Download to your calendar using vCal

• Dr. Jürgen Branke, Warwick Business School, The University of Warwick
• Monday 23 November 2009, 16:00-17:00
• UG40, School of Computer Science.

If you have a question about this talk, please contact Per Kristian Lehre.

Most practical scheduling problems are dynamic and stochastic: New jobs arrive over time and need to be integrated into the schedule, machines break down, raw material is delivered late, etc. In this talk, we present two quite different approaches to tackle such dynamic scheduling problems. Both utilize evolutionary algorithms, but in very different ways. The first approach is to re-schedule whenever new information becomes available. As we show, it is then advantageous to search for solutions that are not only good with respect to the primary objective (e.g., minimising tardiness), but also flexible and easy to adapt when new information becomes available. Evolutionary algorithms can be modified easily to take this into account. The second approach renounces planning and uses simple priority rules to decide, based on local information, which job should be processed on a machine when this machine becomes available. Such an approach is very popular in practice, but it is quite challenging to design effective priority rules for a particular shop. Here, we demonstrate how evolutionary algorithms can support the design of such priority rules by generating difficult problem instances, highlighting a rule’s weaknesses.

This talk is part of the Artificial Intelligence and Natural Computation seminars series.

This talk is included in these lists:

• Artificial Intelligence and Natural Computation seminars
• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• UG40, School of Computer Science
• computer sience

Note that ex-directory lists are not shown.