【摘 要】
：
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
【出 处】
：
中国运筹学会排序专业委员会第八次代表会议暨2013年学术交流年会
论文部分内容阅读
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 minimize maximum lateness.Four optimization types are considered.The first is to minimize the sum of the two criteria.
其他文献
研究以最小化最大加权完工时间为目标的排序博弈问题的协调机制.相应的排序博弈模型中,有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
讨论恶化工件两台机器车间作业排序问题。假设工件的实际加工时间是其开始时间的比例函数。目标函数是极小化最大完工时间。分别讨论了流水作业问题和异序作业问题。对于
We consider online scheduling in parallel machine environments with machine eligibility constraints and the makespan as objective function.Each job has equa
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
现代排序的一种发展趋势是机器的环境趋于复杂化，本报告介绍我们团队近年集中研究的几类复杂机器环境排序，包括具有等级约束的在线排序、带有禁用区间的离线排序以及有库存
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 算