共查询到20条相似文献,搜索用时 13 毫秒
1.
2.
Ik-Soo Shim Hyeok-Chol Kim Hyoung-Ho Doh Dong-Ho Lee 《Computers & Industrial Engineering》2011,61(4):920-929
This paper considers a single machine capacitated lot-sizing and scheduling problem. The problem is to determine the lot sizes and the sequence of lots while satisfying the demand requirements and the machine capacity in each period of a planning horizon. In particular, we consider sequence-dependent setup costs that depend on the type of the lot just completed and on the lot to be processed. The setup state preservation, i.e., the setup state at the end of a period is carried over to the next period, is also considered. The objective is to minimize the sum of setup and inventory holding costs over the planning horizon. Due to the complexity of the problem, we suggest a two-stage heuristic in which an initial solution is obtained and then it is improved using a backward and forward improvement method that incorporates various priority rules to select the items to be moved. Computational tests were done on randomly generated test instances and the results show that the two-stage heuristic outperforms the best existing algorithm significantly. Also, the heuristics with better priority rule combinations were used to solve case instances and much improvement is reported over the conventional method as well as the best existing algorithm. 相似文献
3.
A survey of dynamic scheduling in manufacturing systems 总被引:3,自引:0,他引:3
In most real-world environments, scheduling is an ongoing reactive process where the presence of a variety of unexpected disruptions
is usually inevitable, and continually forces reconsideration and revision of pre-established schedules. Many of the approaches
developed to solve the problem of static scheduling are often impractical in real-world environments, and the near-optimal
schedules with respect to the estimated data may become obsolete when they are released to the shop floor. This paper outlines
the limitations of the static approaches to scheduling in the presence of real-time information and presents a number of issues
that have come up in recent years on dynamic scheduling.
The paper defines the problem of dynamic scheduling and provides a review of the state-of-the-art of currently developing
research on dynamic scheduling. The principles of several dynamic scheduling techniques, namely, heuristics, meta-heuristics,
multi-agent systems, and other artificial intelligence techniques are described in detail, followed by a discussion and comparison
of their potential. 相似文献
4.
Ernest L. McDuffieMoti SchneiderFrederick B. BuoniEliahu ShnaiderMelech Schneider Engineering ConsultantLouis A. Martin-Vega 《Engineering Applications of Artificial Intelligence》1995,8(6):681
In this paper the concept of recursive Allen temporal algebra is fully described, along with its relationship to the smart scheduler program and the concept of smart scheduling in general. Flexible manufacturing systems (FMS) are described, and their relationship with smart scheduling is explored. A case study that shows the utility of SSP in an FMS environment is presented in detail. Conclusions about the concept of smart scheduling are presented in closing. 相似文献
5.
资源配置混杂Petri网的混杂系统生产过程动态调度 总被引:1,自引:0,他引:1
为了增强混杂生产过程应对突发事件的能力,以一种新的混杂Petri网(资源配置混杂Petri网)为研究模型,给出了相应的使能和激发规则.并在资源配置混杂Petri网建立的仿真模型的基础上,融入事件逻辑网和逻辑规划,提出一种适用于混杂系统动态生产调度建模和优化的方法.以典型的混杂生产过程为例,研究混杂系统生产过程建模及优化.研究结果表明,资源配置混杂Petri网模型描述能力强,能够有效描述混杂系统生产过程,所提出的动态调度方案切实有效. 相似文献
6.
7.
为了解决数据流编程模型的可用性问题,使其能在兼顾程序并行性的前提下适用于动态数据交互速率的流应用,设计了一种动态调度与静态优化相结合的数据流编译系统。编译器以COStream语言编写的源程序为输入,通过对源程序进行分析,以动态速率的数据通信边作为边界划分程序到粗粒度的子图,在子图内部应用静态优化。根据子图的每个计算单元的工作量估计计算资源的使用状况,实现子图内计算单元到处理器核的映射,经过阶段划分分配子图内计算单元到相应流水阶段。在运行时,每个子图在各个处理器核上均启动一个线程,通过对线程间通信的优化,避免了运行时多个线程对同一段内存同时读写产生的同步开销,减少了线程的上下文切换次数。使用信号量控制子图内线程间的同步,基于各子图计算单元运行时数据交互速率并结合当前线程的状态,动态调度各个子图的执行,构建动态的软件流水线,生成相应多线程目标代码。实验以通用X86-64多核处理器作为实验平台,测试和分析数据流编译的性能。实验结果表明,编译系统可以实现动态数据交互速率的数据流应用,扩大了编译系统可用性并且具有一定加速效果。 相似文献
8.
9.
基于DBR理论的柔性流水车间动态调度 总被引:2,自引:1,他引:1
针对柔性流水车间动态调度求解困难的问题,首先分析调度问题的特征,构建问题模型;然后运用DBR(鼓-缓冲器-绳子)理论对问题进行分解简化,并采用混合重调度策略和启发式算法进行动态调度;最后建立瓶颈和非瓶颈资源调度的协调机制,实现问题求解.仿真实例表明,所提出的算法是可行而有效的. 相似文献
10.
In this paper, we consider optimal production and setup scheduling in a failure-prone manufacturing system consisting of a single machine. The system can produce several types-of products, but at any given time it can only produce one type of product. A setup is required if production is to be switched from one type of product to another. The decision variables are a sequence of setups and a production plan. The objective of the problem is to minimize the cost of setup, production, and surplus. An approximate optimality condition is given together with a computational algorithm for solving the optimal control problem 相似文献
11.
This paper examines the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times, time windows, machine eligibility and preference constraints. Such problems are quite common in the semiconductor manufacturing industry. In particular, this paper pays special attention to the chipset production in the semiconductor Assembly and Test Manufacturing (ATM) factory and constructs a Mixed Integer Programming (MIP) model for the problem. The primal problem is decomposed into a lot-sizing subproblem and a set of single-machine scheduling subproblems by Lagrangian decomposition. A Lagrangian-based heuristic algorithm, which incorporates the simulated annealing algorithm aimed at searching for a better solution during the feasibility construction stage, is proposed. Computational experiments show that the proposed hybrid algorithm outperforms other heuristic algorithms and meets the practical requirement for the tested ATM factory. 相似文献
12.
Cyrille Pach Thierry Berger Yves Sallez Thérèse Bonte Emmanuel Adam Damien Trentesaux 《Computers in Industry》2014
This paper presents a reactive scheduling approach for flexible manufacturing systems, which integrates the overall energy consumption of the production. This work is justified by the growing needs of manufacturers for energy-aware control, due to new important environmental criteria, which holds true in the context of high reactivity. It makes production hard to predict. The proposed reactive scheduling model is based on potential fields. In this model, resources that sense the intentions from products are able to switch to standby mode to avoid useless energy consumption and emit fields to attract products. Simulations are provided, featuring three indicators: makespan, overall energy consumption and the number of resource switches. Real experiments were carried out to illustrate the feasibility of the approach on a real system and validate the simulation results. 相似文献
13.
14.
15.
The scheduling problem of robotic material handlers in flexible manufacturing systems (FMSs) is NP-hard. This paper proposes a state-dependent algorithm for the FMS robot scheduling problem in make-to-order (MTO) environments for mass customization (MC). A mathematical model of the problem is formulated. A computational study of the proposed algorithm is performed. The algorithm is compared to an effective FMS robot scheduling rule, the shortest remaining processing time first (SRPF) rule. The results reveal the effectiveness of the algorithm in increasing the productivity-based measures of the FMS. Practical application insights are discussed. Further research is also provided. 相似文献
16.
实时协同的调度算法研究 总被引:1,自引:1,他引:0
研究了目前流行的实时调度技术,归纳总结了不同调度技术下的典型调度算法,介绍了实时调度算法的调度规则、调度特点、适用场合以及需要解决的问题,分析了典型商业实时操作系统中的调度技术,提出了增强操作系统实时性能需要解决的技术问题,为将优秀的实时调度算法应用在实时操作系统中奠定了理论基础。 相似文献
17.
Most job shop scheduling methods reported in the literature usually address the static scheduling problem. These methods do not consider multiple criteria, nor do they accommodate alternate resources to process a job operation. In this paper, a scheduling method based on genetic algorithms is developed and it addresses all the shortcomings mentioned above. The genetic algorithms approach is a schedule permutation approach that systematically permutes an initial pool of randomly generated schedules to return the best schedule found to date.A dynamic scheduling problem was designed to closely reflect a real job shop scheduling environment. Two performance measures, namely mean job tardiness and mean job cost, were used to demonstrate multiple criteria scheduling. To span a varied job shop environment, three factors were identified and varied between two levels each. The results of this extensive simulation study indicate that the genetic algorithms scheduling approach produces better scheduling performance in comparison to several common dispatching rules. 相似文献
18.
This paper addresses the problem of scheduling aperiodic tasks in real-time systems. The proposed scheme combines the Earliest-Deadline-First algorithm for scheduling periodic tasks with the Deferrable Server approach for servicing aperiodic tasks. Necessary and sufficient conditions are derived for guaranteeing feasibility of a given periodic task set when a deferrable server is present. An analytic model is proposed for selecting the best feasible period and computation time of the server to minimize the mean response time of aperiodic tasks. An evaluation of the proposed model using a simulator indicates that the server parameters selected by the model result in mean response times that are close to the best mean response time determined by the simulator. 相似文献
19.
提出了一种动态概率优先级算法DPP,针对一类对延时和丢包率要求相对较高的应用,根据AF1队列长度动态调整概率计算参数p,有效地解决了由于突发流量带来的QoS性能下降问题。不同实验环境下的仿真结果表明,DPP算法有效改善了突发性对分组平均排队延时的影响,减少了分组丢包率。 相似文献
20.
Maintenance scheduling in manufacturing systems based on predicted machine degradation 总被引:4,自引:2,他引:2
In this paper, we propose a new method for scheduling of maintenance operations in a manufacturing system using the continuous
assessment and prediction of the level of performance degradation of manufacturing equipment, as well as the complex interaction
between the production process and maintenance operations. Effects of any maintenance schedule are evaluated through a discrete-event
simulation that utilizes predicted probabilities of machine failures in the manufacturing system, where predicted probabilities
of failure are assumed to be available either from historical equipment reliability information or based on the newly available
predictive algorithms. A Genetic Algorithm based optimization procedure is used to search for the most cost-effective maintenance
schedule, considering both production gains and maintenance expenses. The algorithm is implemented in a simulated environment
and benchmarked against several traditional maintenance strategies, such as corrective maintenance, scheduled maintenance
and condition-based maintenance. In all cases that were studied, application of the newly proposed maintenance scheduling
tool resulted in a noticeable increase in the cost-benefits, which indicates that the use of predictive information about
equipment performance through the newly proposed maintenance scheduling method could result in significant gains obtained
by optimal maintenance scheduling. 相似文献