Integrated Scheduling Algorithm with Setup Time

2011 ◽  
Vol 213 ◽  
pp. 226-230
Author(s):  
Zhi Qiang Xie ◽  
Jing Yang ◽  
Yu Zheng Teng ◽  
Lan Lan
Keyword(s):  
Time Complexity ◽  
Scheduling Algorithm ◽  
Research Result ◽  
Setup Time ◽  
Scheduling Problem ◽  
Start Time ◽  
Complex Products ◽  
Integrated Scheduling

Aiming at the problem that there is no research result in the complex products processing and assemble integrated scheduling problem with setup time, this paper proposes strategy to resolve this problem. That is to determine scheduling sequence of procedures according to layer priority strategy, shorten time strategy and long path strategy. Then adopt algorithm of inserting setup time dynamically to determine the start time of procedures by scheduling sequence. As this algorithm avoids to move scheduled procedures many times after inserting setup time, the time complexity is only secondary. So this algorithm is simple and has high scheduling efficiency.

A multi-shop integrated scheduling algorithm with fixed output constraint

2021 ◽  
pp. 1-9
Author(s):  
Yingchun Xia ◽  
Zhiqiang Xie ◽  
Yu Xin ◽  
Xiaowei Zhang
Keyword(s):  
Constraint Programming ◽  
Programming Model ◽  
Scheduling Algorithm ◽  
Processing Parameters ◽  
Scheduling Problem ◽  
Integrated Scheduling ◽  
Scheduling Scheme ◽  
Wide Range ◽  
Constraint Programming Model ◽  
Output Constraint

The customized products such as electromechanical prototype products are a type of product with research and trial manufacturing characteristics. The BOM structures and processing parameters of the products vary greatly, making it difficult for a single shop to meet such a wide range of processing parameters. For the dynamic and fuzzy manufacturing characteristics of the products, not only the coordinated transport time of multiple shops but also the fact that the product has a designated output shop should be considered. In order to solve such Multi-shop Integrated Scheduling Problem with Fixed Output Constraint (MISP-FOC), a constraint programming model is developed to minimize the total tardiness, and then a Multi-shop Integrated Scheduling Algorithm (MISA) based on EGA (Enhanced Genetic Algorithm) and B&B (Branch and Bound) is proposed. MISA is a hybrid optimization method and consists of four parts. Firstly, to deal with the dynamic and fuzzy manufacturing characteristics, the dynamic production process is transformed into a series of time-continuous static scheduling problem according to the proposed dynamic rescheduling mechanism. Secondly, the pre-scheduling scheme is generated by the EGA at each event moment. Thirdly, the jobs in the pre-scheduling scheme are divided into three parts, namely, dispatched jobs, jobs to be dispatched, and jobs available for rescheduling, and at last, the B&B method is used to optimize the jobs available for rescheduling by utilizing the period when the dispatched jobs are in execution. Google OR-Tools is used to verify the proposed constraint programming model, and the experiment results show that the proposed algorithm is effective and feasible.

An Effective Memetic Algorithm for the Distributed Integrated Scheduling of Tree-Structured Products

2021 ◽  
pp. 2150001
Author(s):  
Yilong Gao ◽  
Zhiqiang Xie ◽  
Qing Jia ◽  
Xu Yu
Keyword(s):  
Sampling Method ◽  
Memetic Algorithm ◽  
Scheduling Algorithm ◽  
Optimal Solution ◽  
Estimation Algorithm ◽  
Probability Models ◽  
Complex Products ◽  
Integrated Scheduling ◽  
Local Search Strategy ◽  
Representation Method

Aiming at the distributed integrated scheduling of complex products with tree structure, a memetic algorithm-based distributed integrated scheduling algorithm is proposed. Based on the framework of the memetic algorithm, the algorithm uses a distributed estimation algorithm for global search and performs a local search strategy based on the critical operation set for the current optimal solution obtained in each evolutionary generation. A bi-chain-based individual representation method is presented and a simple greedy insertion-based decoding method is given; two position-based probability models are built, which are used to describe the distribution of the operation priority and factory assignment, respectively. Based on the designed probability models, two learning-based updating mechanisms and an improved sampling method are given, which ensures that the population evolves towards a promising region. In order to enhance the searchability for the superior solutions, nine disturbance operators based on the critical operation set are presented. The parameters are determined by the design-of-experiment (DOE) test, and the effectiveness of the proposed algorithm is verified by comparative experiments.

Research on Multitask Collaborative Scheduling Problem with Heuristic Strategies

2011 ◽  
Vol 66-68 ◽  
pp. 758-763
Author(s):  
Fan Zhang ◽  
Gui Fa Teng ◽  
Jian Bin Ma ◽  
Jie Yao
Keyword(s):  
Scheduling Algorithm ◽  
Scheduling Problem ◽  
Agricultural Machinery ◽  
Start Time ◽  
Farm Machinery ◽  
Scheduling Scheme ◽  
Scheduling Model ◽  
Heuristic Strategies ◽  
Collaborative Scheduling ◽  
Minimal Resource

According to problems existed in the current farm machinery scheduling process, a new farm machinery scheduling scheme is adopted in this dissertation. The collaborative scheduling model of farm machinery is established and multitask collaborative scheduling algorithm is designed through analyzing the differences between Vehicle Scheduling Problem and agricultural machinery scheduling in the dissertation. Earliest Start Time First and minimal resource allocated capacity first strategies are used in the farm machinery scheduling. The algorithm is useful for the case of machinery owner with sufficient farm machinery. The experiment proves that the collaborative scheduling algorithm is more effective than the serial scheduling algorithm.

scholarly journals Integrated scheduling algorithm for multiple complex products with due date constraints

