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

Celý popis

Podrobná bibliografie

Vydáno v:	European journal of operational research
Hlavní autoři:	Xiong, Fuli, Liu, Hengchong
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.09.2025
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!