Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem

•Four different MILP models based on four different modeling ideas are proposed.•A constraint programming (CP) model is designed.•MILP and CP models prove the optimality of 62 benchmark instances.•CP model obtains new best solutions for 11 benchmark instances. This paper intends to address the distr...

Celý popis

Podrobná bibliografie

Vydáno v:	Computers & industrial engineering Ročník 142; s. 106347
Hlavní autoři:	Meng, Leilei, Zhang, Chaoyong, Ren, Yaping, Zhang, Biao, Lv, Chang
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 01.04.2020
Témata:	Constraint programming Distributed flexible job shop scheduling problem Makespan Mixed integer linear programming Makespan Mixed integer linear programming Distributed flexible job shop scheduling problem Constraint programming
ISSN:	0360-8352, 1879-0550
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!