论文部分内容阅读
论文研究面向订单装配(assemble to order)环境下一组相近产品的生产调度问题，给定计划期各时段每种产品的出产计划，若一时段安排任意产品的生产，便会产生一笔主调整费用，同期生产的产品转产之产生次调整费用，且该费用与产品加工顺序相关，论文开发一个启发式算法，并对算法性能进行评估。
Discrete lot-sizing with major joint setups and minor sequence dependent product setups
【摘 要】
：
论文研究面向订单装配(assemble to order)环境下一组相近产品的生产调度问题，给定计划期各时段每种产品的出产计划，若一时段安排任意产品的生产，便会产生一笔主调整费用，同
【机 构】
：
暨南大学管理学院
【出 处】
：
中国运筹学会排序专业委员会第八次代表会议暨2013年学术交流年会
【发表日期】
：
2013年10期
其他文献
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
会议
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
会议
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
会议