Zhengyi Zhao - Academia.edu (original) (raw)

Papers by Zhengyi Zhao

2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT'07), 2007

We consider the problem of resource allocation and scheduling where information and decisions are... more We consider the problem of resource allocation and scheduling where information and decisions are decentralized, and our goal is to propose a market mechanism that allows resources from a central resource pool to be allocated to distributed decision makers (agents) that seek to optimize their respective scheduling goals. We propose a generic combinatorial auction mechanism that allows agents to competitively bid for the resources needed in a multi-period setting, regardless of the respective scheduling problem faced by the agent, and show how agents can design optimal bidding strategies to respond to price adjustment strategies from the auctioneer. We apply our approach to handle real-time large-scale dynamic resource coordination in a mega-scale container terminal.

2008 IEEE International Conference on Cybernetics and Intelligent Systems, CIS 2008, 2008

Through empirical comparison of classical Job Shop Problems (JSP) with multi-machine consideratio... more Through empirical comparison of classical Job Shop Problems (JSP) with multi-machine consideration, we find that the objective to minimize the sum of weighted tardiness has a better wait property compared with the objective to minimize the makespan. Further, we test the proposed Iterative Minimization Micro-model (IMM) heuristic method with the Mixed Integer Programming (MIP) solution by CPLEX. For multi-machine problems, the IMM heuristic method is faster and achieves a better solution. Finally, for a large problem instance with 409 jobs and 30 types of machines, IMM-heuristic method is compared with ProModel and we find that the heuristic method is slightly better.

Page 1. Utility Pricing Auction for Multi-period Resource Allocation in Multi-Machine Flow Shop P... more Page 1. Utility Pricing Auction for Multi-period Resource Allocation in Multi-Machine Flow Shop Problems ∗† Hoong Chuin LAU Zhengyi John ZHAO School of Information Systems Singapore Management University Singapore 178902 ‡ ...

IEEE Transactions Automation Science and Engineering, 2011

In this paper, we consider the problem of allocating machine resources among multiple agents, eac... more In this paper, we consider the problem of allocating machine resources among multiple agents, each of which is re- sponsible to solve a flowshop scheduling problem. We present an iterated combinatorial auction mechanism in which bid gener- ation is performed within each agent, while a price adjustment procedure is performed by a centralized auctioneer. While this approach is fairly well-studied

Proceedings of the IEEE International Conference on Control Applications, 2009

For the purpose of generating a standardized environment to test scheduling solvers on scheduling... more For the purpose of generating a standardized environment to test scheduling solvers on scheduling problems and to rank the results in comparison to other solvers, a simulation-based framework for a dynamic resource allocation test bed is proposed and realized. Our focus is on multiple-machine problem formulations, predictable dynamics, event based control and especially their combination. The framework separates the system

2011 International Conference on Electrical Machines and Systems, 2011

Page 1. Simplified High-order Feed Forward Control in Mechatronics Zhengyi John ZHAO GuangNeng WA... more Page 1. Simplified High-order Feed Forward Control in Mechatronics Zhengyi John ZHAO GuangNeng WANG Srikanth Boaz Kramer Abstract—We study the feed-forward (FF) control in several typical mechatronics systems. ...

2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT'07), 2007

We consider the problem of resource allocation and scheduling where information and decisions are... more We consider the problem of resource allocation and scheduling where information and decisions are decentralized, and our goal is to propose a market mechanism that allows resources from a central resource pool to be allocated to distributed decision makers (agents) that seek to optimize their respective scheduling goals. We propose a generic combinatorial auction mechanism that allows agents to competitively bid for the resources needed in a multi-period setting, regardless of the respective scheduling problem faced by the agent, and show how agents can design optimal bidding strategies to respond to price adjustment strategies from the auctioneer. We apply our approach to handle real-time large-scale dynamic resource coordination in a mega-scale container terminal.

2011 Third International Conference on Measuring Technology and Mechatronics Automation, 2011

Page 1. High Order Smooth Motion Command Generation for FFC-Digital Controller Zhengyi John ZHAO ... more Page 1. High Order Smooth Motion Command Generation for FFC-Digital Controller Zhengyi John ZHAO efsika.zzytgx@yahoo.com GuangNeng WANG guangneng.wang@ hanslaser.com Abstract—We studied the general motion ...

Proceedings of the 2007 IEEE International Conference on Mechatronics and Automation, ICMA 2007, 2007

A twin-sine command generator is proposed, which mainly caters for high performance motion contro... more A twin-sine command generator is proposed, which mainly caters for high performance motion control applications. Both precalculation and real-time control set-point generator are investigated. This command generator has up to 3rd order continuity in derivative of distance command, constant speed motion is allowable and it has very low computational cost. For the application-wise, we simply test on one of the

Proceedings of the 10th international conference on Electronic commerce - ICEC '08, 2008

Page 1. Utility Pricing Auction for Multi-period Resource Allocation in Multi-Machine Flow Shop P... more Page 1. Utility Pricing Auction for Multi-period Resource Allocation in Multi-Machine Flow Shop Problems ∗† Hoong Chuin LAU Zhengyi John ZHAO School of Information Systems Singapore Management University Singapore 178902 ‡ ...

IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews), 2000

An integer programming (IP) model is proposed for integrated resource allocation and operation sc... more An integer programming (IP) model is proposed for integrated resource allocation and operation scheduling for a multiple job-agents system. Each agent handles a specific job-list in a bidirectional flowshop. For the individual agent scheduling problem, a formulation is proposed in continuous time domain and compared with an IP formulation in discrete time domain. Of particular interest is the formulation of the machine utilization functionboth in continuous time and discrete time. Fast heuristic methods are proposed with the relaxation of the machine capacity. For the integrated resource allocation and scheduling problem, a linear programming relaxation approach is applied to solve the global resource allocation and a fast heuristic method is applied to solve each scheduling subproblem. The proposed solution is compared experimentally with that from the integer programming solver by CPLEX. Index Terms-Flowshop scheduling, multiple machine, resource allocation.

IEEE Transactions on Automation Science and Engineering, 2000

In this paper, we consider the problem of allocating machine resources among multiple agents, eac... more In this paper, we consider the problem of allocating machine resources among multiple agents, each of which is responsible to solve a flowshop scheduling problem. We present an iterated combinatorial auction mechanism in which bid generation is performed within each agent, while a price adjustment procedure is performed by a centralized auctioneer. While this approach is fairly well-studied in the literature, our primary innovation is in an adaptive price adjustment procedure, utilizing variable step-size inspired by adaptive PID-control theory coupled with utility pricing inspired by classical microeconomics. We compare with the conventional price adjustment scheme proposed in Fisher (1985), and show better convergence properties. Our secondary contribution is in a fast bid-generation procedure executed by the agents based on local search. Putting both these innovations together, we compare our approach against a classical integer programming model as well as conventional price adjustment schemes, and show drastic run time improvement with insignificant loss of global optimality.

2007 IEEE 22nd International Symposium on Intelligent Control, 2007

We study a special bidirectional flow shop problem with multi-machine capacity and sequencing con... more We study a special bidirectional flow shop problem with multi-machine capacity and sequencing constraints on critical operations. A formulation is proposed in continuous time domain and compared with a mixed integer programming (MIP) formulation in discrete time domain. Of particular interest to us is the formulation of the machine utilization function -both in continuous time and in discrete time domain. Fast heuristics are proposed with the relaxation of the machine capacity. A Lagrangian-based heuristic procedure is used to further reduce the duality gap. The performance of the heuristic and Lagrangian relaxation is compared with optimal solutions experimentally.

2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT'07), 2007

We consider the problem of resource allocation and scheduling where information and decisions are... more We consider the problem of resource allocation and scheduling where information and decisions are decentralized, and our goal is to propose a market mechanism that allows resources from a central resource pool to be allocated to distributed decision makers (agents) that seek to optimize their respective scheduling goals. We propose a generic combinatorial auction mechanism that allows agents to competitively bid for the resources needed in a multi-period setting, regardless of the respective scheduling problem faced by the agent, and show how agents can design optimal bidding strategies to respond to price adjustment strategies from the auctioneer. We apply our approach to handle real-time large-scale dynamic resource coordination in a mega-scale container terminal.

2008 IEEE International Conference on Cybernetics and Intelligent Systems, CIS 2008, 2008

Through empirical comparison of classical Job Shop Problems (JSP) with multi-machine consideratio... more Through empirical comparison of classical Job Shop Problems (JSP) with multi-machine consideration, we find that the objective to minimize the sum of weighted tardiness has a better wait property compared with the objective to minimize the makespan. Further, we test the proposed Iterative Minimization Micro-model (IMM) heuristic method with the Mixed Integer Programming (MIP) solution by CPLEX. For multi-machine problems, the IMM heuristic method is faster and achieves a better solution. Finally, for a large problem instance with 409 jobs and 30 types of machines, IMM-heuristic method is compared with ProModel and we find that the heuristic method is slightly better.

Page 1. Utility Pricing Auction for Multi-period Resource Allocation in Multi-Machine Flow Shop P... more Page 1. Utility Pricing Auction for Multi-period Resource Allocation in Multi-Machine Flow Shop Problems ∗† Hoong Chuin LAU Zhengyi John ZHAO School of Information Systems Singapore Management University Singapore 178902 ‡ ...

IEEE Transactions Automation Science and Engineering, 2011

In this paper, we consider the problem of allocating machine resources among multiple agents, eac... more In this paper, we consider the problem of allocating machine resources among multiple agents, each of which is re- sponsible to solve a flowshop scheduling problem. We present an iterated combinatorial auction mechanism in which bid gener- ation is performed within each agent, while a price adjustment procedure is performed by a centralized auctioneer. While this approach is fairly well-studied

Proceedings of the IEEE International Conference on Control Applications, 2009

For the purpose of generating a standardized environment to test scheduling solvers on scheduling... more For the purpose of generating a standardized environment to test scheduling solvers on scheduling problems and to rank the results in comparison to other solvers, a simulation-based framework for a dynamic resource allocation test bed is proposed and realized. Our focus is on multiple-machine problem formulations, predictable dynamics, event based control and especially their combination. The framework separates the system

