典型文献
Online Parallel-Batch Machines Scheduling with a Single Server
文献摘要：
We consider parallel-batch machines scheduling problem with a single server to minimize the maximum completion time.Jobs arrive over time.Every batch has to be loaded by the sever before being processed on machines.The loading(setup)operation of a batch occurs only when some machine is idle,and the server can perform only one setup operation every time.For some special case,we provide a best possible online algorithm with competitive ratio(√5+1)/2.For general case,we give another online algorithm with competitive ratio 3.
文献关键词：
中图分类号：
作者姓名：
FU Ru-yan;LIN Lin
作者机构：
School of Mathematics,China University of Mining and Technology,Xuzhou 221116,China;Institute of Technology and Standards Research,China Academy of Information and Communication Technology,Beijing 100191,China;Key Laboratory of Internet of Vehicle Technical Innovation and Testing(CAICT),Ministry of Industry and Information Technology,Beijing 100191,China.
文献出处：
引用格式：
[1]FU Ru-yan;LIN Lin-.Online Parallel-Batch Machines Scheduling with a Single Server)[J].数学季刊（英文版）,2022(04):403-411
A类：
B类：
Online,Parallel,Batch,Machines,Scheduling,Single,Server,We,consider,parallel,batch,machines,scheduling,problem,single,server,minimize,maximum,completion,Jobs,arrive,over,Every,has,loaded,by,sever,before,being,processed,loading,setup,operation,occurs,only,when,some,is,idle,can,perform,one,every,For,special,case,we,provide,best,possible,online,algorithm,competitive,5+1,general,give,another
AB值：
0.704233
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
