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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & industrial engineering Jg. 142; S. 106347
Hauptverfasser:	Meng, Leilei, Zhang, Chaoyong, Ren, Yaping, Zhang, Biao, Lv, Chang
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 01.04.2020
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!