2021 ◽  
Vol 1748 ◽  
pp. 032030
Author(s):  
Xinkun Wang ◽  
Yuchuan Song ◽  
Yuji Zou ◽  
Weifei Guo ◽  
Yi Wang
Keyword(s):  
Scheduling Algorithm ◽  
Due Date ◽  
Complex Products ◽  
Integrated Scheduling

scholarly journals A Scheduling Algorithm for Multi-Workshop Production Based on BOM and Process Route

2021 ◽  
Vol 11 (11) ◽  
pp. 5078
Author(s):  
Lihong Qiao ◽  
Zhenwei Zhang ◽  
Zhicheng Huang
Keyword(s):  
Scheduling Algorithm ◽  
Particle Swarm Algorithm ◽  
Scheduling Problem ◽  
Complex Products ◽  
Bill Of Materials ◽  
Search Path ◽  
Process Route ◽  
Path Search ◽  
Level Process

For the scheduling problem of complex products in multi-workshop production, this paper studied the BOM (Bill of Materials) structure of complex products and the characteristics of the process route and developed the construction method of a multi-level process network diagram. Based on this, a comprehensive mathematical model for scheduling on multi-workshop production was proposed. An improved particle swarm algorithm (PSO) was proposed to solve the problem. By constructing the network subgraph, the invalid search path of the algorithm was avoided, and the efficiency of the algorithm was improved. In addition, for the scheduling problem with product time constraints, this paper presented a path search rescheduling strategy to ensure that the algorithm could obtain an effective search path. Finally, the model and algorithm were verified through a case study. This paper optimized the parameters of the algorithm by different tests and obtained the optimal range of the parameters. At the same time, through the analysis of the scheduling of complex products in a multi-workshop environment, the effectiveness and practicability of the above methods were verified.

A NEW ALGORITHM FOR MULTI-SKILL RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM BASED ON CUCKOO SEARCH STRATEGY

2020 ◽  
Vol 65 (6) ◽  
pp. 98-109
Author(s):  
Huu Dang Quoc ◽  
Loc Nguyen The ◽  
Cuong Nguyen Doan ◽  
Toan Phan Thanh
Keyword(s):  
Project Scheduling ◽  
Search Strategy ◽  
Scheduling Algorithm ◽  
Optimal Schedule ◽  
Cuckoo Search ◽  
Scheduling Problem ◽  
Resource Constrained ◽  
Start Time ◽  
Resource Constrained Project Scheduling ◽  
Project Scheduling Problem

The purpose of this paper is to consider the project scheduling problem under such limited constraint, called Multi-Skill Resource-Constrained Project Scheduling Problem or MS-RCPSP. The algorithm proposed in this paper is to find the optimal schedule, determine the start time for each task so that the execution time (also called makespan) taken is minimal. At the same time, our scheduling algorithm ensures that the given priority relationships and constraints are not violated. Our scheduling algorithm is built based on the Cuckoo Search strategy. In order to evaluate the proposed algorithm, experiments were conducted by using the iMOPSE dataset. The experimental results proved that the proposed algorithm found better solutions than the previous algorithm.

Dynamic Integrated Scheduling Algorithm of Complex Multi-Products with Identical Machines

2010 ◽  
Vol 129-131 ◽  
pp. 897-901
Author(s):  
Zhi Qiang Xie ◽  
Jing Yang ◽  
Yu Jing He ◽  
Guang Jie Ye
Keyword(s):  
Scheduling Algorithm ◽  
Virtual Manufacturing ◽  
Scheduling Problem ◽  
Scheduling Strategy ◽  
Integrated Scheduling ◽  
Identical Machines

Aiming at the dynamic integrated scheduling problem of complex multi-products with different arriving time and identical machines, an algorithm is presented by this paper that complex multi-products can be built a virtual manufacturing tree. And the tree will be divided into many subtrees according to the subsection idea. Then these subtrees will be divided into dependent operations and independent operations. Corresponding scheduling strategy is put forward according to the features of operations and the complementarities of identical machines. For dependent operations, forward greedy rule is mainly adopted. For the independent operations, this paper mainly adopts the optimum scheduling rule. Example shows that favorable results can be obtained according to scheduling strategy adopted by this paper.

scholarly journals Integrated scheduling algorithm based on the priority constraint table for complex products with tree structure

2020 ◽  
Vol 12 (12) ◽  
pp. 168781402098520
Author(s):  
Yilong Gao ◽  
Zhiqiang Xie ◽  
Xinyang Liu ◽  
Wei Zhou ◽  
Xu Yu
Keyword(s):  
Scheduling Algorithm ◽  
Tree Structure ◽  
Initial Population ◽  
Complex Products ◽  
Dynamic Priority ◽  
Integrated Scheduling ◽  
Intelligent Optimization Algorithms ◽  
Local Search Strategy ◽  
Encoding Method ◽  
Evolutionary Operators

Aiming at the existing intelligent optimization algorithms for solving the integrated scheduling problem of complex products with tree structure, there are problems of missing optimal solutions when designing encoding methods or generating infeasible offspring while designing evolutionary operators, an integrated scheduling algorithm based on the priority constraint table is proposed in this paper. A novel encoding method based on the dynamic priority constraint table is developed, which can guarantee the feasibility and completeness of the initial population individuals. For the legitimacy of the generated offspring individuals, two new different crossover and mutation methods are designed separately. The introduced evolutionary operators can avoid the detection and repairment of the infeasible individuals. An insertion-based greedy decoding method is also developed. In addition, based on the critical operations, a local search strategy is presented to enhance the search ability for the superior solutions. The feasibility and superiority of the proposed algorithm is verified by comparative experiments.

Sign in / Sign up

Export Citation Format

Share Document