# What problems can I reduce Job Shop Scheduling to them [closed]

I want to know which problems are harder than Job Shop Scheduling so I can reduce JSP to them.

Sorry I am new to these problems and looking for a source to know what are problems, what are their hardness variations and more ...

## closed as too broad by Juho, David Richerby, Evil, Raphael♦Nov 14 '16 at 19:47

Please edit the question to limit it to a specific problem with enough detail to identify an adequate answer. Avoid asking multiple distinct questions at once. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.

• There are infinitely many problems that are harder than any given problem, so I don't think your question is really answerable. – David Richerby Nov 14 '16 at 18:44
• Plus, different variants of Job Shop Scheduling have different complexities. – Raphael Nov 14 '16 at 19:47
• I saw an article (published in the 1960s) that proposed a 01 Integer Programming formulation for machine scheduling problems. I forgot the title of the article and the name of the author. You might want to look at "Machine Scheduling Problems: Classification, Complexity and Computations" by A.H.G. Rinooy Kan. – John Frederick Chionglo Nov 15 '16 at 13:18