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

Full description

Bibliographic Details

Published in:	Computers & industrial engineering Vol. 142; p. 106347
Main Authors:	Meng, Leilei, Zhang, Chaoyong, Ren, Yaping, Zhang, Biao, Lv, Chang
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.04.2020
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!