Jianguang Feng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jianguang Feng has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Ada Che
School of Management, Northwestern Polytechnical University, Xi’an 710072, China
6 shared publications Ada Che
2 shared publicationsChengbin Chu
Univ Gustave Eiffel, ESIEE Paris and COSYS-GRETTIA, F-77454 Marne-la-Vallée, France
2 shared publications- Jin-Kao Hao
Department of Computer Science, LERIA Laboratory, University of Angers, Angers, France
2 shared publications - Yang Wang
School of Management, Northwestern Polytechnical University, Xi’an, China
2 shared publications - Yipei Zhang
School of Economics and Management, Changan University, Xian, China
2 shared publications
Latest Publications
- 28 May 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Assortment Optimization with General Linear Constraints Under the Paired Combinatorial Logit Choice Model
We consider the assortment optimization problem under general linear constraints, where the customer choice behavior is governed by the paired combinatorial logit model. In the literature, only the unconstrained problem and the problem with constraints that can be written as “[ ]” linear inequalities with nonnegative coefficients, such as cardinality and knapsack constraints, are studied, and only approximation algorithms exist for these problems. We develop four exact solution approaches to solve the problem with any linear constraints to optimality. First, we reformulate the problem, which in its original form is a fractional program, as a mixed-integer linear programming (MILP) model, and solve the resulting formulation directly by a commercial solver. We then develop a classical Benders decomposition algorithm and enhance it with additional cuts. We further develop a parametric search method to solve the original fractional program optimally by solving a series of nonfractional parametric problems. Our extensive computational experiments show that, although the direct MILP approach and the classical Benders decomposition can solve instances with up to 100 products to optimality, the parametric search approach and the enhanced Benders decomposition approach are far more effective and can solve much larger instances (with 500 products) to optimality within reasonable computation time. We also derive several valuable insights regarding how each of the major problem parameters impacts the optimal expected revenue, and how the products included in the optimal assortment differ from those not included. In addition, we consider three extensions of the problem to include pricing decisions or to a more general setting with multiple customer segments or multiple stages and develop exact solution approaches for each extension. Funding: This work was supported by the National Natural Science Foundation of China [Grants 72471189, 72310107003, 71901176, and 72271201]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0830 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0830 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 28 May 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Assortment Optimization with General Linear Constraints Under the Paired Combinatorial Logit Choice Model
We consider the assortment optimization problem under general linear constraints, where the customer choice behavior is governed by the paired combinatorial logit model. In the literature, only the unconstrained problem and the problem with constraints that can be written as “[ ]” linear inequalities with nonnegative coefficients, such as cardinality and knapsack constraints, are studied, and only approximation algorithms exist for these problems. We develop four exact solution approaches to solve the problem with any linear constraints to optimality. First, we reformulate the problem, which in its original form is a fractional program, as a mixed-integer linear programming (MILP) model, and solve the resulting formulation directly by a commercial solver. We then develop a classical Benders decomposition algorithm and enhance it with additional cuts. We further develop a parametric search method to solve the original fractional program optimally by solving a series of nonfractional parametric problems. Our extensive computational experiments show that, although the direct MILP approach and the classical Benders decomposition can solve instances with up to 100 products to optimality, the parametric search approach and the enhanced Benders decomposition approach are far more effective and can solve much larger instances (with 500 products) to optimality within reasonable computation time. We also derive several valuable insights regarding how each of the major problem parameters impacts the optimal expected revenue, and how the products included in the optimal assortment differ from those not included. In addition, we consider three extensions of the problem to include pricing decisions or to a more general setting with multiple customer segments or multiple stages and develop exact solution approaches for each extension. Funding: This work was supported by the National Natural Science Foundation of China [Grants 72471189, 72310107003, 71901176, and 72271201]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0830 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0830 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 12 May 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Assortment Optimization with General Linear Constraints Under the Paired Combinatorial Logit Choice Model
The software and data in this repository are a snapshot of the software and data that were used in the research reported on in the paper Assortment Optimization with General Linear Constraints Under the Paired Combinatorial Logit Choice Model by Jianguang Feng, Ada Che, Zhi-Long Chen.
- 12 May 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Assortment Optimization with General Linear Constraints Under the Paired Combinatorial Logit Choice Model
The software and data in this repository are a snapshot of the software and data that were used in the research reported on in the paper Assortment Optimization with General Linear Constraints Under the Paired Combinatorial Logit Choice Model by Jianguang Feng, Ada Che, Zhi-Long Chen.
- 19 November 2025
- Published by Springer Nature in Journal of Heuristics
- Vol. 31 (4) , 38
Resource-constrained multi-stage processing and assembly scheduling with sequential and batch operations
- 19 November 2025
- Published by Springer Nature in Journal of Heuristics
- Vol. 31 (4) , 38
Resource-constrained multi-stage processing and assembly scheduling with sequential and batch operations
- 17 September 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 38 (5) , 1385-1405
Exact MILP Models for Redundancy Allocation with Mixed Components
The redundancy allocation problem (RAP) aims to find an allocation of redundant components that maximizes system reliability under resource constraints. In this paper, we consider the RAP for complex systems with heterogeneous components, which may have bridges or interconnecting subsystems and are generally more complicated in structure than commonly studied series-parallel systems. A major challenge of the RAP is that the reliability function is nonlinear. To tackle this, we develop six exact mixed integer linear programming (MILP) formulations, which, to our knowledge, are the first of such formulations for the problem. The key idea is to use binary variables and big-M constraints to successively linearize each product term in the reliability function. In addition, we propose a novel tree representation of the reliability function to establish the interconnections between different product terms, which is then used to reduce the number of decision variables and constraints needed in the linearization. We also propose an alternative form of the reliability function that only involves the failure probabilities of subsystems, and leverage this to derive better variable bounds, smaller big-M constants, and simpler formulations. We compare the six MILP formulations by solving them directly using an MILP solver based on three sets of test instances of varying complexity. Results indicate that all formulations achieve optimal solutions quickly for the first set and within reasonable computation times for the second set. For the third set, two formulations can always be solved within a given time limit. Overall, the MILP formulation derived based on the alternative form of the reliability function and a specific type of tree representation scheme performs the best. We also demonstrate that our approach is more robust and scalable than a benchmark branch-and-bound method. History: Accepted by Pascal Van Hentenryck, Area Editor for Computational Modeling: Methods & Analysis. Funding: This work was supported by National Natural Science Foundation of China [Grants 72310107003, 72471189, 71901176]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0842 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0842 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 17 September 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 38 (5) , 1385-1405
Exact MILP Models for Redundancy Allocation with Mixed Components
The redundancy allocation problem (RAP) aims to find an allocation of redundant components that maximizes system reliability under resource constraints. In this paper, we consider the RAP for complex systems with heterogeneous components, which may have bridges or interconnecting subsystems and are generally more complicated in structure than commonly studied series-parallel systems. A major challenge of the RAP is that the reliability function is nonlinear. To tackle this, we develop six exact mixed integer linear programming (MILP) formulations, which, to our knowledge, are the first of such formulations for the problem. The key idea is to use binary variables and big-M constraints to successively linearize each product term in the reliability function. In addition, we propose a novel tree representation of the reliability function to establish the interconnections between different product terms, which is then used to reduce the number of decision variables and constraints needed in the linearization. We also propose an alternative form of the reliability function that only involves the failure probabilities of subsystems, and leverage this to derive better variable bounds, smaller big-M constants, and simpler formulations. We compare the six MILP formulations by solving them directly using an MILP solver based on three sets of test instances of varying complexity. Results indicate that all formulations achieve optimal solutions quickly for the first set and within reasonable computation times for the second set. For the third set, two formulations can always be solved within a given time limit. Overall, the MILP formulation derived based on the alternative form of the reliability function and a specific type of tree representation scheme performs the best. We also demonstrate that our approach is more robust and scalable than a benchmark branch-and-bound method. History: Accepted by Pascal Van Hentenryck, Area Editor for Computational Modeling: Methods & Analysis. Funding: This work was supported by National Natural Science Foundation of China [Grants 72310107003, 72471189, 71901176]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0842 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0842 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 5 August 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Exact MILP Models for Redundancy Allocation with Mixed Components
This software provides the implementation of different exact solution methods introduced for solving redundancy allocation problems with mixed components described in the paper, including several different MILP models and a benchmark branch-and-bound method.
- 5 August 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Exact MILP Models for Redundancy Allocation with Mixed Components
This software provides the implementation of different exact solution methods introduced for solving redundancy allocation problems with mixed components described in the paper, including several different MILP models and a benchmark branch-and-bound method.
- 7 March 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 324 (3) , 773-786
Mathematical models and heuristics for double-load crane scheduling in slab yards
- 7 March 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 324 (3) , 773-786
Mathematical models and heuristics for double-load crane scheduling in slab yards
- 18 November 2024
- Published by Springer Nature in OR Spectrum
- Vol. 47 (2) , 525-563
Collaborative scheduling and routing of home healthcare service across multiple communities
- 18 November 2024
- Published by Springer Nature in OR Spectrum
- Vol. 47 (2) , 525-563
Collaborative scheduling and routing of home healthcare service across multiple communities
- 2 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 54 (10) , 6397-6409
Efficient Adaptive Large Neighborhood Search for Sensor–Weapon–Target Assignment
We study a sensor–weapon–target assignment (S-WTA) problem that considers the desired probability of target destruction and aims to minimize the total cost of combat resources. Lower and upper bounds for the S-WTA problem are obtained by constructing linear approximation models. We also propose an adaptive large neighborhood search (ALNS) algorithm characterized by a model-driven repair phase to solve this problem. The destruction phase adaptively selects a destruction operator to remove partial resource assignments and produces an incomplete reference solution. For the destroyed solution, the repair phase generates a reduced subproblem that optimizes only the destroyed parts while keeping the other parts fixed. Each subproblem is formulated as a mixed integer programming model and solved by a general-purpose solver to repair the destroyed solution. Computational experiments show that the approximation formulations can obtain tight lower and upper bounds for most problem instances. Moreover, our proposed ALNS algorithm is competitive with the solver for small instances and effectively solves large instances. In addition, we experimentally demonstrate that our ALNS outperforms state-of-the-art algorithms in the literature, and the proposed model-driven solution repair phase outperforms the traditional heuristic repair operators.
- 2 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 54 (10) , 6397-6409
Efficient Adaptive Large Neighborhood Search for Sensor–Weapon–Target Assignment
We study a sensor–weapon–target assignment (S-WTA) problem that considers the desired probability of target destruction and aims to minimize the total cost of combat resources. Lower and upper bounds for the S-WTA problem are obtained by constructing linear approximation models. We also propose an adaptive large neighborhood search (ALNS) algorithm characterized by a model-driven repair phase to solve this problem. The destruction phase adaptively selects a destruction operator to remove partial resource assignments and produces an incomplete reference solution. For the destroyed solution, the repair phase generates a reduced subproblem that optimizes only the destroyed parts while keeping the other parts fixed. Each subproblem is formulated as a mixed integer programming model and solved by a general-purpose solver to repair the destroyed solution. Computational experiments show that the approximation formulations can obtain tight lower and upper bounds for most problem instances. Moreover, our proposed ALNS algorithm is competitive with the solver for small instances and effectively solves large instances. In addition, we experimentally demonstrate that our ALNS outperforms state-of-the-art algorithms in the literature, and the proposed model-driven solution repair phase outperforms the traditional heuristic repair operators.
- Open Access
- 5 February 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 319 (2) , 468-483
Scheduling robotic cells with fixed processing times or time windows: Classification, solution approaches, polynomial algorithms and complexity
- 5 February 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 319 (2) , 468-483
Open AccessScheduling robotic cells with fixed processing times or time windows: Classification, solution approaches, polynomial algorithms and complexity
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 19 (10) , 7522-7539
Bi-objective speed-scaling robotic cell scheduling with peak power consumption constraint
This article studies the speed-scaling robotic cell scheduling problem with constrained peak power consumption. The objective is to minimize cycle time and peak power consumption simultaneously. First, we formulate a bi-objective mixed integer programming model for the problem and propose a strategy to preprocess overlapping time windows. Then, we analyze the structural properties of the proposed model and develop an iterative $ \varepsilon $-constraint method to generate its complete Pareto front. Numerical experiments demonstrate that the proposed method effectively solves the robotic cell scheduling problem and that appropriate scheduling of speed-scaling machines can make a trade-off between productivity and power consumption.
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 19 (10) , 7522-7539
Bi-objective speed-scaling robotic cell scheduling with peak power consumption constraint
This article studies the speed-scaling robotic cell scheduling problem with constrained peak power consumption. The objective is to minimize cycle time and peak power consumption simultaneously. First, we formulate a bi-objective mixed integer programming model for the problem and propose a strategy to preprocess overlapping time windows. Then, we analyze the structural properties of the proposed model and develop an iterative $ \varepsilon $-constraint method to generate its complete Pareto front. Numerical experiments demonstrate that the proposed method effectively solves the robotic cell scheduling problem and that appropriate scheduling of speed-scaling machines can make a trade-off between productivity and power consumption.