单机不同尺寸工件批调度问题的优化算法

研究了单机环境下不同尺寸工件的批调度问题,引入微粒群算法对制造跨度进行优化.首先给出了问题的微粒表达形式,并根据问题的离散优化特性对微粒状态的更新方法进行了改进;然后将微粒群算法和分批的启发式算法进行有效结合,改善近似解的质量.实验中对各类不同规模的算例均进行了仿真,结果表明了微粒群算法的有效性.     

公共交货期窗口的单机随机调度问题

讨论一类具有随机加工时间的单机调度问题,所有工件设置一个公共交货期窗口,每个工件的加工时间服从正态分布,目标是确定n个独立工件的一个排序,使工件的提前／延期之和与完工时间之和的线性组合之期望值最小。问题的最优解具有v-型特征。     

A Heuristic for the Job Scheduling Problem with a Common Due Window on Parallel and Non-Identical Machines

1. INTroDUCTIONThe emergence of JIT (Just in Time) management tee~gy opens up a recency research field for the jobscheduling and production managemellt. As its farther develOPment, the earnness-tardiness job schedulingproblem becomes a hot research point over y6ars. conference [1] gives a review on job scheduling problem withearnness and tardiness penalties. Reference [2] p~s another scheduling problem for minimizing the rangeof lateness on a single machine, and reference [3] giVes a he…