I have a FJSSP that I would like to solve. However, the jobs in this problem have deadlines and in addition there are setup times between two jobs. Because of this, my objective function is not just the makespan but rather a more complex (nonlinear)combination between makespan and tardiness (with respect to given deadlines) of the execution of the jobs.
I was thus wondering which solvers are available right now which offer flexibility to modify my objective functions. Or, in general, how are practitioners tackling these problems in industry currently? Can you please help?