Flexible Job Shop with Preemption

Operations Research Asked by Robert Hildebrand on January 15, 2021

I’m trying to solve a flexible job shop problem variant that has precedence constraints on jobs along with a few other issues. We have a MIP formulation and also a simulated annealing algorithm to solve at the moment. But now we would like to allow preemption of jobs (leaving a job and coming back to finish it later, possibly times).
Do you have any thoughts on how to model the problem to allow for preemption?

integer programming optimization scheduling simulated annealing solver

Flexible Job Shop with Preemption

Add your own answers!

Related Questions

What is a general procedure to prove that the LP relaxation of an IP delivers the optimal IP solution?

CPLEX MIP warm start seems slow down the program?

(Iterative?) Solutions to a certain quadratic program with non-convex constraints

Problem with implementing squared terms in the objective function

Two M/M/1 queues working independently

Scheduling with setup cost

Is a convex or MILP (without big-M) formulation possible for this problem

MINLP Solution same as Global Optimum?

Linear objective function with non-linear constraints

Meta papers on operations research

Verifying the correctness of KKT conditions

How can I use warm start in C#

Feasible sets represented as point clouds

Is this the same as Agent Based DES or something different?

Column generation when intractable variables appear in the objective function

Is there any OR way to solve this problem?

Find a particular optimal solution

How to find all vertices of a polyhedron

Can every convex problem use Lagrangian dual method?

Does strong duality hold when I dualize only a subset of the constraints?

Ask a Question