共查询到19条相似文献,搜索用时 62 毫秒
1.
2.
一个宽容交货超前延误单机排序问题 总被引:4,自引:0,他引:4
此文考虑下述排序问题(P):有n个工件需在同一台机器上加工,对各工件有一共同的宽容交货期。若一工件在此宽容期前完工则为一超前工件,若在此宽容期后完工则为一延误工件,要求适当安排一加工方式和宽容交货期的位置使加权超前延误工件数量小。文中证得(P)是NP-hard的,并给出一伪多项式时间的分枝状精确算法,这也就可以认为它是一般意义下的NP-hard问题而不是强NP-hard问题。 相似文献
3.
4.
本文考虑下述排序问题:有n个工件需在同一台机器上加工,对各工件有一宽容交货期,若一工件在其宽容期前完工则受加权超前惩罚,若在其宽容期后完工则受加权延误惩罚,要求适当安排一加工方式使最大惩罚最小,文中相应某指定工件需准时完工的上述问题证得了Np-hard性,给出了最优算法,并作了一些讨论。 相似文献
5.
《数学的实践与认识》2013,(24)
研究具有相同批容量和相同工期的单机准时分批排序问题.这里相同批容量是指每批加工的工件数相同且恰为b个.准时排序要求工件在工期准时完工,提前或误工均受到惩罚.在两种分批方式下进行排序:继列分批和平行分批.目标函数为最小化加权总绝对误差和加权非准时惩罚.这里的权重不是工件自身所拥有的,而是工件所在的批一旦排在某个位置所获得的位置权重.证明了这些问题均可在O(nlogn)时间内解决. 相似文献
6.
谢祥添 《数学的实践与认识》2022,(5):123-131
在需求受价格、交货时间和服务水平影响环境下,考虑订单生产为M/M/1排队模型,建立订单生产价格与产能,交货时间与产能,价格、交货时间与产能决策模型.研究表明:对于价格与产能模型,当交货时间较小时,交货时间具有溢价作用和需要较多的产能才能缩短交货时间;对于价格、交货时间与产能模型,最优产能、最优价格与最优交货时间绑定于服务水平上,降低产能单位成本或提高服务水平可以增加利润. 相似文献
7.
汽车企业集团的准时化集中生产配送是供应链物流一体化的重要环节。实现汽车企业集团的准时化集中生产配送,要明确其目标,做好供应商关系、配送物流的统一运作、基础数据、信息网络、配送中心仓库作业设备的现代化和领导支持六个方面的基础工作;针对我国汽车企业集团的实际,构建准时化集中配送系统的框架及流程;在准时化集中配送系统运作上探讨了包括配送资源的整合、配送中心库区的划分、配送中心库位管理、配送中心库存管理、不同物料配送流程(、6)配送中心信息系统、物料索取系统等七个方面问题。 相似文献
8.
描述了基于客户需求为模糊量的批量生产提前/拖期交货的生产计划,并建立了模糊环境下的三个模型.为了有效求解优化模型,我们将模糊模拟和遗传算法相结合给出了混合智能算法.最后通过数值例子说明算法的有效性. 相似文献
9.
10.
11.
本讨论n个独立工件在一台机器上加工,而且加工时间服从正态分布的公共交货期窗口的提前/延期惩罚问题,在确定公共交货期窗口情况下,推导出工件的最优排序具有V型特征。 相似文献
12.
We consider the problem of assigning a common due-date and sequencing a set of simultaneously available jobs on several identical parallel-machines. The objective is to minimize some penalty function of earliness, tardiness and due-date values. We show that the problem is NP-hard with either a total or a maximal penalty function. For the problem with a total penalty function, we show that the special case in which all jobs have an equal processing time is polynomially-solvable. 相似文献
13.
近年来对超前/延误(E/T)排序问题进行了广泛的研究.本文总结了对E/T排序问题的各种研究中的一些特别领域,虽然没有覆盖所有的新成果,但对该课题有兴趣的读者提供了指导. 相似文献
14.
15.
单台机器E-T随机排序问题的多项式算法 总被引:1,自引:0,他引:1
本文研究排序问题中的E—T问题,工件在单台机器上加工,n个工件的加工时间都为整数P,相同的工期d为离散分布,满足∑i=1^mP(d=ξi)=1,其中ξ为整数,目标是使E(∑(Ei+Tj))的期望值最小。应用贪婪算法和二分法思想,我们提出解决该问题的一个最优算法,并得出该算法的复杂性为O(nmlogp)。 相似文献
16.
17.
A hybrid technique using constraint programming and linear programming is applied to the problem of scheduling with earliness and tardiness costs. The linear model maintains a set of relaxed optimal start times which are used to guide the constraint programming search heuristic. In addition, the constraint programming problem model employs the strong constraint propagation techniques responsible for many of the advances in constraint programming for scheduling in the past few years. Empirical results validate our approach and show, in particular, that creating and solving a subproblem containing only the activities with direct impact on the cost function and then using this solution in the main search, significantly increases the number of problems that can be solved to optimality while significantly decreasing the search time. 相似文献
18.
This work is concerned with scheduling problems for a single machine. Taking earliness and tardiness of completion time and due–date value into consideration, the objective function with a common due date is considered. The processing time of each job is random. Sufficient conditions guaranteeing an optimal SEPT sequence are derived. Under exponential and normal processing times, further results are obtained 相似文献
19.
Asymmetric Earliness and Tardiness Scheduling with Exponential Processing Times on an Unreliable Machine 总被引:4,自引:0,他引:4
We address the problem of processing a set of jobs on a single machine under random due dates with a common distribution. The processing times of the jobs are exponentially distributed random variables with means
i
, and the machine is subject to stochastic breakdowns governed by a Poisson process. Each job i is associated with a job-dependent weight w
i
. The objective is to schedule the jobs so as to minimize the expected sum of the weighted earliness and tardiness costs of all jobs, which are quadratic functions of the deviations of job completion times from the due dates. We show that the problem is NP-complete. Nevertheless, important optimality properties exist, which can be utilized to develop effective algorithms to solve the problem. Specifically, we prove that, in the case where the weights assigned to both the earliness and tardiness are symmetric, an optimal sequence for the problem must be V-shaped with respect to {
i
/w
i
}, in the sense that the sequence will first process jobs in a nonincreasing order of {
i
/w
i
} and then in a nondecreasing order of {
i
/w
i
}. In the case where asymmetric weights are assigned to the earliness and tardiness costs, the optimal sequence must also be V-shaped with respect to {
i
/w
i
}, if the due dates are exponentially distributed. Dynamic programming algorithms are proposed which can find the best V-shaped sequences. 相似文献