Junqing Sun

Tianjin University of Technology

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Meiling Feng

Tianjin University of Technology

Bin Sun

Nankai University

Peng Yang

Guangzhou Panyu Polytechnic

Chengyi Xia

Tianjin Polytechnic University

Shiwen Sun

Tianjin University of Technology

Sun Bin

Tianjin University of Technology

Fenglian Liu

Affiliated Hospital of Guizhou Medical University

Li Wang

Beijing Technology and Business University

Mei Han

Shandong Normal University

Gou Zhijing

Tianjin University of Technology

Cooperative Institutions

Tianjin University of Technology

Nankai University

Chinese Academy of Sciences

Tsinghua University

Ministry of Education of the People's Republic of China

Tianjin University

China National Petroleum Corporation (China)

Jilin University

University of Chinese Academy of Sciences

Hebei University of Technology

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

Simulation and optimization of multi-echelon inventory control and coordination in supply chain based on Arena

Li Huixian Junqing Sun Yang Zhe

This paper addresses the optimization problem of the coordination of the multi-echelon inventories for the supply chain which is composed of a supplier with unlimited inventory, two manufacturers and a distributor and in which the demands involve not only the determined order but also random demands. All of the manufacturers and the distributor apply the hybrid policy (T, s, S) to manage their inventories of the products and raw materials. Firstly, the mathematical model is proposed to describe the optimization problem of the coordination of the multi-echelon inventories of the supply chain, which determines the safe inventories and maximum inventories of the each node to minimize the average inventory management cost of the system per unit time and the lead time of the order demand, maximize satisfaction rate of the customer demand. Then the simulation based optimization method, which is composed of the simulation model of the multi-echelon inventory system and the GA based optimization algorithm, is employed to solve the problem. The simulation software Arena is employed to design and implement the simulation model of the system and optimization algorithm. Finally, the simulated data cases are computed to verify the effectiveness of the method proposed in this paper.

Simulation-based optimization

Distributor

Supply chain optimization

Cite

Citations (0)

WordIllusion: An adversarial text generation algorithm based on human cognitive system

Cognitive Systems Research (2023)

Haoran Fu Chundong Wang Jiaqi Sun Yumeng Zhao Hao Lin

10.1016/j.cogsys.2023.101179

Cite

Citations (0)

On route optimization of CTs in container terminal based on pool strategy

Lei Li Junqing Sun Han Mei

The container truck is an important factor affecting the efficiency of the container yard in the container terminal. The traditional schedule of container trucks is based on operation queues. The schedule of this paper is based on pool strategy, and loading and unloading containers are operating at the same time. This paper considers transporting time of container trucks and operating time of yard cranes, and constructs math model, targeting the minimum of time about container trucks. Immune and tabu-search algorithm is put forward for solving the model. The results of the experiment prove that pool strategy improves the efficiency of container trucks and yard cranes comparing to operation queues, and then improves the efficiency of the yard.

Yard

10.1109/chicc.2008.4605510

Cite

Citations (3)

Optimal Scheduling of Combined Wafer Fabrication Equipment Taking Mechanical Arms as Buffers

IEEE Conference Proceedings (2019)

Junqing Sun Yilin Wang Meiling Feng Bin Sun

Wafer fabrication

Source

Cite

Citations (0)

Service portfolio optimization algorithm based on value model and graph theory in SOA

Zhixin Yang Hongyun Ning Junqing Sun Jiabao Yang

Business process reengineering frequently occurs in complex service systems because of its dynamic, random and varied running characteristics. To solve the problem, we proposed a novel SOA portfolio optimization algorithm based on value model and graph theory. Firstly, in order to strengthen the QoS analytical capacity of SOA, the value model is introduced into the SOA system to describe customer's service requirements of both function and non-function aspects. Next, a directed graph of SOA services and a value dependence graph of services are provided, as well as a service portfolio optimization algorithm designed based on the graphs. Finally, the simulated data case is used to analyze and verify the methods proposed in this paper. The result shows that introducing the value model and graph algorithm into the SOA-based service system can effectively improve the quality of service portfolio.

Business process reengineering

