Single-Machine Preemptive Scheduling with Release Dates Involving the Total Weighted Late Work Criterion

作     者：Zhi-Chao Geng Yuan Zhang Zhi-Chao Geng;Yuan Zhang

作者机构：School of Mathematics and StatisticsZhengzhou UniversityZhengzhouHenan450001China 

出 版 物：《Journal of the Operations Research Society of China》 (中国运筹学会会刊（英文）)

年 卷 期：2023年第11卷第3期

页      面：693-706页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 0701[理学-数学] 070101[理学-基础数学] 

基　　金：the National Natural Science Foundation of China(Nos.12071442 11771406 and 11971443) 

主　　题：Preemptive scheduling Total weighted late work Two agent Pareto frontier 

摘      要：This paper investigates the preemptive scheduling with release dates on a single machine to minimize the total weighted late *** firstly present an O(nlogn)-time algorithm for the single-agent problem with disagreeable weights and due *** 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.