排序方式: 共有6条查询结果,搜索用时 281 毫秒
1
1.
时凌 《湖北民族学院学报(哲学社会科学版)》1998,(6)
在变换条件下对于JIT准时生产制排序问题中的一种特殊情况──排序问题中只含超前损失和延误损失,得到最优序列的一些条件。 相似文献
2.
The problem of minimizing the mean squared deviation (MSD) of completion times from a common due date in both unconstrained and constrained cases is addressed. It is shown that the unconstrained MDS function is unimodal for n ≤ 6, where n is the number of jobs. The constrained case is shown to be unimodular for n ≤ 3, The unconstrained case is shown, by counterexample, not to be unimodular for n = 8. The constrained case is shown not to be unimodular for n = 5. For the unimodular cases, a proposed search routine can find the optimum solution in less than three CPU seconds for n = 100. It provides an excellent heuristic solution otherwise. Computational results are shown in both cases. 相似文献
3.
混合离散差分进化算法在单机批处理调度中的应用 总被引:1,自引:1,他引:0
本文研究单机批处理调度问题,批处理机有批次容量限制,批处理时间由每个批次所含作业中的最长作业处理时间决定。每个作业具有不同的大小、处理时间、提前拖期惩罚权重,所有作业具有公共交货期,且交货期无限晚。目标函数为最小化所有作业的加权提前拖期惩罚之和。该问题已被证明为NP难题,本研究找到了其最优解具有的一些性质,在此基础上利用它们提出了一种动态规划(DP)与差分进化(DE)算法相结合的混合离散差分进化(HDDE)算法来求解该问题,通过与传统的遗传算法、模拟退火算法和迭代贪婪算法进行对比,HDDE算法显示了更加强大的全局搜索能力。 相似文献
4.
5.
HÜSEYIN SARPER 《生产规划与管理》2013,24(2):185-192
Abstract. This paper investigates the effects of four simple dispatching rules on just-in-time production related performance measures of mean and maximum absolute lateness. The rules used are modified due date (MDD), shortest processing time (SPT), earliest due date (EDD), and first in first out (FIFO). A single machine is used under three utilization levels. Due-dates are set according to total work content rule. The results indicate that each rule performs well under certain conditions. The MDD rule is the best one to minimize mean absolute lateness. The EDD and FIFO rules do well in minimizing the maximum absolute lateness. Economic interpretation of these performance measures are also discussed. 相似文献
6.
GUR MOSHEIOV 《生产规划与管理》2013,24(4):401-406
The option of pre-emption seems to have escaped the attention of existing literature on scheduling problems with earliness and tardiness costs. This note presents an attempt to accommodate pre-emption in such settings. The focus is on models with a common due date for all jobs under different cost structures ( job dependent versus job independent), and different objectives ( minsum and minmax). It appears that only one of these cases is not polynomially solvable: the case of minsum objective and job-dependent ( linear) cost. An exact dynamic programming algorithm is introduced for this problem, as well as an efficient heuristic, which is shown to perform extremely well in our numerical tests. 相似文献
1