As the title says, I am looking for a variant of the job shop scheduling problem which allows for non-sequential process plans.

For example, I might have a job whose task-order constraints look like a diamond: task A precedes both B and C, while B and C both precede D (but with no ordering assumed between B and C).

Any suggestions would be appreciated. Thanks!

  • $\begingroup$ Welcome to Computer Science! This is a site of questions and answers. A clearly-stated question is expected. We are not supposed to guess what you want. If you are looking for a problem, you have given an example already. Are you looking for an algorithm to solve that kind of problem? Please be as detailed as possible. What is the input of the problem? What is the expected output? Do you want a few examples or related articles? Please show how much you have searched and investigated. $\endgroup$ – John L. Apr 5 '19 at 22:02

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.