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á bibliografia

Vydané v:	Computers & industrial engineering Ročník 142; s. 106347
Hlavní autori:	Meng, Leilei, Zhang, Chaoyong, Ren, Yaping, Zhang, Biao, Lv, Chang
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.04.2020
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!