检索结果-南通市图书馆

Predictive-reactive Strategy for Flowshop rescheduling Problem:Minimizing the Total Weighted Waiting Times and Instability

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science and Systems Engineering 2021年第3期30卷 253-275页

作者： Ayoub Tighazoui Christophe Sauvey Nathalie Sauer Universitéde Lorraine LGIPMF-57000MetzFrance

Due to the fourth revolution experiencing,referred to as Industry 4.0,many production firms are devoted to integrating new technological tools to their manufacturing *** of them,is rescheduling the tasks on the machines responding to ***,for static scheduling,the efficiency criteria measure the performance of scheduling systems,in dynamic environments,the stability criteria are also used to assess the impact of jobs *** this paper,a new performance measure is investigated for a flowshop rescheduling *** one considers simultaneously the total weighted waiting time as the efficiency criterion,and the total weighted completion time deviation as the stability *** fusion could be a very helpful and significant measure for real life industrial *** disruption types are considered:jobs arrival and jobs ***,a Mixed Integer Linear Programming(MILP)model is developed,as well as an iterative predictive-reactive strategy for dealing with the online *** last,two heuristic methods are proposed and discussed,in terms of solution quality and computing time.

关键词： rescheduling flowshop predictive-reactive strategy weighted waiting time stability weighted completion time deviation

Improving service regularity for high-frequency bus services with rescheduling and bus holding

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Traffic and Transportation Engineering(English Edition) 2021年第5期8卷 778-794页

作者： Konstantinos Gkiotsalitis Centre for Transport Studies Department of Civil EngineeringUniversity of TwenteEnschedeThe Netherlands

In high-frequency bus services,maintaining the service regularity is a critical *** service regularity is directly related to the excessive waiting times(EWT) of passengers at bus *** a regular service,the EWT is minimized resulting in even headways between consecutive buses of the same *** this study,we propose the combined use of rescheduling and bus holding to improve passengers’ excessive waiting *** model the dynamic rescheduling and bus holding problem as an integer nonlinear program(INLP) and we prove its *** model considers the constraints of the original timetable e an issue that is usually neglected from most dynamic control *** the NP-hardness of our mathematical program,we introduce a problem-specific heuristic to explore efficiently the solution *** convergence rate of the proposed heuristic is tested against other solution methods,including simulated annealing with linear cooling,hill climbing and branch and bound with multi-start sequential quadratic *** addition,simulations with the use of actual operational data from a major bus operator in Asia Pacific demonstrate an up to 35% potential EWT improvement for a minor increase of 6% to the travel times of onboard passengers.

关键词： Traffic engineering rescheduling Bus holding Dynamic control Combinatorial optimization Bus bunching

A rescheduling Method for Operation Time Delay Disturbance in Steelmaking and Continuous Casting Production Process

在线全文

学校读者我要写书评

暂无评论

Journal of Iron and Steel Research International 2012年第12期19卷 33-41页

作者： YU Sheng-ping PAN Quan-ke State Key Laboratory of Synthetical Automation for Process Industries Northeastern UniversityShenyang 110819 Liaoning China

In the steelmaking and continuous casting （SMCC） production process, operation time delay may lead to casting break or processing conflict so that the initial scheduling plan becomes unrealizable. Existing research meth- ods are difficult to guarantee the accuracy of the model and successful application to actual applications. The resched- uling problem in response to operation time delay is firstly analyzed. This is then followed by the establishment of a novel multi-obiective nonlinear programming model （MONPM）. In specifications, a three-stage rescheduling method is proposed including the batches splitting （BS）, forward scheduling method （FSM） and backward scheduling meth- od （BSM）. As a result, the real-time application shows that the proposed rescheduling method efficiently ensures the continuous casting and dramatically shortens the redundant waiting time for molten steel in very short rescheduling time.

关键词： SMCC rescheduling disturbance heuristic algorithm

rescheduling Problems with Bicriteria

在线全文

学校读者我要写书评

暂无评论

Chinese Quarterly Journal of Mathematics 2009年第3期24卷 349-356页

作者：慕运动 Department of Mathematics and Physics Henan University of Technology Department of Mathematics Zhengzhou University

In the rescheduling on a single machine,a set of original jobs has already been scheduled to minimize some cost objective,when a new set of jobs arrives and creates a *** decision maker needs to insert the new jobs into the existing schedule without excessively disrupting *** this paper,we consider hierarchical optimization between the scheduling cost of all the jobs and the degree of this *** every problem,we provide either a polynomial time algorithm or an intractable result.

关键词： rescheduling hierarchical optimization time disruption sequence disruption single machine

rescheduling to Minimize Total Completion Time Under a Limit Time Disruption for the Parallel Batch

在线全文

学校读者我要写书评

暂无评论

Chinese Quarterly Journal of Mathematics 2015年第2期30卷 274-279页

作者： XU Xiao-yan MU Yun-dong GUO Xiao HAO Yun School of Science Henan University of Technology Zhengzhou 450001 China

In the rescheduling on a single machine, a set of the original jobs has already been scheduled, in order to make a given objective function is optimal. The decision maker needs to insert the new jobs into the existing schedule without excessively disrupting it. A batching machine is a machine that can handle up to some jobs simultaneously. In this paper,we consider the total completion time under a limit on the sequence disruptions for parallel batching based on rescheduling. For the parallel batching problem based on rescheduling, we research the properties of feasible schedules and optimal schedules on the total completion time under a limit on the maximum time disruptions or total time disruptions, in which the jobs are sequenced in SPT order, and give out the pseudo-polynomial time algorithms on the number of jobs and the processing time of jobs by applying the dynamic programming method.

