【摘 要】
：
We study two models of scheduling games: load-balancing games with and without activation costs,where every job corresponds to a self-interested player who
【机 构】
：
SchoolofManagement,QufuNormalUniversity,Rizhao276826
【出 处】
：
中国运筹学会排序专业委员会第八次代表会议暨2013年学术交流年会
论文部分内容阅读
We study two models of scheduling games: load-balancing games with and without activation costs,where every job corresponds to a self-interested player who chooses a machine with the objective of minimizing its individual cost.With activation costs,a jobs cost is composed of both its machines load and its share(proportionally)in the machines activation cost,where there are unlimited number of identical machines available.Without activation costs,a jobs cost is just its machines load,where the number of the identical machines is limited.
其他文献
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
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
半导体最终测试调度问题(SFTSP)关系到半导体制造企业的生产效率。本文针对SFTSP的特点，设计了基于排列的编码和解码方式，建立了描述问题解空间分布的概率模型，进而提出了一
We consider the following single machine online tradeoff scheduling problem.A set of n independent jobs arrive online over time.Each job Jj has a release da
论文研究面向订单装配(assemble to order)环境下一组相近产品的生产调度问题，给定计划期各时段每种产品的出产计划，若一时段安排任意产品的生产，便会产生一笔主调整费用，同
We consider the parallel machine scheduling problem,minimizing the makespan,where jobs arrive over time,(Ⅰ)on two uniform machines with speeds 1 and s≥1,a
We consider several novel combinatorial optimization problems,which combine the classic shop scheduling problems(namely,flow shop scheduling,open shop sched
We consider the problem of scheduling n deteriorating jobs with release dates on a single batching machine.Each job is either accepted and processed in batc
持续增长的油价使得船舶公司不得不降低航速，以降低燃油成本。一条航线上往往有多家船公司在运营，在差异化竞争原则下，根据不同客户的选择偏好，本文提出的航速优化模型考虑了
We consider the online bounded-batch scheduling to minimize total weighted completion time on parallel machines.In the problem,a set of n independent jobs a