检索结果-内蒙古大学图书馆

A novel predictive-reactive scheduling method for parallel batch processor lot-sizing and scheduling with sequence-dependent setup time

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2024年 189卷

作者： Qiu, Junhao Liu, Jianjun Peng, Chengfeng Chen, Qingxin Guangdong Univ Technol Sch Electromech Engn State Key Lab Precis Elect Mfg Technol & Equipment Guangdong CIM Prov Key Lab Guangzhou Peoples R China Xiangnan Univ Sch Phys & Elect Elect Engn Chenzhou 423000 Peoples R China

In practical printed circuit boards (PCB) drilling production systems, multiple spindle processing capabilities and uncertainties are commonplace. This paper addresses predictive-reactive scheduling, considering parallel batch processor lot-sizing and scheduling with sequence-dependent setup times in a dynamic environment. We propose a predictive scheduling algorithm named S-AGAIG to balance machine spindle utilization and order tardiness in steps. Multiple splitting solutions are first formed by using a split heuristic algorithm to size the sub -lots of orders. Then the adaptive genetic algorithm with iterated greedy search is applied to select the solutions and scheduling. Furthermore, we present a schedule repair strategy based on sub -lot co-processing considering the impact of critical sub -lots, and construct a scheduling stability metric for rescheduling. In 36 sets of case experiments encompassing diverse load and machine type configurations, S-AGAIG showcases a 21.27% enhancement in average tardiness performance when compared to its closest rival. Across 28 cases involving varying disturbances, the framework demonstrates exceptional robustness.

关键词： predictive-reactive scheduling Lot-sizing and scheduling Multi-spindle batch processor Sequence-dependent setup Optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

Towards a data-driven predictive-reactive production scheduling approach based on inventory availability 9

Towards a data-driven predictive-reactive production schedul...

引用

9th IFAC/IFIP/IFORS/IISE/INFORMS Conference on Manufacturing Modelling, Management and Control (IFAC MIM)

作者： Takeda Berger, Satie Ledoux Zanella, Renata Mariani Frazzon, Enzo Morosini Univ Fed Santa Catarina Ind & Syst Engn Dept Ctr Technol Florianopolis SC Brazil

To survive in a competitive business environment, manufacturing systems require the proper deployment of advanced technologies coming from Industry 4.0. These technologies allow access to quasi real-time data that provide a continuously updated picture of the production system, including the state of available inventory. Data-driven predictive-reactive production scheduling has the potential to support the anticipation and prompt reaction to overcome different kinds of disruptions that occur in production execution nowadays. This research paper aims to propose a conceptual model for a data-driven predictive reactive production scheduling approach combining machine learning and simulation-based optimization, considering current inventory of raw material, work in process and final products inventory to characterize a job-shop production execution state. The approach supports decision-making in dynamic situations related to inventory availability that can affect production schedules. (C) 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： predictive-reactive scheduling manufacturing system data-driven machine learning simulation-based optimization

来源：评论

学校读者我要写书评

暂无评论

predictive-reactive scheduling for Space Missions in Small Satellite Clusters

Predictive-Reactive Scheduling for Space Missions in Small S...

引用

3rd International Symposium on Computer, Consumer and Control (IS3C)

作者： Wu, Jin Liu, Lixiang Hu, Xiaohui Chinese Acad Sci Inst Software Sci & Technol Integrated Informat Syst Lab Beijing 100190 Peoples R China

ISBN: (纸本)9781509030712

Task scheduling in small satellites clusters is an important optimization problem because of limited resources and various constraints. Specifically, automated and dynamic scheduling is necessary for practical schedule and real-time response of exceptions, whereas it makes the problem more complicated. In this paper, a predictive-reactive scheduling model has been proposed for space missions in heterogeneous small satellite clusters, which is realized by the hybrid of periodic task scheduling and dynamic adjustment. In the model, the characteristics and constraints of various space missions are abstracted and then multi-types of tasks are defined from different perspectives. Additionally, the link status is predicted and introduced as the communication constraint in the scheduling process, due to the frequent topology changes and the unreliable communication links. A priority-based scheduling algorithm ELSFT has been proposed and applied in the scheduling process. By compared with both classis greedy algorithms and the latest heuristic search algorithm, the experimental results show that our approach provides real-time schedules with high completion rate and minimum makespan.

关键词： predictive-reactive scheduling Small Satellite Cluster Automated spacecraft Greedy Algorithm Link Status Forecasting

来源：评论

学校读者我要写书评

暂无评论

predictive-reactive scheduling for single surgical suite subject to random emergency surgery

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2015年第4期30卷 949-966页

作者： Wang, Bing Han, Xingbao Zhang, Xianxia Zhang, Shaohua Shanghai Univ Sch Mechatron Engn & Automat Shanghai 200072 Peoples R China

