This paper investigates the preemptive scheduling with release dates on a single machine to minimize the total weighted late work.We firstly present an O(nlogn)-time algorithm for the single-agent problem with disagre...This paper investigates the preemptive scheduling with release dates on a single machine to minimize the total weighted late work.We firstly present an O(nlogn)-time algorithm for the single-agent problem with disagreeable weights and due dates.And then,we extendedly study the two-agent Pareto-scheduling problem with jobs having a common due date to minimize each agent's total weighted late work,and give a polynomial-time algorithm that is based on the parameters analysis to generate the Pareto frontier.展开更多
基金the National Natural Science Foundation of China(Nos.12071442,11771406,and 11971443).
文摘This paper investigates the preemptive scheduling with release dates on a single machine to minimize the total weighted late work.We firstly present an O(nlogn)-time algorithm for the single-agent problem with disagreeable weights and due dates.And then,we extendedly study the two-agent Pareto-scheduling problem with jobs having a common due date to minimize each agent's total weighted late work,and give a polynomial-time algorithm that is based on the parameters analysis to generate the Pareto frontier.
