default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHark-Chin Hwang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j18]Hark-Chin Hwang, Wilco van den Heuvel
, Albert P. M. Wagelmans:
Multilevel Lot-Sizing with Inventory Bounds. INFORMS J. Comput. 35(6): 1470-1490 (2023)- 2022
- [j17]Hark-Chin Hwang:
Subcontracting and lot-sizing with constant capacities. Math. Program. 193(1): 271-314 (2022)
2010 – 2019
- 2016
- [j16]Hark-Chin Hwang, Hyun-Soo Ahn, Philip M. Kaminsky:
Algorithms for the two-stage production-capacitated lot-sizing problem. J. Glob. Optim. 65(4): 777-799 (2016) - 2014
- [j15]Hark-Chin Hwang, Kyungkuk Lim:
Exact performance of MULTIFIT for nonsimultaneous machines. Discret. Appl. Math. 167: 172-187 (2014) - 2013
- [j14]Hark-Chin Hwang, Hyun-Soo Ahn, Philip M. Kaminsky:
Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem. Oper. Res. 61(2): 469-482 (2013) - 2011
- [j13]Wilco van den Heuvel, José Miguel Gutiérrez, Hark-Chin Hwang:
Note on "An efficient approach for solving the lot-sizing problem with time-varying storage capacities". Eur. J. Oper. Res. 213(2): 455-457 (2011) - 2010
- [j12]Hark-Chin Hwang:
Economic Lot-Sizing for Integrated Production and Transportation. Oper. Res. 58(2): 428-444 (2010)
2000 – 2009
- 2009
- [j11]Hark-Chin Hwang:
Inventory Replenishment and Inbound Shipment Scheduling Under a Minimum Replenishment Policy. Transp. Sci. 43(2): 244-264 (2009) - 2008
- [j10]Hark-Chin Hwang, Wikrom Jaruphongsa:
Dynamic lot-sizing model for major and minor demands. Eur. J. Oper. Res. 184(2): 711-724 (2008) - 2007
- [j9]Hark-Chin Hwang:
A 4/3-Approximation Algorithm for Cassette Packing in Steel Industry. Asia Pac. J. Oper. Res. 24(5): 715-724 (2007) - [j8]Hark-Chin Hwang:
An Efficient Procedure for Dynamic Lot-sizing Model with Demand Time Windows. J. Glob. Optim. 37(1): 11-26 (2007) - 2006
- [j7]Hark-Chin Hwang, Wikrom Jaruphongsa:
Dynamic lot-sizing model with demand time windows and speculative cost structure. Oper. Res. Lett. 34(3): 251-256 (2006) - 2005
- [j6]Soo Y. Chang, Hark-Chin Hwang, Sanghyuck Park:
A two-dimensional vector packing model for the efficient use of coil cassettes. Comput. Oper. Res. 32: 2051-2058 (2005) - [j5]Hark-Chin Hwang, Kangbok Lee, Soo Y. Chang:
The effect of machine availability on the worst-case performance of LPT. Discret. Appl. Math. 148(1): 49-61 (2005) - [j4]Hark-Chin Hwang, Soo Y. Chang:
Order Consolidation for Batch Processing. J. Comb. Optim. 9(1): 121-138 (2005) - 2004
- [j3]Hark-Chin Hwang, Soo Y. Chang, Yushin Hong:
A posterior Competitiveness for List Scheduling Algorithm on Machines with Eligibility Constraints. Asia Pac. J. Oper. Res. 21(1): 117-126 (2004) - [j2]Hark-Chin Hwang, Soo Y. Chang, Kangbok Lee:
Parallel machine scheduling under a grade of service provision. Comput. Oper. Res. 31(12): 2055-2061 (2004)
1990 – 1999
- 1999
- [j1]Soo Y. Chang, Hark-Chin Hwang:
The Worst-case Analysis of the MULTIFIT Algorithm for Scheduling Nonsimultaneous Parallel Machines. Discret. Appl. Math. 92(2-3): 135-147 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
