We study the single-machine preemptive scheduling problem with multiple maintenance activities to minimize the total late work,in which the jobs must be processed in the time space not occupied by the maintenance inte...We study the single-machine preemptive scheduling problem with multiple maintenance activities to minimize the total late work,in which the jobs must be processed in the time space not occupied by the maintenance intervals.For this problem,we present a polynomial algorithm to determine the optimal schedule and establish a formula expression to the optimal value.Moreover,our result is used to correct some minor errors in the literature related to the single-machine(preemptive or non-preemptive)scheduling with one maintenance activity to minimize the total late work.展开更多
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.展开更多
基金Supported by National Natural Science Foundation of China(Grant Nos.12071442,12201186).
文摘We study the single-machine preemptive scheduling problem with multiple maintenance activities to minimize the total late work,in which the jobs must be processed in the time space not occupied by the maintenance intervals.For this problem,we present a polynomial algorithm to determine the optimal schedule and establish a formula expression to the optimal value.Moreover,our result is used to correct some minor errors in the literature related to the single-machine(preemptive or non-preemptive)scheduling with one maintenance activity to minimize the total late work.
基金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.