This paper discusses the surgery scheduling problem for single surgical suite subject to random emergency surgery. In a surgical suite, each patient should be treated by three stages in the same order. This problem can be handled as a no-wait permutation flow-shop scheduling problem with three machines. A predictive-reactive scheduling approach is developed to accommodate the influence of surgery's arrival on planned schedule while optimizing the objective of combining efficiency and stability. In the predictive scheduling phase, an initial schedule is generated by solely optimizing the efficiency, and then slack time is inserted in the initial schedule to generate a planned schedule based on the occurrence probability of emergency surgery. In the reactive scheduling phase, a "break-in-moment" of emergency surgery is determined to satisfy the requirement of non-preemption surgery and the no-wait constraint. A partial-rescheduling approach is used to revise the schedule of unperformed surgeries after an emergency surgery certainly breaks in the planned schedule. A computational experiment was conducted and the computational results demonstrate that comparing with traditional approaches, the predictive-reactive scheduling approach developed here could significantly improve the stability with a little sacrifice in the efficiency for all tested instances.

关键词： Surgery scheduling problem Efficiency and stability Emergency surgery predictive-reactive scheduling Partial rescheduling

来源：评论

学校读者我要写书评

暂无评论

Dynamic shop-floor scheduling using real-time information: A case study from the thermoplastic industry

引用

COMPUTERS & OPERATIONS RESEARCH 2023年第1期152卷

作者： Ghaleb, Mageed Taghipour, Sharareh Toronto Metropolitan Univ Mech & Ind Engn Dept Reliabil Risk & Maintenance Res Lab RRMR Lab Toronto ON Canada

Practical production planning and scheduling systems must promptly respond to major real-time events and adjust their plans and schedules accordingly. To highlight the importance of concurrency in such systems, this paper addresses the problem of dynamic shop-floor scheduling using real-time information in a case study from the thermoplastic industry. The considered production line is organized as unrelated parallel production cells with a set of identical parallel machines in each cell. Parts are produced in batches using different molds on specific machines. Due to the size and complicated design of the molds, they require extended recovery periods (i.e., maintenance) in case of major failures. Therefore, previously developed plans and schedules need to be revised using real-time information every time a mold's major failure occurs. The production process is subject to the following constraints: batch processing, safety stocks, dedicated machines, machine-dependent setup times, precedence constraints, mold failures, and real-time updates. The problem is formulated as a mixed-integer programming model to minimize a weighted cost function that includes tardiness and operating costs. To solve the problem, a predictive-reactive scheduling approach is introduced based on a modified simulated annealing (SA) algorithm. The developed approach utilizes an event-driven rescheduling policy. It also embeds a problem-specific neighborhood structure and solution evaluation into the modified SA algorithm. The experi-mental study indicates that the proposed approach generates better real-life planning and scheduling results than the methods based on dispatching rules. The findings demonstrate that the proposed SA-based predictive-reactive scheduling approach generates the solutions with about a 26.1% less tardiness cost and a 6.99% less total weighted cost (on average). In addition, the results also show the competitiveness of the proposed SA-based predictive-reactive scheduling

关键词： Dynamic scheduling Parallel machines scheduling predictive-reactive scheduling Real-time information Simulated annealing Industry 4 0

来源：评论

学校读者我要写书评

暂无评论

A novel predictive-reactive rescheduling method for products assembly lines with optimal dynamic pegging

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2022年 171卷

作者： Moghaddam, Shokraneh K. Saitou, Kazuhiro Sharif Univ Technol Dept Ind Engn Tehran *** Iran Univ Michigan Dept Mech Engn Ann Arbor MI 48109 USA

In this paper a new predictive-reactive rescheduling method is presented based on the dynamic pegging concept. scheduling adjustments in a multi-level, mixed-model production system are invoked in response to the un-planned events, such as new order arrival, changes in due dates, and order cancellation. By using the dynamic pegging approach at the time of rescheduling, Work-In-Progress (WIP) can be reassigned to the existing or new orders. Based on our previous work on reactive-only rescheduling with dynamic pegging, a Mixed Integer Pro-gramming (MIP) model is developed for predictive-reactive scheduling of new orders of different product types that arrive following exponential distribution. A simple example is designed to compare the performance of predictive-reactive rescheduling and the reactive-only rescheduling by changing different input parameters to the MIP model. The results indicate that in certain scenarios implementing the predictive-reactive approach could be significantly more cost-efficient.

关键词： predictive-reactive scheduling Dynamic pegging Stochastic order arrivals

来源：评论

学校读者我要写书评

暂无评论

predictive-reactive Rescheduling for New Order Arrivals with Optimal Dynamic Pegging 16

Predictive-Reactive Rescheduling for New Order Arrivals with...

引用

16th IEEE International Conference on Automation Science and Engineering (CASE)

