Non-permutation flow shop scheduling with order acceptance and weighted tardiness

作者：

Highlights：

• Model the problem of non-permutation flow shop scheduling with order acceptance.

• The model is transformed to linear MIP that is optimally solved by commercial solver.

• Theorems that are favorable for developing algorithms are presented.

• An efficient two-phase genetic algorithm (TP-GA) is proposed.

• The heuristic yields high quality non-permutation solutions.

摘要

•Model the problem of non-permutation flow shop scheduling with order acceptance.•The model is transformed to linear MIP that is optimally solved by commercial solver.•Theorems that are favorable for developing algorithms are presented.•An efficient two-phase genetic algorithm (TP-GA) is proposed.•The heuristic yields high quality non-permutation solutions.

论文关键词：Flow shop scheduling,Order acceptance,Weighted tardiness,Genetic algorithm

论文评审过程：Received 30 May 2014, Revised 27 July 2015, Accepted 1 August 2015, Available online 28 August 2015, Version of Record 28 August 2015.

论文官网地址：https://doi.org/10.1016/j.amc.2015.08.011