Two-agent scheduling problems on a single machine

来源 :中国运筹学会排序专业委员会第八次代表会议暨2013年学术交流年会 | 被引量 : 0次 | 上传用户：qdled2046

【摘要】

：

　　In this paper,two-agent scheduling problems are presented.Two agents compete to perform their respective jobs on a common single machine and each agent has

【作者】

：

张新功

【机构】

：

重庆大学

【出处】

：

中国运筹学会排序专业委员会第八次代表会议暨2013年学术交流年会

【发表日期】

：

2013年10期

下载到本地 , 更方便阅读

下载此文赞助VIP

声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架

论文部分内容阅读

　　In this paper,two-agent scheduling problems are presented.Two agents compete to perform their respective jobs on a common single machine and each agent has his own criterion to optimize.The objective functions we consider are the weighted number of tardy jobs,total weighted late work,total completion time and maximum cost.

其他文献

　　We consider unrelated parallel machines scheduling problems with resource dependent processing times and deteriorating jobs,i.e.,the actual processing time

会议

Parallel machine scheduling with a single serverloading and unloading

　　This paper addresses the non-preemptively scheduling on two parallel identical machines sharing a single server in charge of loading and unloading jobs.Each

会议

恶化工件两台机器车间作业排序问题

　　讨论恶化工件两台机器车间作业排序问题。假设工件的实际加工时间是其开始时间的比例函数。目标函数是极小化最大完工时间。分别讨论了流水作业问题和异序作业问题。对于

会议

Online Scheduling problem with equal processing time and machine eligibility

　　We consider online scheduling in parallel machine environments with machine eligibility constraints and the makespan as objective function.Each job has equa

会议

On the asymptotic optimality of heuristics for open shop scheduling problems

　　The open shop scheduling problem widely exists in the real world,in fields such as vehicle repair and health care.Usually,a set of n jobs and m ≥ 2 machine

会议

若干复杂机器环境的现代排序研究

　　现代排序的一种发展趋势是机器的环境趋于复杂化，本报告介绍我们团队近年集中研究的几类复杂机器环境排序，包括具有等级约束的在线排序、带有禁用区间的离线排序以及有库存

会议

On-line algorithms for two-agent scheduling on single machine with release time

　　We consider a two-agent on-line scheduling problem on single machine.There are two disjoint sets of jobs,corresponding to two agents A and B,where jobs arri

会议

工件有到达时间的半在线排序

　　工件有到达时间的在线排序广泛应用于订单排序问题,我们讨论了此问题的目标函数是最小化最大完工时间的半在线列表在线算法(LS 算法)。证明了当到达时间单调不减时LS 算

会议

Scheduling on a single parallel-batch machine with rejection to minimize maximumlateness and total r

　　This paper studies a scheduling problem on a single parallel-batch machine with rejection.In addition to total rejection cost,the scheduling criterion is to

会议

Some improved algorithms for the online scheduling of equal-length jobs with incompatiblefamilies to

　　We first consider the online scheduling of equal-length jobs with incompatible families on m identical batch machines.Each job has a release time,a deadline

会议

Two-agent scheduling problems on a single machine

其他学术论文