Thread: Scheduling, as in Pinedo, job shops, and network flow

Is anyone here interested in scheduling, as in Pinedo's textbook, the problems of single and parallel machines, the job shop as opposed to the open shop, etc.?

I've been interested in it for some time.

In particular, I want to look at it as it relates to the network flow problem.

One can solve a scheduling problem by setting up a particular directed acyclic graph and then adding certain directed edges to indicate a precedence relationship.

This is great in theory, but I think I need to write some code and solve some problems before I can really explain it. Possibly this forum would be a good place to post that code.

At one time I managed workflow through a small manufacturing unit, so I have a passing (and largely forgotten) familiarity with your topic. I shall watch what develops with interest, but am unlikely to be able to offer much of substance.

Originally Posted by Ophiolite

At one time I managed workflow through a small manufacturing unit, so I have a passing (and largely forgotten) familiarity with your topic. I shall watch what develops with interest, but am unlikely to be able to offer much of substance.

Hmm... it looks like there are very few folks into production scheduling here... well, it's not like huge numbers of people study the subject, I guess.

Just to move things along, I should mention that I got interested in operations research because of the network flow problem, which is a very fun problem I found through graph theory. It's useful for logistics and many, many other things.