典型文献
Research on Unbounded Parallel-Batch Scheduling with Jobs Having Set-Up Times
文献摘要：
We study the scheduling on an unbounded parallel-batch machine with jobs having set-up times to minimize a regular objective function which is either of the sum-form or of the max-form.As we know,in the existing literature,the research about parallel-batch scheduling does not consider the set-up times of jobs.However,the set-up times of jobs are widely presented in practical applications.Each job considered in this paper has a set-up time.The set-up time of each batch is equal to the maximum set-up time of all jobs contained in the batch,and the processing time of each batch is equal to the longest processing time of the jobs contained in the batch.Depending on the different definitions of the completion time of a job,we consider two types of jobs:batch jobs and drop-line jobs.For batch jobs,the completion time of a job is given by the completion time of the batch containing this job.For drop-line jobs,the completion time of a job is given by the starting time of the batch containing this job plus the processing time of this job.In this paper,we give pseudo-polynomial time algorithms for the above scheduling problems in which the jobs have agreeable processing times and set-up times.In addition,when the objective functions are the total weighted completion time,the maximum lateness,and the maximum cost,we present a polynomial time algorithm,respectively.
文献关键词：
中图分类号：
作者姓名：
GAO Yuan;DANG Jia-rui;PENG Juan
作者机构：
School of Mathematics and Statistics,Zhengzhou University,Zhengzhou 450001,China
文献出处：
引用格式：
[1]GAO Yuan;DANG Jia-rui;PENG Juan-.Research on Unbounded Parallel-Batch Scheduling with Jobs Having Set-Up Times)[J].数学季刊（英文版）,2022(04):422-429
A类：
Unbounded,agreeable,lateness
B类：
Research,Parallel,Batch,Scheduling,Jobs,Having,Set,Up,Times,We,study,scheduling,unbounded,parallel,batch,machine,jobs,having,set,up,times,minimize,regular,objective,which,either,sum,form,know,existing,literature,research,about,does,not,However,are,widely,presented,practical,applications,Each,considered,this,paper,has,each,equal,maximum,contained,processing,longest,Depending,different,definitions,completion,two,types,drop,line,For,given,by,containing,starting,plus,In,pseudo,polynomial,algorithms,above,problems,have,addition,when,functions,total,weighted,cost,respectively
AB值：
0.368181
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