2011 International Conference on Electrical Machines and Systems, 2011

Page 1. Simplified High-order Feed Forward Control in Mechatronics Zhengyi John ZHAO GuangNeng WA... more Page 1. Simplified High-order Feed Forward Control in Mechatronics Zhengyi John ZHAO GuangNeng WANG Srikanth Boaz Kramer Abstract—We study the feed-forward (FF) control in several typical mechatronics systems. ...

2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT'07), 2007

We consider the problem of resource allocation and scheduling where information and decisions are... more We consider the problem of resource allocation and scheduling where information and decisions are decentralized, and our goal is to propose a market mechanism that allows resources from a central resource pool to be allocated to distributed decision makers (agents) that seek to optimize their respective scheduling goals. We propose a generic combinatorial auction mechanism that allows agents to competitively bid for the resources needed in a multi-period setting, regardless of the respective scheduling problem faced by the agent, and show how agents can design optimal bidding strategies to respond to price adjustment strategies from the auctioneer. We apply our approach to handle real-time large-scale dynamic resource coordination in a mega-scale container terminal.

2011 Third International Conference on Measuring Technology and Mechatronics Automation, 2011

Page 1. High Order Smooth Motion Command Generation for FFC-Digital Controller Zhengyi John ZHAO ... more Page 1. High Order Smooth Motion Command Generation for FFC-Digital Controller Zhengyi John ZHAO efsika.zzytgx@yahoo.com GuangNeng WANG guangneng.wang@ hanslaser.com Abstract—We studied the general motion ...

Proceedings of the 2007 IEEE International Conference on Mechatronics and Automation, ICMA 2007, 2007

A twin-sine command generator is proposed, which mainly caters for high performance motion contro... more A twin-sine command generator is proposed, which mainly caters for high performance motion control applications. Both precalculation and real-time control set-point generator are investigated. This command generator has up to 3rd order continuity in derivative of distance command, constant speed motion is allowable and it has very low computational cost. For the application-wise, we simply test on one of the

Proceedings of the 10th international conference on Electronic commerce - ICEC '08, 2008

Page 1. Utility Pricing Auction for Multi-period Resource Allocation in Multi-Machine Flow Shop P... more Page 1. Utility Pricing Auction for Multi-period Resource Allocation in Multi-Machine Flow Shop Problems ∗† Hoong Chuin LAU Zhengyi John ZHAO School of Information Systems Singapore Management University Singapore 178902 ‡ ...

IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews), 2000

An integer programming (IP) model is proposed for integrated resource allocation and operation sc... more An integer programming (IP) model is proposed for integrated resource allocation and operation scheduling for a multiple job-agents system. Each agent handles a specific job-list in a bidirectional flowshop. For the individual agent scheduling problem, a formulation is proposed in continuous time domain and compared with an IP formulation in discrete time domain. Of particular interest is the formulation of the machine utilization functionboth in continuous time and discrete time. Fast heuristic methods are proposed with the relaxation of the machine capacity. For the integrated resource allocation and scheduling problem, a linear programming relaxation approach is applied to solve the global resource allocation and a fast heuristic method is applied to solve each scheduling subproblem. The proposed solution is compared experimentally with that from the integer programming solver by CPLEX. Index Terms-Flowshop scheduling, multiple machine, resource allocation.

IEEE Transactions on Automation Science and Engineering, 2000

In this paper, we consider the problem of allocating machine resources among multiple agents, eac... more In this paper, we consider the problem of allocating machine resources among multiple agents, each of which is responsible to solve a flowshop scheduling problem. We present an iterated combinatorial auction mechanism in which bid generation is performed within each agent, while a price adjustment procedure is performed by a centralized auctioneer. While this approach is fairly well-studied in the literature, our primary innovation is in an adaptive price adjustment procedure, utilizing variable step-size inspired by adaptive PID-control theory coupled with utility pricing inspired by classical microeconomics. We compare with the conventional price adjustment scheme proposed in Fisher (1985), and show better convergence properties. Our secondary contribution is in a fast bid-generation procedure executed by the agents based on local search. Putting both these innovations together, we compare our approach against a classical integer programming model as well as conventional price adjustment schemes, and show drastic run time improvement with insignificant loss of global optimality.

2007 IEEE 22nd International Symposium on Intelligent Control, 2007

We study a special bidirectional flow shop problem with multi-machine capacity and sequencing con... more We study a special bidirectional flow shop problem with multi-machine capacity and sequencing constraints on critical operations. A formulation is proposed in continuous time domain and compared with a mixed integer programming (MIP) formulation in discrete time domain. Of particular interest to us is the formulation of the machine utilization function -both in continuous time and in discrete time domain. Fast heuristics are proposed with the relaxation of the machine capacity. A Lagrangian-based heuristic procedure is used to further reduce the duality gap. The performance of the heuristic and Lagrangian relaxation is compared with optimal solutions experimentally.