期刊文献+
共找到58篇文章
< 1 2 3 >
每页显示 20 50 100
A Pre-Selection-Based Ant Colony System for Integrated Resources Scheduling Problem at Marine Container Terminal
1
作者 Rong Wang Xinxin Xu +2 位作者 Zijia Wang Fei Ji Nankun Mu 《Computers, Materials & Continua》 SCIE EI 2024年第8期2363-2385,共23页
Marine container terminal(MCT)plays a key role in the marine intelligent transportation system and international logistics system.However,the efficiency of resource scheduling significantly influences the operation pe... Marine container terminal(MCT)plays a key role in the marine intelligent transportation system and international logistics system.However,the efficiency of resource scheduling significantly influences the operation performance of MCT.To solve the practical resource scheduling problem(RSP)in MCT efficiently,this paper has contributions to both the problem model and the algorithm design.Firstly,in the problem model,different from most of the existing studies that only consider scheduling part of the resources in MCT,we propose a unified mathematical model for formulating an integrated RSP.The new integrated RSP model allocates and schedules multiple MCT resources simultaneously by taking the total cost minimization as the objective.Secondly,in the algorithm design,a pre-selection-based ant colony system(PACS)approach is proposed based on graphic structure solution representation and a pre-selection strategy.On the one hand,as the RSP can be formulated as the shortest path problem on the directed complete graph,the graphic structure is proposed to represent the solution encoding to consider multiple constraints and multiple factors of the RSP,which effectively avoids the generation of infeasible solutions.On the other hand,the pre-selection strategy aims to reduce the computational burden of PACS and to fast obtain a higher-quality solution.To evaluate the performance of the proposed novel PACS in solving the new integrated RSP model,a set of test cases with different sizes is conducted.Experimental results and comparisons show the effectiveness and efficiency of the PACS algorithm,which can significantly outperform other state-of-the-art algorithms. 展开更多
关键词 Resource scheduling problem(RSP) ant colony system(ACS) marine container terminal(MCT) pre-selection strategy
下载PDF
Deep Reinforcement Learning Solves Job-shop Scheduling Problems
2
作者 Anjiang Cai Yangfan Yu Manman Zhao 《Instrumentation》 2024年第1期88-100,共13页
To solve the sparse reward problem of job-shop scheduling by deep reinforcement learning,a deep reinforcement learning framework considering sparse reward problem is proposed.The job shop scheduling problem is transfo... To solve the sparse reward problem of job-shop scheduling by deep reinforcement learning,a deep reinforcement learning framework considering sparse reward problem is proposed.The job shop scheduling problem is transformed into Markov decision process,and six state features are designed to improve the state feature representation by using two-way scheduling method,including four state features that distinguish the optimal action and two state features that are related to the learning goal.An extended variant of graph isomorphic network GIN++is used to encode disjunction graphs to improve the performance and generalization ability of the model.Through iterative greedy algorithm,random strategy is generated as the initial strategy,and the action with the maximum information gain is selected to expand it to optimize the exploration ability of Actor-Critic algorithm.Through validation of the trained policy model on multiple public test data sets and comparison with other advanced DRL methods and scheduling rules,the proposed method reduces the minimum average gap by 3.49%,5.31%and 4.16%,respectively,compared with the priority rule-based method,and 5.34%compared with the learning-based method.11.97%and 5.02%,effectively improving the accuracy of DRL to solve the approximate solution of JSSP minimum completion time. 展开更多
关键词 job shop scheduling problems deep reinforcement learning state characteristics policy network
下载PDF
Modified bottleneck-based heuristic for large-scale job-shop scheduling problems with a single bottleneck 被引量:21
3
作者 Zuo Yan Gu Hanyu Xi Yugeng 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2007年第3期556-565,共10页
A modified bottleneck-based (MB) heuristic for large-scale job-shop scheduling problems with a welldefined bottleneck is suggested, which is simpler but more tailored than the shifting bottleneck (SB) procedure. I... A modified bottleneck-based (MB) heuristic for large-scale job-shop scheduling problems with a welldefined bottleneck is suggested, which is simpler but more tailored than the shifting bottleneck (SB) procedure. In this algorithm, the bottleneck is first scheduled optimally while the non-bottleneck machines are subordinated around the solutions of the bottleneck schedule by some effective dispatching rules. Computational results indicate that the MB heuristic can achieve a better tradeoff between solution quality and computational time compared to SB procedure for medium-size problems. Furthermore, it can obtain a good solution in a short time for large-scale jobshop scheduling problems. 展开更多
关键词 job shop scheduling problem BOTTLENECK shifting bottleneck procedure.
下载PDF
Self-adaptive large neighborhood search algorithm for parallel machine scheduling problems 被引量:8
4
作者 Pei Wang Gerhard Reinelt Yuejin Tan 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2012年第2期208-215,共8页
A self-adaptive large neighborhood search method for scheduling n jobs on m non-identical parallel machines with mul- tiple time windows is presented. The problems' another feature lies in oversubscription, namely no... A self-adaptive large neighborhood search method for scheduling n jobs on m non-identical parallel machines with mul- tiple time windows is presented. The problems' another feature lies in oversubscription, namely not all jobs can be scheduled within specified scheduling horizons due to the limited machine capacity. The objective is thus to maximize the overall profits of processed jobs while respecting machine constraints. A first-in- first-out heuristic is applied to find an initial solution, and then a large neighborhood search procedure is employed to relax and re- optimize cumbersome solutions. A machine learning mechanism is also introduced to converge on the most efficient neighborhoods for the problem. Extensive computational results are presented based on data from an application involving the daily observation scheduling of a fleet of earth observing satellites. The method rapidly solves most problem instances to optimal or near optimal and shows a robust performance in sensitive analysis. 展开更多
关键词 non-identical parallel machine scheduling problem with multiple time windows (NPMSPMTW) oversubscribed self- adaptive large neighborhood search (SALNS) machine learning.
下载PDF
Solving flexible job shop scheduling problem by a multi-swarm collaborative genetic algorithm 被引量:8
5
作者 WANG Cuiyu LI Yang LI Xinyu 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2021年第2期261-271,共11页
The flexible job shop scheduling problem(FJSP),which is NP-hard,widely exists in many manufacturing industries.It is very hard to be solved.A multi-swarm collaborative genetic algorithm(MSCGA)based on the collaborativ... The flexible job shop scheduling problem(FJSP),which is NP-hard,widely exists in many manufacturing industries.It is very hard to be solved.A multi-swarm collaborative genetic algorithm(MSCGA)based on the collaborative optimization algorithm is proposed for the FJSP.Multi-population structure is used to independently evolve two sub-problems of the FJSP in the MSCGA.Good operators are adopted and designed to ensure this algorithm to achieve a good performance.Some famous FJSP benchmarks are chosen to evaluate the effectiveness of the MSCGA.The adaptability and superiority of the proposed method are demonstrated by comparing with other reported algorithms. 展开更多
关键词 flexible job shop scheduling problem(FJSP) collaborative genetic algorithm co-evolutionary algorithm
下载PDF
Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems 被引量:4
6
作者 Jin-hui Yang Liang Sun +2 位作者 Heow Pueh Lee Yun Qian Yan-chun Liang 《Journal of Bionic Engineering》 SCIE EI CSCD 2008年第2期111-119,共9页
A clonal selection based memetic algorithm is proposed for solving job shop scheduling problems in this paper. In the proposed algorithm, the clonal selection and the local search mechanism are designed to enhance exp... A clonal selection based memetic algorithm is proposed for solving job shop scheduling problems in this paper. In the proposed algorithm, the clonal selection and the local search mechanism are designed to enhance exploration and exploitation. In the clonal selection mechanism, clonal selection, hypermutation and receptor edit theories are presented to construct an evolutionary searching mechanism which is used for exploration. In the local search mechanism, a simulated annealing local search algorithm based on Nowicki and Smutnicki's neighborhood is presented to exploit local optima. The proposed algorithm is examined using some well-known benchmark problems. Numerical results validate the effectiveness of the proposed algorithm. 展开更多
关键词 job shop scheduling problem clonal selection algorithm simulated annealing global search local search
下载PDF
APPLYING PARTICLE SWARM OPTIMIZATION TO JOB-SHOPSCHEDULING PROBLEM 被引量:5
7
作者 XiaWeijun WuZhiming ZhangWei YangGenke 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2004年第3期437-441,共5页
A new heuristic algorithm is proposed for the problem of finding the minimummakespan in the job-shop scheduling problem. The new algorithm is based on the principles ofparticle swarm optimization (PSO). PSO employs a ... A new heuristic algorithm is proposed for the problem of finding the minimummakespan in the job-shop scheduling problem. The new algorithm is based on the principles ofparticle swarm optimization (PSO). PSO employs a collaborative population-based search, which isinspired by the social behavior of bird flocking. It combines local search (by self experience) andglobal search (by neighboring experience), possessing high search efficiency. Simulated annealing(SA) employs certain probability to avoid becoming trapped in a local optimum and the search processcan be controlled by the cooling schedule. By reasonably combining these two different searchalgorithms, a general, fast and easily implemented hybrid optimization algorithm, named HPSO, isdeveloped. The effectiveness and efficiency of the proposed PSO-based algorithm are demonstrated byapplying it to some benchmark job-shop scheduling problems and comparing results with otheralgorithms in literature. Comparing results indicate that PSO-based algorithm is a viable andeffective approach for the job-shop scheduling problem. 展开更多
关键词 Job-shop scheduling problem Particle swarm optimization Simulated annealingHybrid optimization algorithm
下载PDF
An Improved Genetic Algorithm for Solving the Mixed⁃Flow Job⁃Shop Scheduling Problem with Combined Processing Constraints 被引量:4
8
作者 ZHU Haihua ZHANG Yi +2 位作者 SUN Hongwei LIAO Liangchuang TANG Dunbing 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI CSCD 2021年第3期415-426,共12页
The flexible job-shop scheduling problem(FJSP)with combined processing constraints is a common scheduling problem in mixed-flow production lines.However,traditional methods for classic FJSP cannot be directly applied.... The flexible job-shop scheduling problem(FJSP)with combined processing constraints is a common scheduling problem in mixed-flow production lines.However,traditional methods for classic FJSP cannot be directly applied.Targeting this problem,the process state model of a mixed-flow production line is analyzed.On this basis,a mathematical model of a mixed-flow job-shop scheduling problem with combined processing constraints is established based on the traditional FJSP.Then,an improved genetic algorithm with multi-segment encoding,crossover,and mutation is proposed for the mixed-flow production line problem.Finally,the proposed algorithm is applied to the production workshop of missile structural components at an aerospace institute to verify its feasibility and effectiveness. 展开更多
关键词 mixed-flow production flexible job-shop scheduling problem(FJSP) genetic algorithm ENCODING
下载PDF
An effective discrete artificial bee colony algorithm for flow shop scheduling problem with intermediate buffers 被引量:3
9
作者 张素君 顾幸生 《Journal of Central South University》 SCIE EI CAS CSCD 2015年第9期3471-3484,共14页
An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effecti... An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effective combination of the insertion and swap operator is applied to producing neighborhood individual at the employed bee phase. The tournament selection is adopted to avoid falling into local optima, while, the optimized insert operator embeds in onlooker bee phase for further searching the neighborhood solution to enhance the local search ability of algorithm. The tournament selection with size 2 is again applied and a better selected solution will be performed destruction and construction of iterated greedy(IG) algorithm, and then the result replaces the worse one. Simulation results show that our algorithm has a better performance compared with the HDDE and CHS which were proposed recently. It provides the better known solutions for the makespan criterion to flow shop scheduling problem with limited buffers for the Car benchmark by Carlier and Rec benchmark by Reeves. The convergence curves show that the algorithm not only has faster convergence speed but also has better convergence value. 展开更多
关键词 discrete artificial bee colony algorithm flow shop scheduling problem with intermediate buffers destruction and construction tournament selection
下载PDF
Solving Job-Shop Scheduling Problem Based on Improved Adaptive Particle Swarm Optimization Algorithm 被引量:3
10
作者 顾文斌 唐敦兵 郑堃 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI 2014年第5期559-567,共9页
An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal ... An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal factor(HF),composed of an adaptive local hormonal factor(H l)and an adaptive global hormonal factor(H g),is devised to strengthen the information connection between particles.Using HF,each particle of the swarm can adjust its position self-adaptively to avoid premature phenomena and reach better solution.The computational results validate the effectiveness and stability of the proposed IAPSO,which can not only find optimal or close-to-optimal solutions but also obtain both better and more stability results than the existing particle swarm optimization(PSO)algorithms. 展开更多
关键词 job-shop scheduling problem(JSP) hormone modulation mechanism improved adaptive particle swarm optimization(IAPSO) algorithm minimum makespan
下载PDF
Improvement of Lagrangian relaxation performance for open pit mines constrained long-term production scheduling problem 被引量:2
11
作者 E.Moosavi J.Gholamnejad +1 位作者 M.Ataee-pour E.Khorram 《Journal of Central South University》 SCIE EI CAS 2014年第7期2848-2856,共9页
Constrained long-term production scheduling problem(CLTPSP) of open pit mines has been extensively studied in the past few decades due to its wide application in mining projects and the computational challenges it pos... Constrained long-term production scheduling problem(CLTPSP) of open pit mines has been extensively studied in the past few decades due to its wide application in mining projects and the computational challenges it poses become an NP-hard problem.This problem has major practical significance because the effectiveness of the schedules obtained has strong economical impact for any mining project.Despite of the rapid theoretical and technical advances in this field,heuristics is still the only viable approach for large scale industrial applications.This work presents an approach combining genetic algorithms(GAs) and Lagrangian relaxation(LR) to optimally determine the CLTPSP of open pit mines.GAs are stochastic,parallel search algorithms based on the natural selection and the process of evolution.LR method is known for handling large-scale separable problems; however,the convergence to the optimal solution can be slow.The proposed Lagrangian relaxation and genetic algorithms(LR-GAs) combines genetic algorithms into Lagrangian relaxation method to update the Lagrangian multipliers.This approach leads to improve the performance of Lagrangian relaxation method in solving CLTPSP.Numerical results demonstrate that the LR method using GAs to improve its performance speeding up the convergence.Subsequently,highly near-optimal solution to the CLTPSP can be achieved by the LR-GAs. 展开更多
关键词 constrained long-term production scheduling problem open pit mine Lagrangian relaxation genetic algorithm
下载PDF
Scheduling Rules Based on Gene Expression Programming for Resource-Constrained Project Scheduling Problem 被引量:3
12
作者 贾艳 李晋航 《Journal of Donghua University(English Edition)》 EI CAS 2015年第1期91-96,共6页
In order to minimize the project duration of resourceconstrained project scheduling problem( RCPSP), a gene expression programming-based scheduling rule( GEP-SR) method is proposed to automatically discover and select... In order to minimize the project duration of resourceconstrained project scheduling problem( RCPSP), a gene expression programming-based scheduling rule( GEP-SR) method is proposed to automatically discover and select the effective scheduling rules( SRs) which are constructed using the project status and attributes of the activities. SRs are represented by the chromosomes of GEP, and an improved parallel schedule generation scheme( IPSGS) is used to transform the SRs into explicit schedules. The framework of GEP-SR for RCPSP is designed,and the effectiveness of the GEP-SR approach is demonstrated by comparing with other methods on the same instances. 展开更多
关键词 resource-constrained project scheduling problem(RCPSP) gene expression programming(GEP) scheduling rules(SRs)
下载PDF
Hybrid artificial immune system and extremal optimization algorithm for permutation flowshop scheduling problem 被引量:2
13
作者 孙凯 杨根科 《Journal of Shanghai University(English Edition)》 CAS 2008年第4期352-357,共6页
The permutation flowshop scheduling problem (PFSP) is one of the most well-known and well-studied production scheduling problems with strong industrial background. This paper presents a new hybrid optimization algor... The permutation flowshop scheduling problem (PFSP) is one of the most well-known and well-studied production scheduling problems with strong industrial background. This paper presents a new hybrid optimization algorithm which combines the strong global search ability of artificial immune system (AIS) with a strong local search ability of extremal optimization (EO) algorithm. The proposed algorithm is applied to a set of benchmark problems with a makespan criterion. Performance of the algorithm is evaluated. Comparison results indicate that this new method is an effective and competitive approach to the PFSP. 展开更多
关键词 artificial immune system (AIS) extremal optimization (EO) permutation flowshop scheduling problem (PFSP)
下载PDF
A New Algorithm for Resource Constraint Project Scheduling Problem Based on Multi-Agent Systems 被引量:1
14
作者 何曙光 齐二石 李钢 《Transactions of Tianjin University》 EI CAS 2003年第4期348-352,共5页
The resource constrained project scheduling problem (RCPSP) and a decision-making model based on multi-agent systems (MAS) and general equilibrium marketing are proposed. An algorithm leading to the resource allocatio... The resource constrained project scheduling problem (RCPSP) and a decision-making model based on multi-agent systems (MAS) and general equilibrium marketing are proposed. An algorithm leading to the resource allocation decision involved in RCPSP has also been developed. And this algorithm can be used in the multi-project scheduling field as well.Finally, an illustration is given. 展开更多
关键词 resource constrained project scheduling problem multi-agent systems general equilibrium market ALGORITHM
下载PDF
Scheduling problem for hot-rolling seamless steel tube production 被引量:1
15
作者 HUO Jiazhen~(1)),LILin~(1,2)) and LI Hu~(1)) 1) School of Economics and Management TongJi University,Shanghai 20009,China 2) School of Business,East China University of Science and Technology,Shanghai 200237,China 《Baosteel Technical Research》 CAS 2010年第S1期95-,共1页
Taking the seamless tube plant of Baoshan Iron & Steel Complex in China as the background,we analyze the characters of hot rolling seamless steel tube:multi varieties,low volume,complicated production process,flex... Taking the seamless tube plant of Baoshan Iron & Steel Complex in China as the background,we analyze the characters of hot rolling seamless steel tube:multi varieties,low volume,complicated production process,flexible production routes.Then integrated scheduling problem for hot rolling seamless steel tube production is studied,which covers two key points;order-grouping problem and solution method for flowshop/jobshop scheduling problem.On the basis of these two problems,integrated scheduling decision system is developed.The design idea,function flow sheet,data processing method,and functional module of visualized human-computer interactive scheduling system implemented in seamless steel tube plant of Shanghai Baoshan Iron & Steel Complex are described into detail.Compared with manual system,the performance of system shows the applicability and superiority in several criteria. 展开更多
关键词 hot-rolling seamless steel tube production scheduling problem order-grouping problem decision system
下载PDF
A Grafted Genetic Algorithm for the Job-Shop Scheduling Problem 被引量:1
16
作者 LIXiang-jun WANGShu-zhen XUGuo-hua 《International Journal of Plant Engineering and Management》 2004年第2期91-96,共6页
The standard genetic algorithm has limitations of a low convergence rate and premature convergence in solving the job-shop scheduling problem.To overcome these limitations,this paper presents a new improved hybrid gen... The standard genetic algorithm has limitations of a low convergence rate and premature convergence in solving the job-shop scheduling problem.To overcome these limitations,this paper presents a new improved hybrid genetic algorithm on the basis of the idea of graft in botany.Through the introduction of a grafted population and crossover probability matrix,this algorithm accelerates the convergence rate greatly and also increases the ability to fight premature convergence.Finally,the approach is tested on a set of standard instances taken from the literature and compared with other approaches.The computation results validate the effectiveness of the proposed algorithm. 展开更多
关键词 grafted genetic algorithm job-shop scheduling problem premature convergence hy brid optimization strategy
下载PDF
Job shop scheduling problem based on DNA computing
17
作者 Yin Zhixiang Cui Jianzhong Yang Yan Ma Ying 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2006年第3期654-659,共6页
To solve job shop scheduling problem, a new approach-DNA computing is used in solving job shop scheduling problem. The approach using DNA computing to solve job shop scheduling is divided into three stands. Finally, o... To solve job shop scheduling problem, a new approach-DNA computing is used in solving job shop scheduling problem. The approach using DNA computing to solve job shop scheduling is divided into three stands. Finally, optimum solutions are obtained by sequencing A small job shop scheduling problem is solved in DNA computing, and the "operations" of the computation were performed with standard protocols, as ligation, synthesis, electrophoresis etc. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems. 展开更多
关键词 DNA computing job shop scheduling problem WEIGHTED tournament.
下载PDF
A new polynomial algorithm for a parallelidentical scheduling problem
18
作者 Yumei LI Hongxing LI Vincent C. YEN 《控制理论与应用(英文版)》 EI 2007年第4期345-350,共6页
A precedence order is defined based on the release dates of jobs' direct successors. Using the defined precedence order and Heap Sort, a new polynomial algorithm is provided which aims to solve the parallel schedulin... A precedence order is defined based on the release dates of jobs' direct successors. Using the defined precedence order and Heap Sort, a new polynomial algorithm is provided which aims to solve the parallel scheduling problem P|pj = 1, r j, outtree| ∑Cj Cj. The new algorithm is shown to be more compact and easier to implement. 展开更多
关键词 scheduling problem Precedence order Heap sort ALGORITHM
下载PDF
A Genetic Algorithm for the Flowshop Scheduling Problem
19
作者 Qi Yuesheng Wang Baozhong Kang Lishan(State Key Laboratory of Software Engineering, Wuhan University, Wuhan 430072,China) 《Wuhan University Journal of Natural Sciences》 CAS 1998年第4期410-412,共3页
The flowshop scheduling problem is NP complete. To solve it by genetic algorithm, an efficient crossover operator is designed. Compared with another crossover operator, this one often finds a better solution within th... The flowshop scheduling problem is NP complete. To solve it by genetic algorithm, an efficient crossover operator is designed. Compared with another crossover operator, this one often finds a better solution within the same time. 展开更多
关键词 genetic algorithm crossover operator flowshop scheduling problem combinatorial optimization
下载PDF
A Class of Single Machine Scheduling Problems with Variable Processing Time
20
作者 周荷芳 周贤伟 《Journal of Modern Transportation》 2001年第1期93-100,共8页
In this paper, single machine scheduling problems with variable processing time are raised. The criterions of the problem considered are minimizing scheduling length of all jobs, flow time and number of tardy jobs and... In this paper, single machine scheduling problems with variable processing time are raised. The criterions of the problem considered are minimizing scheduling length of all jobs, flow time and number of tardy jobs and so on. The complexity of the problem is determined. [WT5HZ] 展开更多
关键词 single machine scheduling problem NP-HARD variable processing time complexity theory
下载PDF
上一页 1 2 3 下一页 到第
使用帮助 返回顶部