Modeling and heuristics for scheduling of distributed job shops

作者：

Highlights：

• This paper deals with the problem of distributed job shop scheduling.

• Two mixed integer linear programming models (sequence- and position-based) are proposed.

• Besides adapting three well-known heuristics, three greedy heuristics are developed.

• Three theorems are defined to analyze redundancy of permutation scheme and used to improve heuristics.

• Comprehensive experiments are conducted to evaluate the performance of the two models and the six developed heuristics.

摘要

•This paper deals with the problem of distributed job shop scheduling.•Two mixed integer linear programming models (sequence- and position-based) are proposed.•Besides adapting three well-known heuristics, three greedy heuristics are developed.•Three theorems are defined to analyze redundancy of permutation scheme and used to improve heuristics.•Comprehensive experiments are conducted to evaluate the performance of the two models and the six developed heuristics.

论文关键词：Distributed job shop scheduling,Mathematical modeling,Greedy heuristics

论文评审过程：Available online 20 June 2014.

论文官网地址：https://doi.org/10.1016/j.eswa.2014.06.023