作者： Moghaddam, Shokraneh K. Saitou, Kazuhiro Sharif Univ Technol Tehran *** Iran Univ Michigan Ann Arbor MI 48109 USA

ISBN: (纸本)9781728169040

This paper presents a new predictive-reactive rescheduling method for adjusting production schedules in response to the unplanned arrival of new orders in multi-level production. It is based on the concept of dynamic pegging, which enables the reassignment of the Work-In-Progress (WIP) to the existing or newly arrived orders at the time of rescheduling. Extending our previous work on reactive rescheduling with dynamic pegging, the new approach incorporates a probabilistic predictive model of new order arrival in the initial scheduling at the begging of the scheduling horizon. A Mixed Integer Programming (MIP) model is developed for two-phase, predictive-reactive scheduling before and after the arrival of a new order that follows an exponential distribution. The MIP model is solved for two periods. In the predictive phase before the new order arrival, the best schedule is achieved based on the expected arrival time for a new order. In the reactive phase after the new order arrival, the best schedule is created based on the dynamic pegging approach. Using a simple example, the proposed predictive-reactive rescheduling is compared with the reactive-only rescheduling in our previous work, with sampled arrivals of new orders. It is demonstrated the proposed approach performs statistically better than the reactive-only approach, especially during the reacting phase.

关键词： predictive-reactive scheduling dynamic pegging stochastic order arrivals

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Task Model for Resource Failure Recovery in Production scheduling 15th

Hierarchical Task Model for Resource Failure Recovery in Pro...

引用

15th Mexican International Conference on Artificial Intelligence (MICAI)

作者： Bartak, Roman Vlk, Marek Charles Univ Prague Fac Math & Phys Malostranske Nam 25 CR-11800 Prague 1 Czech Republic

ISBN: (纸本)9783319624341;9783319624334

Attaining optimal results in real-life scheduling is hindered by a number of problems. One such problem is dynamics of manufacturing environments with breaking-down resources and hot orders coming during the schedule execution. A traditional approach to react to unexpected events occurring on the shop floor is generating a new schedule from scratch. Complete rescheduling, however, may require excessive computation time. Moreover, the recovered schedule may deviate a lot from the ongoing schedule. Some works have focused on tackling these shortcomings, but none of the existing approaches tries to substitute jobs that cannot be executed with a set of alternative jobs. This paper describes the scheduling model suitable for dealing with unforeseen events using the possibility of alternative processes and proposes an efficient heuristic-based approach to recover an ongoing schedule from a resource failure.

关键词： predictive-reactive scheduling Rescheduling Schedule updates Alternative processes Constraint satisfaction

来源：评论

学校读者我要写书评

暂无评论

scheduling under uncertainty: survey and research directions

Scheduling under uncertainty: survey and research directions

引用

International Conference on Advanced Logistics and Transport (ICALT)

作者： Chaari, Tarek Chaabane, Sondes Aissani, Nassima Trentesaux, Damien Fac Econ & Management Sfax BP 1088 Sfax 3018 Tunisia Univ Lille Nord France F-59313 Lille France Univ Oran Dept Comp Sci LIO Oran Algeria

ISBN: (纸本)9781479948390

In real-world scheduling problems, several kinds of hard-to-predict risk must be considered. scheduling under uncertainty allows these kinds of risks to be taken into account. This paper provides an overview of the state of the art in scheduling under uncertainty, including a survey on modeling techniques of uncertainty and a survey of the existing positioning typologies and contributions. A new classification scheme for the different approaches to scheduling under uncertainty is proposed and discussed. Several areas for future research are suggested.

关键词： scheduling uncertainty reactive scheduling proactive scheduling predictive-reactive scheduling proactivereactive scheduling

来源：评论

学校读者我要写书评

暂无评论

predictive-reactive scheduling on a single resource with uncertain future jobs

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2008年第3期189卷 1267-1283页

作者： Yang, Bibo Geunes, Joseph Univ Florida Dept Ind & Syst Engn Gainesville FL 32611 USA Hong Kong Polytech Univ Dept Logist Kowloon Hong Kong Peoples R China

We consider a scheduling problem where the firm must compete with other firms to win future jobs. Uncertainty arises as a result of incomplete information about whether the firm will win future jobs at the time the firm must create a predictive (planned) schedule. In the predictive schedule, the firm must determine the amount of planned idle time for uncertain jobs and their positions in the schedule. When the planned idle time does not match the actual requirements, certain schedule disruptions occur. The firm seeks to minimize the sum of expected tardiness cost, schedule disruption cost, and wasted idle time cost. For the special case of a single uncertain job, we provide a simple algorithm for the optimal planned idle time and the best reactive method for schedule disruptions. For the case of multiple uncertain jobs, a heuristic dynamic programming approach is presented. (c) 2007 Elsevier B.V. All rights reserved.

关键词： predictive-reactive scheduling uncertainty modeling project management and scheduling

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：