典型文献
A Note on Preemptive Scheduling with Multiple Maintenance Activities to Minimize the Total Late Work
文献摘要：
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.
文献关键词：
中图分类号：
作者姓名：
HE Ru-yan;YUAN Jin-jiang;ZHANG Yuan
作者机构：
School of Management Engineering,Zhengzhou University of Aeronautics,Zhengzhou 450046,China;School of Mathematics and Statistics,Zhengzhou University,Zhengzhou 450001,China;School of Sciences,Henan University of Technology,Zhengzhou 450001,China
文献出处：
引用格式：
[1]HE Ru-yan;YUAN Jin-jiang;ZHANG Yuan-.A Note on Preemptive Scheduling with Multiple Maintenance Activities to Minimize the Total Late Work)[J].数学季刊（英文版）,2022(04):331-342
A类：
Preemptive
B类：
Note,Scheduling,Multiple,Maintenance,Activities,Minimize,Total,Late,Work,We,study,single,machine,preemptive,scheduling,problem,multiple,maintenance,activities,minimize,total,work,which,jobs,must,be,processed,space,not,occupied,by,intervals,For,this,we,present,polynomial,algorithm,determine,optimal,schedule,establish,formula,expression,value,Moreover,our,result,used,correct,some,minor,errors,literature,related,one,activity
AB值：
0.635474
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
