【摘 要】
：
We consider online scheduling in parallel machine environments with machine eligibility constraints and the makespan as objective function.Each job has equa
【出 处】
：
中国运筹学会排序专业委员会第八次代表会议暨2013年学术交流年会
论文部分内容阅读
We consider online scheduling in parallel machine environments with machine eligibility constraints and the makespan as objective function.Each job has equal processing time and arrives over time.We consider the special cases of nested,GoS and tree eligible sets,develop online algorithms,and then prove our algorithms are optimal for these three special cases,respectively.
其他文献
本文针对云服务提供商不断接收到的基础设施服务(Infrastructure-as-a-Service),研究了同时考虑网络带宽和服务器资源的虚拟机(Virtual machines,VMs)动态部署问题,其中
Scheduling is an active field in operations research and theoretical computer science.It has been widely studied and many variants appeared since 1950s.Thou
We consider an integrated production and distribution scheduling problem faced by a typical make-to-order manufacturer which relies on a third-party logisti
排序博弈是产生于两代理相互合作生产过程中产生的一类新型的优化模型，每个代理提供一台设备可供使用，两代理共同处理一批任务。如何把任务分配给两个代理，两个代理如何选择
In this paper we develop a model of distributionally robust generalized assignment problem,where the processing times pij are random variables,instead of fi
研究以最小化最大加权完工时间为目标的排序博弈问题的协调机制.相应的排序博弈模型中,有m台平行机和n个工件,工件j的加工时间为 pj,权重为ωj.每个工件可自主选择机器进
我们在合作博弈论的背景下考虑装箱博弈,是参与者的集合,v是特征函数.考虑k个箱子,分别有体积b_j和n个物品,每个有体积a_i.在这里N包含k个箱子和n个物品.对N 的任意子集S
We consider unrelated parallel machines scheduling problems with resource dependent processing times and deteriorating jobs,i.e.,the actual processing time
This paper addresses the non-preemptively scheduling on two parallel identical machines sharing a single server in charge of loading and unloading jobs.Each
讨论恶化工件两台机器车间作业排序问题。假设工件的实际加工时间是其开始时间的比例函数。目标函数是极小化最大完工时间。分别讨论了流水作业问题和异序作业问题。对于