Ming-Zheng Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ming-Zheng Wang has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- M. Montaz Ali
School of Computer Science and Applied Mathematics, University of the Witwatersrand, Johannesburg, South Africa
5 shared publications - Ji-Bo Wang
Shenyang Aerospace University
4 shared publications - Gui-Hua Lin
Dalian University of Technology
2 shared publications J-B Wang
Shenyang aerospace university shenyang China
1 shared publication- Jing Bai
Department of Public Course, Zhongshan Torch Polytechnic, Zhongshan 528436, China
1 shared publication Lei Yang
School of Economics and Management, Tsinghua University, Beijing 100084, China
1 shared publication
Latest Publications
- 4 August 2015
- Published by Springer Nature in Annals of Operations Research
- Vol. 240 (2) , 381-393
Emerging production optimization issues in supply chain systems
- 4 August 2015
- Published by Springer Nature in Annals of Operations Research
- Vol. 240 (2) , 381-393
Emerging production optimization issues in supply chain systems
- 17 March 2014
- Published by Springer Nature in Annals of Operations Research
- Vol. 217 (1) , 513-534
On the ERM formulation and a stochastic approximation algorithm of the stochastic- $R_0$ R 0 EVLCP- 17 March 2014
- Published by Springer Nature in Annals of Operations Research
- Vol. 217 (1) , 513-534
On the ERM formulation and a stochastic approximation algorithm of the stochastic- $R_0$ R 0 EVLCP- 11 December 2013
- Published by Springer Nature in Annals of Operations Research
- Vol. 240 (2) , 731-760
A capacitated firm’s pricing strategies for strategic consumers with different search costs
- 11 December 2013
- Published by Springer Nature in Annals of Operations Research
- Vol. 240 (2) , 731-760
A capacitated firm’s pricing strategies for strategic consumers with different search costs
- 29 February 2012
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 36 (2) , 829-835
Single machine scheduling with a general exponential learning effect
- 29 February 2012
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 36 (2) , 829-835
Single machine scheduling with a general exponential learning effect
- 1 January 2012
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 63 (1) , 130-137
Worst-case analysis for flow shop scheduling problems with an exponential learning effect
A real industrial production phenomenon, referred to as learning effects, has drawn increasing attention. However, most research on this issue considers only single machine problems. Motivated by this limitation, this paper considers flow shop scheduling problems with an exponential learning effect. By the exponential learning effect, we mean that the processing time of a job is defined by an exponent function of its position in a processing permutation. The objective is to minimize one of the four regular performance criteria, namely, the total completion time, the total weighted completion time, the discounted total weighted completion time, and the sum of the quadratic job completion times. We present heuristic algorithms by using the optimal permutations for the corresponding single-machine scheduling problems. We also analyse the worst-case bound of our heuristic algorithms.
- 1 January 2012
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 63 (1) , 130-137
Worst-case analysis for flow shop scheduling problems with an exponential learning effect
A real industrial production phenomenon, referred to as learning effects, has drawn increasing attention. However, most research on this issue considers only single machine problems. Motivated by this limitation, this paper considers flow shop scheduling problems with an exponential learning effect. By the exponential learning effect, we mean that the processing time of a job is defined by an exponent function of its position in a processing permutation. The objective is to minimize one of the four regular performance criteria, namely, the total completion time, the total weighted completion time, the discounted total weighted completion time, and the sum of the quadratic job completion times. We present heuristic algorithms by using the optimal permutations for the corresponding single-machine scheduling problems. We also analyse the worst-case bound of our heuristic algorithms.
- 6 December 2011
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 24 (6) , 1143-1153
Sample average approximation method for a class of stochastic variational inequality problems
- 6 December 2011
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 24 (6) , 1143-1153
Sample average approximation method for a class of stochastic variational inequality problems
- 31 August 2011
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 35 (8) , 3731-3736
Some single-machine scheduling with both learning and deterioration effects
- 31 August 2011
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 35 (8) , 3731-3736
Some single-machine scheduling with both learning and deterioration effects
- 23 June 2011
- Published by Springer Nature in Annals of Operations Research
- Vol. 191 (1) , 155-169
Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
- 23 June 2011
- Published by Springer Nature in Annals of Operations Research
- Vol. 191 (1) , 155-169
Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
- Open Access
- 1 January 2011
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 7 (2) , 317-345
Sample average approximation method for stochastic complementarity problems with applications to supply chain supernetworks
We consider a class of stochastic nonlinear complementarity problems. We propose a new reformulation of the stochastic complementarity problem, that is, a two-stage stochastic mathematical programming model reformulation. Based on this reformulation, we propose a smoothing-based sample average approximation method for stochastic complementarity problem and prove its convergence. As an application, a supply chain super-network equilibrium is modeled as a stochastic nonlinear complementarity problem and numerical results on the problem are reported.
- 1 January 2011
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 7 (2) , 317-345
Open AccessSample average approximation method for stochastic complementarity problems with applications to supply chain supernetworks
We consider a class of stochastic nonlinear complementarity problems. We propose a new reformulation of the stochastic complementarity problem, that is, a two-stage stochastic mathematical programming model reformulation. Based on this reformulation, we propose a smoothing-based sample average approximation method for stochastic complementarity problem and prove its convergence. As an application, a supply chain super-network equilibrium is modeled as a stochastic nonlinear complementarity problem and numerical results on the problem are reported.
- 28 October 2010
- Published by Springer Nature in Optimization Letters
- Vol. 6 (1) , 87-98
Single-machine scheduling with nonlinear deterioration
- 28 October 2010
- Published by Springer Nature in Optimization Letters
- Vol. 6 (1) , 87-98
Single-machine scheduling with nonlinear deterioration