10.1109/icsess.2013.6615256

Cite

Citations (0)

Interdependency enriches the spatial reciprocity in prisoner’s dilemma game on weighted networks

Physica A Statistical Mechanics and its Applications (2015)

Xiao-Kun Meng Shiwen Sun Xiaoxuan Li Li Wang Chengyi Xia

Lattice (music)

Interdependent networks

Reciprocity

Evolutionary game theory

10.1016/j.physa.2015.08.031

Cite

Citations (40)

Multi-period optimal manpower planning with two types of employees in an employee leasing center

Junqing Sun Yongjian Li Fengsheng Tu

This paper studies the issue of manpower planning in an employee leasing center. The center is engaged on the business of leasing its own employees and/or acting as an agent for employees outside the center, where there are two types of employees, the high-ranked employees have mixed skills and can be substituted for the other type of employees to work. First we propose stochastically optimal control models for the multi-period manpower planning in an employee leasing center. In the model there are stochastic constraints. Then we transform stochastic constraints into deterministic constraints. Next we derive some properties to limit the scope of the feasible states in each period without affecting the optimal solution and develop a dynamic programming (DP) approach. Furthermore, to improve the computational efficiency, we also propose a heuristic approximate (HA) approach to derive a near-optimal solution with lower computational complexity. Finally, numerical results are provided to show that the approach HA is much superior to the approach DP concerning the computational time, and the relative error between the two solutions derived by them is no more than 6% in most of cases.

Center (category theory)

Scope (computer science)

Manpower planning

10.1109/icsssm.2005.1499499

Cite

Citations (2)

A novel multi-RTGC scheduling problem based on genetic algorithm

Wenying Yue Junqing Sun Fenglian Liu Peng Yang Han Mei

In the storage yard, the scheduling of gantry cranes plays an important role in improving the efficiency of container terminal. This paper mainly addresses the scheduling problem of multiple RTGCs when containers in the terminal yard need to be intensively transported to hinterland. In order that all container tasks can be completed in the shortest time, our objective is to find the optimal RTGC scheduling, which means that it must be decided how to allocate the tasks to be handled to each RTGC and how to arrange for any RTGC the servicing sequence of the tasks so that all the tasks could be handled as soon as possible. Firstly a mixed integer programming model is proposed to formulate the problem which is an NP-hard problem. In the model, the precedence relations between tasks are taken into account. Then according to complexity of the problem, the genetic algorithm is utilized to solve it. Computational experiments show that the proposed approaches are applicable to solve this difficult but essential terminal operation problem.

Yard

10.1109/icsssm.2010.5530237

Cite

Citations (1)

Agent Based Container Terminal Optimization

Junqing Sun Peng Yang

A distributed MAS (multi agent system) architecture for moveable port resource operation has been presented in the paper, which builds upon elements from decentralized strategies. The system provides a feasible optimization solution to the problem due to its inherent complexity. Under such solution, an intelligent planning algorithm is continuously optimized by the dynamic and co-operative rescheduling of yard resources.

Yard

Port (circuit theory)

Resource Management

10.1109/case.2009.15

Cite

Citations (2)

Optimal Scheduling of Combined Wafer Fabrication Equipment Taking Mechanical Arms as Buffers

Junqing Sun Yilin Wang Meiling Feng Bin Sun

This paper addresses the problem of optimal scheduling of combined dual-arm wafer fabrication equipment which may take its two mechanical arms as temporary buffers during manufacturing process. Firstly, the mathematical model is proposed to describe the problem of the optimal scheduling of the mechanical arms and processing cavities of the combined dual-arm wafer fabrication equipment. The model takes minimizing the average processing time for each wafer as its objective. Then, a heuristic algorithm is designed to solve the problem. Finally, this paper employs some data cases which come from practical production of wafer to verify the validity of the algorithm and the method. The experimental results show that the efficiency of the combined wafer manufacturing equipment can be increased greatly through taking its two mechanical arms as temporary buffers.

Wafer fabrication

Wafer-level packaging

Semiconductor device fabrication

10.1109/icsai48974.2019.9010419

Cite

Citations (0)