Minimizing total tardiness on two uniform parallel machines considering a cost constraint

作者：

Highlights：

• A mixed integer programming model is constructed for the optimal solutions.

• Heuristic methods and a simulated annealing based algorithm are proposed.

• Experiments indicate that our algorithms can generate satisfactory solutions.

• The time required to run the proposed algorithm is very short.

摘要

•A mixed integer programming model is constructed for the optimal solutions.•Heuristic methods and a simulated annealing based algorithm are proposed.•Experiments indicate that our algorithms can generate satisfactory solutions.•The time required to run the proposed algorithm is very short.

论文关键词：Scheduling,Total tardiness,Uniform parallel machines,Machine cost,Algorithm

论文评审过程：Received 24 August 2018, Revised 31 December 2018, Accepted 2 January 2019, Available online 15 January 2019, Version of Record 19 January 2019.

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