关键词： rescheduling single machine parallel batch time disruptions

rescheduling to Minimize the Total Completion Time under a Limit on the Total Completion Time of The Original Jobs

在线全文

学校读者我要写书评

暂无评论

Rescheduling to Minimize the Total Completion Time under a L...

Timetable Mapping Model and Dynamic Programming Approach for High-speed Railway rescheduling

2010 3rd IEEE International Conference on Computer Science and Information Technology—ICCSIT 2010

作者： Yundong Mu College of Science Henan University of Technology Zhengzhou Henan 450001 People’s Republic of China Yun Hao

＜正＞We consider the rescheduling problems arising when two agents,each with a set of nonpreemptive jobs, compete to perform their respective jobs on a common processing *** agent wants to minimize a certain objective function,which depends on the completion time of its jobs *** this paper,we consider the two agents rescheduling problem for jobs on a single machine to minimize total completion time under a limit on the total completion time of the original *** show that the considered problems can be solved in polynomial time or pseudopolynomial time.

关键词： rescheduling multiagent objective function total completion time disruption

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Timetable Mapping Model and Dynamic Programming Approach for...

A note on single-machine rescheduling problems with learning effect under disruptions

第三十九届中国控制会议

作者： Peng Xu Guoqi Feng Dongliang Cui Xuewu Dai Qi Zhang Feng Chen School of business administration Northeastern University Laboratory of Synthetical Automation for Process Industries Northeastern University The Center of National Railway Intelligent Transportation System Engineering and Technology

In railway systems,rescheduling trains in case of delays or disruptions occur is a critical and challenging task to remain the punctuality of railway *** the railway traffic rescheduling problem is complex,computation-intensive and time-consuming from practical and computational *** problem has typically a very large search space,making it time-consuming to solve even for state-of-the-art optimization *** this paper,a dynamic programming（DP）approach is used to address the issues of high computation costs in rescheduling railways traffics under various delays,in order to map the arrival and departure time of the train to the state of DP,we develop a timetable mapping model for the real-time train rescheduling（TTR） *** section is modeled as a stage in the action space and the state of each stage is represented by the departure sequence of all the trains at the station for timetable *** we further obtain the state transfer equation and construct the Bellman equation with the goal of minimizing the total delay time and use the Bellman equation inverse to derive the ***,numerical experiments of TTR are *** advantage of the proposed DP is illustrated from the perspective of the strategy compared with the widely used First-Come-First Serve（FCFS） and the First Schedule-First-Serve（FSFS）.It shows that the proposed DP can effectively solve the TTR problems,especially for primary delay problems.

关键词： dynamic programming approach rescheduling high-speed railway timetable mapping

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

A note on single-machine rescheduling problems with learning...

Research on Flexible Job Shop Scheduling Based on Improved Two-Layer Optimization Algorithm

2010 2nd IEEE International Conference on Advanced Management Science（IEEE ICAMS 2010）

作者： Cheng Mingbao School of Management Guangdong University of Technology Guangzhou PR.China Zhang Bixi School of Management Guangdong University of Technology Guangzhou PR.China

rescheduling problem means that a set of original jobs has already been scheduled to minimize some classical objective,then the decision maker needs to insert some new jobs into the existing schedule and creates a *** this paper,we consider single-machine rescheduling problem with position-dependent learning effect under disruption,which learning effect means that the processing time of a job reflects a decreasing as a function of the number of *** objective is to minimize makepan,the total completion time and maximum lateness under a limit of the disruption from the original scheduling,and to minimize the total of the cost with original cost measure and disruption,*** show that the considered problem can be solved in polynomial time.

关键词： rescheduling Learning effect Disruption Makespan Total completion time Lateness.

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2024年第1期78卷 811-843页

作者： Qinhui Liu Laizheng Zhu Zhijie Gao Jilong Wang Jiang Li College of Mechanical and Electrical Engineering Harbin Engineering UniversityHarbin150001China

To improve the productivity,the resource utilization and reduce the production cost of flexible job shops,this paper designs an improved two-layer optimization algorithm for the dual-resource scheduling optimization problem of flexible job shop considering workpiece ***,a mathematical model is established to minimize the maximum completion ***,an improved two-layer optimization algorithm is designed:the outer layer algorithm uses an improved PSO(Particle Swarm Optimization)to solve the workpiece batching problem,and the inner layer algorithm uses an improved GA(Genetic Algorithm)to solve the dual-resource scheduling ***,a rescheduling method is designed to solve the task disturbance problem,represented by machine failures,occurring in the workshop production ***,the superiority and effectiveness of the improved two-layer optimization algorithm are verified by two typical *** case results show that the improved two-layer optimization algorithm increases the average productivity by 7.44% compared to the ordinary two-layer optimization *** setting the different numbers of AGVs(Automated Guided Vehicles)and analyzing the impact on the production cycle of the whole order,this paper uses two indicators,the maximum completion time decreasing rate and the average AGV load time,to obtain the optimal number of AGVs,which saves the cost of production while ensuring the production *** research combines the solved problem with the real production process,which improves the productivity and reduces the production cost of the flexible job shop,and provides new ideas for the subsequent research.

关键词： Dual resource scheduling workpiece batching rescheduling particle swarm optimization genetic algorithm