Logic-based benders decomposition methods for the distributed flexible job shop scheduling problem

The Distributed Flexible Job Shop Scheduling Problem (DFJSP) is a well-known NP-hard optimization problem with widespread applications in production scheduling. It involves assigning jobs to factories, allocating operations to machines, and sequencing operations on each machine, which presents signi...

Full description

Bibliographic Details

Published in:	European journal of operational research
Main Authors:	Xiong, Fuli, Liu, Hengchong
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.09.2025
Subjects:	Constraint programming Distributed flexible job shop scheduling problem Local search Logic-based benders decomposition Mixed integer linear programming Local search Mixed integer linear programming Logic-based benders decomposition Distributed flexible job shop scheduling problem Constraint programming
ISSN:	0377-2217
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!