George Q. Huang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
George Q. Huang has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Kai-Ling Mak
The University of Hong Kong
14 shared publications K. L. Mak
Department of Industrial and Manufacturing Systems Engineering , The University of Hong Kong , Pokfulam Road, Hong Kong
8 shared publicationsL. Liang
Business School , University of Science and Technology of China , PR China
4 shared publicationsJ. S. K. Lau
Department of Industrial and Manufacturing Systems Engineering , The University of Hong Kong , Pokfulam Road, Hong Kong
3 shared publicationsT. Qu
Department of Industrial and Manufacturing Systems Engineering , The University of Hong Kong , Hong Kong , China
3 shared publicationsB. Shen
Department of Industrial and Manufacturing Systems Engineering, The University of Hong Kong, Pokfulam Road, Hong Kong, PR China
2 shared publications
Latest Publications
- 15 March 2012
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 50 (6) , 1457-1475
Hybrid flowshop scheduling with family setup time and inconsistent family formation
This research considers a hybrid flowshop scheduling problem where jobs are organised in families according to their machine settings and tools. The family setup time arises when a machine shifts from processing one job family to another. The problem is compounded by the challenges that the formation of job families is different in different stages and only a limited number of jobs can be processed within one setup. This type of problem is common in the production process of standard metal components. This paper aims to propose two approaches to solve this problem. One is a metaheuristic in the form of a genetic algorithm and the other is a heuristic. The proposed approaches are compared and contrasted against the two relevant metaheuristic and heuristic adapted from solving a generalised sequence-dependent setup flowshop problem. Comparative results indicate that the proposed genetic algorithm has better performance on minimising makespan and the heuristic is more effective on reducing family setup time.
- 15 March 2012
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 50 (6) , 1457-1475
Hybrid flowshop scheduling with family setup time and inconsistent family formation
This research considers a hybrid flowshop scheduling problem where jobs are organised in families according to their machine settings and tools. The family setup time arises when a machine shifts from processing one job family to another. The problem is compounded by the challenges that the formation of job families is different in different stages and only a limited number of jobs can be processed within one setup. This type of problem is common in the production process of standard metal components. This paper aims to propose two approaches to solve this problem. One is a metaheuristic in the form of a genetic algorithm and the other is a heuristic. The proposed approaches are compared and contrasted against the two relevant metaheuristic and heuristic adapted from solving a generalised sequence-dependent setup flowshop problem. Comparative results indicate that the proposed genetic algorithm has better performance on minimising makespan and the heuristic is more effective on reducing family setup time.
- 6 January 2012
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 50 (14) , 3821-3840
RFID-enabled product-service system for automotive part and accessory manufacturing alliances
Automotive part and accessory manufacturers (APAMs) at the lower tiers of automotive vertical supply chains have been responding to major initiatives taken by leading vehicle assemblers in adopting RFID (radio frequency identification) and ubiquitous computing technologies to alleviate their manufacturing systems. RFID-enabled real-time traceability and visibility facilitate and enhance the implementation of advanced strategies such as just-in-time (JIT) lean/responsive manufacturing and mass customisation (MC). This paper reports on findings gained from a series of industrial field and pilot studies conducted within collaborating companies. Being typically small and medium sized, APAMs are faced with business and technical challenges that are summarised by the so-called ‘three high problems’, namely high cost, high risk and high level of technical skills. This research takes a more cost-effective pragmatic approach to overcome the ‘three high problems’ by sharing out the problems among APAMs while taking a longer-term, expensive and lengthy, approach to absolutely reduce the problems. The sharing approach requires the establishment of an innovative service-oriented framework, abbreviated AUTOPS, based on the Product Service Systems (PSS) business model. RFID hardware devices are innovated into gateways as hardcore products to formulate a PSS. RFID-enabled real-time services are deployed at a common platform across members of an APAMs alliance. AUTOPS facilities are shared by APAM alliance members to reduce the start-up investment costs, reduce the level of required specialist skills, speed up installation processes and streamline maintenance services, and improve the reliability of the RFID gateway services.
- 6 January 2012
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 50 (14) , 3821-3840
RFID-enabled product-service system for automotive part and accessory manufacturing alliances
Automotive part and accessory manufacturers (APAMs) at the lower tiers of automotive vertical supply chains have been responding to major initiatives taken by leading vehicle assemblers in adopting RFID (radio frequency identification) and ubiquitous computing technologies to alleviate their manufacturing systems. RFID-enabled real-time traceability and visibility facilitate and enhance the implementation of advanced strategies such as just-in-time (JIT) lean/responsive manufacturing and mass customisation (MC). This paper reports on findings gained from a series of industrial field and pilot studies conducted within collaborating companies. Being typically small and medium sized, APAMs are faced with business and technical challenges that are summarised by the so-called ‘three high problems’, namely high cost, high risk and high level of technical skills. This research takes a more cost-effective pragmatic approach to overcome the ‘three high problems’ by sharing out the problems among APAMs while taking a longer-term, expensive and lengthy, approach to absolutely reduce the problems. The sharing approach requires the establishment of an innovative service-oriented framework, abbreviated AUTOPS, based on the Product Service Systems (PSS) business model. RFID hardware devices are innovated into gateways as hardcore products to formulate a PSS. RFID-enabled real-time services are deployed at a common platform across members of an APAMs alliance. AUTOPS facilities are shared by APAM alliance members to reduce the start-up investment costs, reduce the level of required specialist skills, speed up installation processes and streamline maintenance services, and improve the reliability of the RFID gateway services.
- 15 April 2010
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 49 (8) , 2197-2219
Two-stage product platform development for mass customisation
Designing new products based on those features (platforms) that have proven successful or ‘fit’ is generally termed as ‘platform product development (PPD)’. This approach provides a basis for mass customisation (MC) which largely enhances an enterprise's competitiveness in terms of the speed, quality and cost. Currently, however, the PPD approach is heavily dependent on the experience and skills of individual designers and managers. Researchers have been working on platform leveraging strategies at the strategic level, and guidelines for better structuring the approach to facilitate its adoption and implementation. This research project recognises an equal need for scientific decision supports at the tactical level for design practitioners and managers to address fundamental questions such as: (A) how a platform should be established for a family of products in a given industrial and market context; and (B) how a product development team chooses and then customises the most appropriate product platform to meet the customer requirements from a specific market segment with particular manufacturing resources and supply bases. This paper describes a scientific and effective decision – genetic algorithm to assist product development practitioners and managers with major decision activities in the process of platform product development under several focus areas.
- 15 April 2010
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 49 (8) , 2197-2219
Two-stage product platform development for mass customisation
Designing new products based on those features (platforms) that have proven successful or ‘fit’ is generally termed as ‘platform product development (PPD)’. This approach provides a basis for mass customisation (MC) which largely enhances an enterprise's competitiveness in terms of the speed, quality and cost. Currently, however, the PPD approach is heavily dependent on the experience and skills of individual designers and managers. Researchers have been working on platform leveraging strategies at the strategic level, and guidelines for better structuring the approach to facilitate its adoption and implementation. This research project recognises an equal need for scientific decision supports at the tactical level for design practitioners and managers to address fundamental questions such as: (A) how a platform should be established for a family of products in a given industrial and market context; and (B) how a product development team chooses and then customises the most appropriate product platform to meet the customer requirements from a specific market segment with particular manufacturing resources and supply bases. This paper describes a scientific and effective decision – genetic algorithm to assist product development practitioners and managers with major decision activities in the process of platform product development under several focus areas.
- 4 January 2010
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 48 (23) , 6883-6907
Optimal configuration of assembly supply chains using analytical target cascading
This paper proposes to apply analytical target cascading (ATC) for configuring assembly supply chains with convergent structures. Individual enterprises in a supply chain are represented as separate elements in an ATC hierarchy. They are able to maintain autonomous and heterogeneous decision systems for optimising their private decision variables and objectives. They collaborate vertically and laterally along the ATC hierarchy through their common decisions to achieve the overall consistency and optimality. ATC offers a competitive balance between computational efficiency and effectiveness while providing an opportunity for parallel computation to further improve the efficiency. This paper also investigates the feasibility for individual enterprises to set local targets while participating in the supply chain configuration (SCC). SCC usually involves discrete decision variables, causing significant difficulties for existing ATC techniques to achieve system consistency. Therefore, a new consistency scheme has to be proposed in this paper, including two techniques: importance weighting factor (IWF) and dynamic constraints (DC). A case study is used to demonstrate the application of the ATC method for solving typical SCC problems. A series of comparative analyses are conducted to identify the strengths of the ATC method and demonstrate the effectiveness of the proposed consistency scheme.
- 4 January 2010
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 48 (23) , 6883-6907
Optimal configuration of assembly supply chains using analytical target cascading
This paper proposes to apply analytical target cascading (ATC) for configuring assembly supply chains with convergent structures. Individual enterprises in a supply chain are represented as separate elements in an ATC hierarchy. They are able to maintain autonomous and heterogeneous decision systems for optimising their private decision variables and objectives. They collaborate vertically and laterally along the ATC hierarchy through their common decisions to achieve the overall consistency and optimality. ATC offers a competitive balance between computational efficiency and effectiveness while providing an opportunity for parallel computation to further improve the efficiency. This paper also investigates the feasibility for individual enterprises to set local targets while participating in the supply chain configuration (SCC). SCC usually involves discrete decision variables, causing significant difficulties for existing ATC techniques to achieve system consistency. Therefore, a new consistency scheme has to be proposed in this paper, including two techniques: importance weighting factor (IWF) and dynamic constraints (DC). A case study is used to demonstrate the application of the ATC method for solving typical SCC problems. A series of comparative analyses are conducted to identify the strengths of the ATC method and demonstrate the effectiveness of the proposed consistency scheme.
- 1 July 2009
- Published by Taylor & Francis in International Journal of Computer Integrated Manufacturing
- Vol. 22 (7) , 579-594
Wireless manufacturing: a literature review, recent developments, and case studies
Wireless manufacturing (WM) has emerged as a next-generation advanced manufacturing technology (AMT). WM relies substantially on wireless devices such as RFID (radio frequency identification) or Auto ID (automatic identification) sensors, and wireless information/communication networks such as Wi–Fi for the collection and synchronisation of manufacturing field data. This paper discusses the recent developments in RFID-based WM solutions. The study is conducted by examining related whitepapers, case reports and research articles available in the literature, and by reflecting on the insights recently experienced in developing prototype solutions. Typical motivations are presented to highlight why and how manufacturers can benefit from applying WM solutions in addressing shop-floor challenges and facilitating contemporary manufacturing strategies. Representative WM manufacturing applications and potentials are presented in the areas of product assembly, part fabrication, just-in-time (JIT), mass customisation, manufacturing asset management and maintenance, and product lifecycle management. Different schemes are discussed for deploying smart objects in manufacturing environments in order to achieve real-time traceability and visibility while minimising the total cost. Key issues are discussed for further research.
- 1 July 2009
- Published by Taylor & Francis in International Journal of Computer Integrated Manufacturing
- Vol. 22 (7) , 579-594
Wireless manufacturing: a literature review, recent developments, and case studies
Wireless manufacturing (WM) has emerged as a next-generation advanced manufacturing technology (AMT). WM relies substantially on wireless devices such as RFID (radio frequency identification) or Auto ID (automatic identification) sensors, and wireless information/communication networks such as Wi–Fi for the collection and synchronisation of manufacturing field data. This paper discusses the recent developments in RFID-based WM solutions. The study is conducted by examining related whitepapers, case reports and research articles available in the literature, and by reflecting on the insights recently experienced in developing prototype solutions. Typical motivations are presented to highlight why and how manufacturers can benefit from applying WM solutions in addressing shop-floor challenges and facilitating contemporary manufacturing strategies. Representative WM manufacturing applications and potentials are presented in the areas of product assembly, part fabrication, just-in-time (JIT), mass customisation, manufacturing asset management and maintenance, and product lifecycle management. Different schemes are discussed for deploying smart objects in manufacturing environments in order to achieve real-time traceability and visibility while minimising the total cost. Key issues are discussed for further research.
- 7 October 2008
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 46 (21) , 6137-6162
Simultaneous configuration of platform products and manufacturing supply chains
The product platform concept represents a powerful approach for manufacturers to compete cost-effectively in a global market that requires diverse product range, quick time to market, and rapid responses to supply sources. A key challenge is how to strike a balance between platform commonality and modularity. When a manufacturer outsources its raw materials or module options, the supplier capabilities and production costs should be considered. This paper discusses optimizing decision variables for simultaneously configuring not only platform-based product variants but also their supply chain. We develop a mixed-integer programming model that integrates both platform product design and material purchase decisions based on cost drivers sensitive to commonality and modularity. Theoretical analysis of the model yields two properties, allowing us to further simplify the model and thus help in developing an effective solution algorithm. A numerical example is presented to illustrate how manufacturers strive to dynamically adjust their product design strategies in response to changes in the market demands and/or supply base.
- 7 October 2008
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 46 (21) , 6137-6162
Simultaneous configuration of platform products and manufacturing supply chains
The product platform concept represents a powerful approach for manufacturers to compete cost-effectively in a global market that requires diverse product range, quick time to market, and rapid responses to supply sources. A key challenge is how to strike a balance between platform commonality and modularity. When a manufacturer outsources its raw materials or module options, the supplier capabilities and production costs should be considered. This paper discusses optimizing decision variables for simultaneously configuring not only platform-based product variants but also their supply chain. We develop a mixed-integer programming model that integrates both platform product design and material purchase decisions based on cost drivers sensitive to commonality and modularity. Theoretical analysis of the model yields two properties, allowing us to further simplify the model and thus help in developing an effective solution algorithm. A numerical example is presented to illustrate how manufacturers strive to dynamically adjust their product design strategies in response to changes in the market demands and/or supply base.
- 16 September 2008
- Published by Taylor & Francis in Journal of Engineering Design
- Vol. 19 (5) , 401-416
Genetic algorithm-based optimisation method for product family design with multi-level commonality
An increasing number of companies design a family of product variants simultaneously in order to introduce adequate product variety in the competitive market in a cost-effective way while shortening product lead-times, instead of designing one product at a time. The key to using this approach successfully is to achieve the right trade-off between product family commonality and performance of individual product variants. This paper considers multi-level commonality in product family design in the sense that the feature or component can be common only among some product variants. This differs from the two extremes of being totally common throughout the family or being completely different from one product variant to another. A product family design model is proposed as a multi-objective optimisation. A commonality index is introduced to evaluate the family commonality in the presence of multiple levels. A multi-objective genetic algorithm is developed for simultaneous design of a family of product variants. Optimal decisions include which design variables should be common among which product variants. Computational experiments are conducted using the design of a family of welded beams to demonstrate the effectiveness of the product family design method proposed in this paper.
- 16 September 2008
- Published by Taylor & Francis in Journal of Engineering Design
- Vol. 19 (5) , 401-416
Genetic algorithm-based optimisation method for product family design with multi-level commonality
An increasing number of companies design a family of product variants simultaneously in order to introduce adequate product variety in the competitive market in a cost-effective way while shortening product lead-times, instead of designing one product at a time. The key to using this approach successfully is to achieve the right trade-off between product family commonality and performance of individual product variants. This paper considers multi-level commonality in product family design in the sense that the feature or component can be common only among some product variants. This differs from the two extremes of being totally common throughout the family or being completely different from one product variant to another. A product family design model is proposed as a multi-objective optimisation. A commonality index is introduced to evaluate the family commonality in the presence of multiple levels. A multi-objective genetic algorithm is developed for simultaneous design of a family of product variants. Optimal decisions include which design variables should be common among which product variants. Computational experiments are conducted using the design of a family of welded beams to demonstrate the effectiveness of the product family design method proposed in this paper.
- 11 May 2007
- Published by Springer Nature
- p. 31-59
Web-based Polishing Process Planning Using Data-mining Techniques
- 11 May 2007
- Published by Springer Nature
- p. 31-59
Web-based Polishing Process Planning Using Data-mining Techniques
- 1 January 2006
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 44 (1) , 1-25
Distributed supply-chain project rescheduling: part II—distributed affected operations rescheduling algorithm
Affected Operations Rescheduling (AOR) is a process of rescheduling only the operations directly and indirectly affected by a disruption through the propagation of change caused by a disruption while preserving as much as possible the robustness of the initial schedule (preschedule). AOR is basically a centralized heuristic, and thus not readily suitable for project rescheduling in a supply chain where independent and autonomous enterprises do not completely share all the relevant information between each other. This paper is mainly concerned with substantially extending AOR into a distributed version, distAOR, for distributed rescheduling. The primary emphasis of the discussion is placed upon how to deal with the research issues of enterprise autonomy and heterogeneity from the aspects of supply-chain modelling, problem formulation, and solution algorithm. The convergence of the resulting distAOR is theoretically demonstrated. The computational study reported in the first part indicates that the superior efficiency of distAOR is largely due to the fact that only minimum information is shared between enterprises, but at the cost of its lost effectiveness also due to limited information sharing.
- 1 January 2006
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 44 (1) , 1-25
Distributed supply-chain project rescheduling: part II—distributed affected operations rescheduling algorithm
Affected Operations Rescheduling (AOR) is a process of rescheduling only the operations directly and indirectly affected by a disruption through the propagation of change caused by a disruption while preserving as much as possible the robustness of the initial schedule (preschedule). AOR is basically a centralized heuristic, and thus not readily suitable for project rescheduling in a supply chain where independent and autonomous enterprises do not completely share all the relevant information between each other. This paper is mainly concerned with substantially extending AOR into a distributed version, distAOR, for distributed rescheduling. The primary emphasis of the discussion is placed upon how to deal with the research issues of enterprise autonomy and heterogeneity from the aspects of supply-chain modelling, problem formulation, and solution algorithm. The convergence of the resulting distAOR is theoretically demonstrated. The computational study reported in the first part indicates that the superior efficiency of distAOR is largely due to the fact that only minimum information is shared between enterprises, but at the cost of its lost effectiveness also due to limited information sharing.
- 1 December 2005
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 43 (24) , 5107-5129
Distributed supply‐chain project rescheduling: Part I—impacts of information‐sharing strategies
A supply‐chain project normally involves a number of independent and autonomous enterprises that share information to varying levels. The initial project schedule (preschedule) established at the time of forming the supply‐chain often requires a series of amendments due to unexpected or abrupt disturbances such as temporary resource outage (e.g. machine break), arrival or cancellation of orders from customers, and change in an operation's processing time (e.g. rework). Rescheduling or adaptive scheduling is a process of updating/repairing the preschedule to adapt to the disturbances. Appropriate rescheduling methods must be chosen and applied depending on the specific protocol of sharing information agreed between the enterprises in the supply chain. This paper is concerned with the impacts of different levels of information sharing on the performance of supply‐chain project rescheduling problems. Three rescheduling methods are examined in the research. They are distributed AOR (Affected Operations Rescheduling), negotiation‐based rescheduling (NEG), and centralized total rescheduling (TR). These three rescheduling algorithms represent three typical information‐sharing scenarios: little information sharing, limited information sharing and complete information sharing, respectively. A comprehensive computational study is conducted under different experimental settings. The results show that NEG and distAOR outperforms the TR rescheduling in terms of total cost minimization and stability of schedule and contractual relationship. NEG is superior in both rescheduling efficiency and effectiveness due to the effect of a moderate level of information sharing.
- 1 December 2005
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 43 (24) , 5107-5129
Distributed supply‐chain project rescheduling: Part I—impacts of information‐sharing strategies
A supply‐chain project normally involves a number of independent and autonomous enterprises that share information to varying levels. The initial project schedule (preschedule) established at the time of forming the supply‐chain often requires a series of amendments due to unexpected or abrupt disturbances such as temporary resource outage (e.g. machine break), arrival or cancellation of orders from customers, and change in an operation's processing time (e.g. rework). Rescheduling or adaptive scheduling is a process of updating/repairing the preschedule to adapt to the disturbances. Appropriate rescheduling methods must be chosen and applied depending on the specific protocol of sharing information agreed between the enterprises in the supply chain. This paper is concerned with the impacts of different levels of information sharing on the performance of supply‐chain project rescheduling problems. Three rescheduling methods are examined in the research. They are distributed AOR (Affected Operations Rescheduling), negotiation‐based rescheduling (NEG), and centralized total rescheduling (TR). These three rescheduling algorithms represent three typical information‐sharing scenarios: little information sharing, limited information sharing and complete information sharing, respectively. A comprehensive computational study is conducted under different experimental settings. The results show that NEG and distAOR outperforms the TR rescheduling in terms of total cost minimization and stability of schedule and contractual relationship. NEG is superior in both rescheduling efficiency and effectiveness due to the effect of a moderate level of information sharing.