Real-world PFSP examples - permutation flow problem?

Question

As part of a larger academic project, I am dealing with algorithms that solve the PFSP problem. Anyone have any good real examples of this problem? Almost any previous work on this topic that I read uses a rather abstract example of a toy workshop.

I was thinking about the process of building code, for example. in C: preprocessor → compiler → linker, but this will only be true if the object files were independent of each other, i.e. no need to bind to each other.

Any ideas?

Answer 1

It made me think about the 2012 ROADEF / EURO Challenge (sponsored by Google!) If this is not an interesting real use, I don’t know what it is :)

http://challenge.roadef.org/2012/en/index.php