Hark-Chin Hwang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hark-Chin Hwang has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
Wikrom Jaruphongsa
Department of Industrial and Systems Engineering, National University of Singapore, Singapore 119260, Singapore
2 shared publications- Wilco van Den Heuvel
Econometric Institute, Erasmus University, 3062 PA Rotterdam, Netherlands
2 shared publications - José Miguel Gutiérrez
Universidad de La Laguna
1 shared publication
Latest Publications
- 10 March 2012
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 59 (3-4) , 244-253
Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging
This article considers a dynamic lot‐sizing problem with storage capacity limitation in which backlogging is allowed. For general concave procurement and inventory costs, we present anO(T2) dynamic programming algorithm whereTis the length of the planning horizon. Furthermore, in case of a fixed‐charge cost structure without speculative motives, we show that the problem can be solved inO(T) time. By carefully choosing decompositions of the problems, we can use classical results like an efficient matrix searching algorithm and geometric techniques to achieve the results. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012
- 10 March 2012
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 59 (3-4) , 244-253
Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging
This article considers a dynamic lot‐sizing problem with storage capacity limitation in which backlogging is allowed. For general concave procurement and inventory costs, we present anO(T2) dynamic programming algorithm whereTis the length of the planning horizon. Furthermore, in case of a fixed‐charge cost structure without speculative motives, we show that the problem can be solved inO(T) time. By carefully choosing decompositions of the problems, we can use classical results like an efficient matrix searching algorithm and geometric techniques to achieve the results. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012
- 1 September 2011
- Published by Elsevier in European Journal of Operational Research
- Vol. 213 (2) , 455-457
Note on “An efficient approach for solving the lot-sizing problem with time-varying storage capacities”
- 1 September 2011
- Published by Elsevier in European Journal of Operational Research
- Vol. 213 (2) , 455-457
Note on “An efficient approach for solving the lot-sizing problem with time-varying storage capacities”
- 16 January 2008
- Published by Elsevier in European Journal of Operational Research
- Vol. 184 (2) , 711-724
Dynamic lot-sizing model for major and minor demands
- 16 January 2008
- Published by Elsevier in European Journal of Operational Research
- Vol. 184 (2) , 711-724
Dynamic lot-sizing model for major and minor demands
- Open Access
- 4 June 2007
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 54 (6) , 692-701
Dynamic lot‐sizing model with production time windows
- 4 June 2007
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 54 (6) , 692-701
Open AccessDynamic lot‐sizing model with production time windows
- 30 June 2006
- Published by Springer Nature in Journal of Global Optimization
- Vol. 37 (1) , 11-26
An Efficient Procedure for Dynamic Lot-sizing Model with Demand Time Windows
- 30 June 2006
- Published by Springer Nature in Journal of Global Optimization
- Vol. 37 (1) , 11-26
An Efficient Procedure for Dynamic Lot-sizing Model with Demand Time Windows
- 31 May 2006
- Published by Elsevier in Operations Research Letters
- Vol. 34 (3) , 251-256
Dynamic lot-sizing model with demand time windows and speculative cost structure
- 31 May 2006
- Published by Elsevier in Operations Research Letters
- Vol. 34 (3) , 251-256
Dynamic lot-sizing model with demand time windows and speculative cost structure