Online bounded-batch scheduling to minimize total weighted completion time on parallel machines

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

【摘要】

：

　　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

【作者】

：

Ran Ma Long Wan Jinjiang Yuan

【机构】

：

SchoolofMathematicsandStatistics,ZhengzhouUniversity,Zhengzhou450001;DepartmentofMathematicsandInfor

【出处】

：

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

【发表日期】

：

2013年10期

下载到本地 , 更方便阅读

下载此文赞助VIP

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

论文部分内容阅读

　　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 arriving online over time has to be scheduled on m given machines,where the information of each job including its processing time and weight is not known in advance.

其他文献

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

　　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的特点，设计了基于排列的编码和解码方式，建立了描述问题解空间分布的概率模型，进而提出了一

会议

半导体最终测试调度分布估计算法概率模型

Online tradeoff scheduling on a single machine to minimize makespan and maximumlateness

　　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

会议

Discrete lot-sizing with major joint setups and minor sequence dependent product setups

　　论文研究面向订单装配(assemble to order)环境下一组相近产品的生产调度问题，给定计划期各时段每种产品的出产计划，若一时段安排任意产品的生产，便会产生一笔主调整费用，同

会议

On-line scheduling on parallel machines to minimize the makespan

　　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

会议

Combinations of Shop Scheduling and the Shortest Path Problem

　　We consider several novel combinatorial optimization problems,which combine the classic shop scheduling problems(namely,flow shop scheduling,open shop sched

会议

approximation algorithmcombination of optimization problemsflow shopopen shop

Parallel-batch scheduling of deteriorating jobs with release dates and rejection

　　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

会议

Batch schedulingDeteriorating jobsRejectionFully polynomial time approximatio

竞争环境下固定航线航速优化与船期设计

　　持续增长的油价使得船舶公司不得不降低航速，以降低燃油成本。一条航线上往往有多家船公司在运营，在差异化竞争原则下，根据不同客户的选择偏好，本文提出的航速优化模型考虑了

会议

航速优化差异化降价

Online bounded-batch scheduling to minimize total weighted completion time on parallel machines

其他学术论文