AnswerBun.com

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?

Add your own answers!

Related Questions

CPLEX MIP warm start seems slow down the program?

1  Asked on August 19, 2021 by mengfan-ma

   

Two M/M/1 queues working independently

0  Asked on August 19, 2021 by cookiemonster

 

Scheduling with setup cost

0  Asked on August 19, 2021 by dirk-nachbar

 

MINLP Solution same as Global Optimum?

2  Asked on August 19, 2021 by clement

   

Meta papers on operations research

2  Asked on August 19, 2021 by luke599999

 

How can I use warm start in C#

1  Asked on August 19, 2021 by fhm-ider

   

Feasible sets represented as point clouds

1  Asked on August 19, 2021 by harry-cohen

   

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

0  Asked on August 19, 2021 by brendan-hill

 

Is there any OR way to solve this problem?

3  Asked on August 19, 2021 by samiczy

 

Ask a Question

Get help from others!

© 2022 AnswerBun.com. All rights reserved. Sites we Love: PCI Database, MenuIva, UKBizDB, Menu Kuliner, Sharing RPP