TransWikia.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!

Ask a Question

Get help from others!

© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP