Guangyu Tan

China International Engineering Design & Research Institute

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Guanghui Li

Central South University

Guangjun Liu

Tongji University

Ningxia Yin

Guangdong Ocean University

Zhiqiang Xie

Harbin University of Science and Technology

Yiming Rong

Tsinghua University

Can Liu

Southwest Forestry University

Huanlao Liu

Guangdong Ocean University

Shuzhen Hao

Hebei Agricultural University

Guangjie Ye

Harbin University of Science and Technology

Yong Liu

Xi'an University of Technology

Cooperative Institutions

Harbin University of Science and Technology

Guangdong Ocean University

Chinese Academy of Sciences

Harbin Engineering University

Tongji University

Zhejiang University

Heilongjiang University of Science and Technology

Huazhong University of Science and Technology

Shanghai Jiao Tong University

Beihang University

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

Optimization controlling algorithm of shortening idle time for the dynamic assembly scheduling

Dianji yu kongzhi xuebao (2008)

Guangyu Tan

Aiming at wasting idle time problem for the less independent operations being inserted in the biggish idle time in dynamic assembly scheduling that only considering the independent operations being sorted in descending,an optimization controlling algorithm of shortening idle time is presented for independent operations.This algorithm divided the operations into the independent operations and the dependent operations that have the only immediate predecessor and immediate successor by analyzing assembly operations chart with different starting assembly time.The independent operations and idle time on the critical machine were sorted in descending respectively,and the independent operations were inserted in the corresponding idle time by comparing the assembly time of independent operation and idle time,in order to reduce the total idle time of the machines and make the total assembly time be less or a little more than the total assembly time of the operations on the critical path.The experiment shows that the algorithm proposed has lower complexity and can shorten the total assembly time.

Idle

Critical path method

Source

Cite

Citations (3)

CALCULATING DISTANCE BETWEEN 3D OBJECTS USING NORMAL VECTOR

Robot (1998)

Guangyu Tan

The distance between 3D objects is indispensable to robot path planning and assembly path planning. Real time simulation systems need fast and simple the algorithm for the distance between 3D objects. In the meantime, the algorithm is required to support path planning. This paper presents the B Rep based method. Our method uses object surface normal vectors to obtain vector distances between 3D objects. Our method achieves the above presented requests to the algorithm for distance.

Normal

Signed distance function

Distance transform

Source

Cite

Citations (0)

Study on Complex Product Scheduling Problem with No-wait Constraint between Operations

ACTA AUTOMATICA SINICA (2009)

Zhiqiang Xie Zhi-Min Li Shuzhen Hao Guangyu Tan

10.3724/sp.j.1004.2009.00983

Cite

Citations (5)

<title>Design and implementation of rule-based visualized user interface</title>

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE (2000)

Deyun Chen Guangyu Tan

Based on the prime factors of multi-windows such as the shape, size, position, color, content and icons applied, the visualized user interface specification language (VUISL) is designed. The visualized user interface software generator (VUISG) is developed by YACC and C language. Thus the needed interface software can be generated automatically, whose universality and visualized ability are high.

Interface (matter)

Graphical user interface

10.1117/12.403678

Cite

Citations (0)

Notice of Retraction: Study on Confirming Increasable Bottleneck Device in Complex Product Dynamic Scheduling

International Conference on Computer Modeling and Simulation (2009)

Zhiqiang Xie Yong Liu Shuzhen Hao Guangyu Tan Fengru Wang

This article has been retracted by the publisher.

10.1109/iccms.2009.24

Cite

Citations (2)

Reconstruction Method for Complex Groove of Milling Insert Using Local Rule of Cellular Automata

Guangyu Tan Guangjun Liu Guanghui Li Yiming Rong Hui Song

This paper presents a groove reconstruction method based on the local rule of Cellular Automata (CA). A local rule for groove reconstruction is proposed to design and optimize the groove of milling insert. The insert is firstly divided into a large number of cells that typically form a regular grid over the domain. The domain consists of regular square cells with discrete variables and the discrete CA model is built. As the cells in the CA domain only interact with their neighboring cells when performing local computations, the governing equation for the whole domain is not necessary. Then the states of cells are modified according to the local rule applied. The state of the entire system is updated based on the state of the cell and its neighboring cells. Collectively, these cells’ states define the state of the entire domain, and the groove can be reconstructed according to the state of the domain. The reconstructed groove is tested by a FEM simulation. The simulation results show that the reconstructed groove has a satisfied performance on the stress field.

Groove (engineering)

Insert (composites)

10.1115/imece2007-43158

Cite

Citations (0)

Statistical Investigation of the Widths of Supra-arcade Downflows Observed During a Solar Flare

arXiv (Cornell University) (2023)

Guangyu Tan Yijun Hou Hui Tian

Supra-arcade downflows (SADs) are dark voids descending towards the post-reconnection flare loops and exhibit obvious variation in properties like width. However, due to the lack of further statistical studies, the mechanism behind such variations hitherto remains elusive. Here we statistically investigated widths of 81 SADs observed in one flare by the Solar Dynamics Observatory (SDO). For each of SADs, six moments were selected with equal time intervals to measure their widths at different stages of their evolution. It is found that most SADs show a roughly monotonous width decrease during their descents, while some SADs with small initial widths can have complex evolutions. 3D reconstruction results based on SDO and Solar Terrestrial Relations Observatory Ahead (STEREO-A) images and thermal properties analysis reveal that differences in magnetic and plasma environments may result in that SADs in the north are overall wider than those in the south. Additionally, correlation analysis between the width and other parameters of SADs was further conducted and revealed that: (1) SADs with different initial widths show no significant differences in their temperature and density evolution characteristics; (2) SADs with small initial widths usually appear in lower heights, where more frequent collisions between SADs could lead to their intermittent acceleration, width increment, and curved trajectories. These results indicate that SADs with different initial widths are produced the same way while different environments (magnetic field or plasma) could affect their subsequent width evolutions.

Flare

Solar flare

Solar observatory

10.48550/arxiv.2304.11307

Cite

Citations (0)

An algorithm of shortening idle time for the assembly problem

Journal of Natural Science of Heilongjiang University (2007)

Guangyu Tan

According to actual assembly conditions, the operations are divided into the dependent operations that had the only immediate predecessor and immediate successor and the independent ones in common assembly problems by analyzing the assembly operation chart. And a new assembly algorithm, named shorten idle time algorithm, is presented for assembly the independent operations. This algorithm scheduled the independent operations and idle times which were on the critical machine by size respectively and according to the comparative result, the algorithm used different methods to insert the independent operation to the corresponding idle time. This algorithm could reduce the total idle time of the machines and let the total assembly time be less than the total assembly time of the operations on the critical path. This assembly algorithm was proved to be practical and effective by examples for the assembly problems.

Idle

Critical path method

Source

Cite

Citations (0)

Study on Job Shop Scheduling with Many Function-Same Machines

International Conference on Mechatronics and Automation (2007)

Zhiqiang Xie Guangjie Ye Yong Liu Guangyu Tan

Aiming at some operations of job can be assembled by any machine selected from the function-same machine set, a secondary optimization algorithm for operations on function-same machines is put forward: the machine which can make the completion time of operation early will be selected according to a dispatching rule (earliest due date, EDD), and operations are arranged in the right position of machine selected, then each operation can be assembled as soon as possible, and the total processing time of job can be shortened as soon as possible. To independent operations optimum scheduling algorithm is adopted: the inserting position of operations will be confirmed according to the margin that processing time of operations is subtracted from idle time of machine, and the operation will be inserted in the position with minimal margin. The experiment shows that the new algorithm without increasing complexity has better scheduling result for job shop scheduling problem with many function-same machines.

Margin (machine learning)

Idle

10.1109/icma.2007.4303733

Cite

Citations (2)

Identification of Mills Eccentricity Based on Peak Force of Single Edge

Journal of Mechanical Engineering (2013)

Guangyu Tan

The eccentricity of cutter may induce great variation of milling force.In order to identify the geometry of eccentricity,regularities of milling force varying with eccentricity are studied.Milling force on single edge is mathematically expressed as functions of the rotation angle and the sequence number of cutter edge.By mathematically deducing,the peak milling force of each cutter edge is found to be a discrete sine function of only the sequence number,its mean part be the nominal force without cutter eccentricity,and the variable part be the increment force induced by eccentricity,moreover,the increment force be same with spindle rotation in frequency,its initial phase be dependent on the angle of eccentricity,and its amplitude be in direct proportion to both the distance of eccentricity and axial milling depth,but irrelevant to feed per tooth.Based on these findings,a kind of data fitting method is present to estimate the distance and angle of eccentricity,which is mainly to fit peak milling forces of every cutter edge with sine function.This method is simple,and needs only one milling test.The results of milling experiment agree with above findings,and show that this estimation method is validate.This study reveals the eccentricity-relate characteristics of peak milling force,and presents a simple method of estimating the geometry of eccentricity.Study results can be used in identifying the state of milling process.

Eccentricity (behavior)

Milling cutter

Sine

Source

Cite

Citations (0)