Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost

作者：

Highlights：

• Two-agent Pareto optimization scheduling.

• The number of tardy jobs and the maximum cost.

• Optimal and Pareto optimal schedules.

• Strongly polynomial-time algorithm.

摘要

•Two-agent Pareto optimization scheduling.•The number of tardy jobs and the maximum cost.•Optimal and Pareto optimal schedules.•Strongly polynomial-time algorithm.

论文关键词：Scheduling,Two-agent,Due date,Pareto optimization

论文评审过程：Received 15 March 2015, Revised 21 August 2015, Accepted 20 October 2015, Available online 12 November 2015, Version of Record 12 November 2015.

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