![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Hark Hwang
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j26]Young Dae Ko
, Byung Duk Song, Hark Hwang:
Location, capacity and capability design of emergency medical centers with multiple emergency diseases. Comput. Ind. Eng. 101: 10-20 (2016) - 2015
- [j25]Byung Duk Song, Young Dae Ko
, Hark Hwang:
The design of capacitated facility networks for long term care service. Comput. Ind. Eng. 89: 177-185 (2015) - 2012
- [j24]Hiroaki Ishii, Shogo Shiode, Hark Hwang, Gwo-Hshiung Tzeng
, Hirosato Seki:
Preface 'Soft computing for management systems'. Comput. Ind. Eng. 62(3): 687 (2012) - [j23]Young Dae Ko
, Injoon Noh, Hark Hwang:
Cost benefits from standardization of the packaging glass bottles. Comput. Ind. Eng. 62(3): 693-702 (2012) - [j22]Chengji Liang, Hark Hwang, Mitsuo Gen:
A berth allocation planning problem with direct transshipment consideration. J. Intell. Manuf. 23(6): 2207-2214 (2012) - [j21]Sungjae Han, Yong Hui Oh, Hark Hwang:
Retailing policy for perishable item sold from two bins with mixed issuing policy. J. Intell. Manuf. 23(6): 2215-2226 (2012) - 2011
- [j20]Mitsuo Gen, Hark Hwang:
Advanced models and optimization in manufacturing and logistics systems. J. Intell. Manuf. 22(3): 343 (2011) - [j19]Ki Seung Jung, Hark Hwang:
Competition and cooperation in a remanufacturing system with take-back requirement. J. Intell. Manuf. 22(3): 427-433 (2011)
2000 – 2009
- 2009
- [j18]Hark Hwang, Bum Choi, Grimi Lee:
A genetic algorithm approach to an integrated problem of shelf space design and item allocation. Comput. Ind. Eng. 56(3): 809-820 (2009) - [j17]Ning Liu, Young Joo Kim, Hark Hwang:
An optimal operating policy for the production system with rework. Comput. Ind. Eng. 56(3): 874-887 (2009) - [j16]Young Joo Kim, Hark Hwang:
Incremental discount policy of cell-phone carrier with connection success rate constraint. Eur. J. Oper. Res. 196(2): 682-687 (2009) - 2007
- [j15]Ki Ho Chung, Chang Seong Ko, Jae Young Shin, Hark Hwang, Kap Hwan Kim:
Development of mathematical models for the container road transportation in Korean trucking industries. Comput. Ind. Eng. 53(2): 252-262 (2007) - [j14]Dae-Won Choi, Hark Hwang, Shie-Gheun Koh:
A generalized ordering and recovery policy for reusable items. Eur. J. Oper. Res. 182(2): 764-774 (2007) - 2006
- [j13]Hark Hwang, Chiung Moon, Bongju Jeong, Kwangsu Kim:
Foreword. Comput. Ind. Eng. 51(2): 217-218 (2006) - [j12]Yong Hui Oh, Hark Hwang, Chun Nam Cha, Suk Lee:
A dock-door assignment problem for the Korean mail distribution center. Comput. Ind. Eng. 51(2): 288-296 (2006) - [j11]Yong Hui Oh, Hark Hwang:
Deterministic inventory model for recycling system. J. Intell. Manuf. 17(4): 423-428 (2006) - [j10]Lin Lin, Seong Whan Shinn, Mitsuo Gen, Hark Hwang:
Network model and effective evolutionary approach for AGV dispatching in manufacturing system. J. Intell. Manuf. 17(4): 465-477 (2006) - 2004
- [j9]Hark Hwang, Youngkeun Song, Kap Hwan Kim:
The impacts of acceleration/deceleration on travel time models for carousel systems. Comput. Ind. Eng. 46(2): 253-265 (2004) - [j8]Kap Hwan Kim, Kyeong-Woo Kim, Hark Hwang, Chang Seong Ko:
Operator-scheduling using a constraint satisfaction technique in port container terminals. Comput. Ind. Eng. 46(2): 373-381 (2004) - [j7]Kyu Hun Hahn, Hark Hwang, Seong Whan Shinn:
A returns policy for distribution channel coordination of perishable items. Eur. J. Oper. Res. 152(3): 770-780 (2004) - 2003
- [j6]Seong Whan Shinn, Hark Hwang:
Optimal pricing and ordering policies for retailers under order-size-dependent delay in payments. Comput. Oper. Res. 30(1): 35-50 (2003) - [j5]Hark Hwang, Yong Hui Oh:
Another similarity coefficient for the p-median model in group technology. Int. J. Manuf. Technol. Manag. 5(1/2): 38-45 (2003) - 2001
- [j4]Ji Ung Sun, Hark Hwang:
Scheduling problem in a two-machine flow line with the N-step prior-job-dependent set-up times. Int. J. Syst. Sci. 32(3): 375-385 (2001) - 2000
- [j3]Hark Hwang, Kyu Hun Hahn:
An optimal procurement policy for items with an inventory level-dependent demand rate and fixed lifetime. Eur. J. Oper. Res. 127(3): 537-545 (2000)
1990 – 1999
- 1997
- [j2]Hark Hwang, Seong Whan Shinn:
Retailer's pricing and lot sizing policy for exponentially deteriorating products under the condition of permissible delay in payments. Comput. Oper. Res. 24(6): 539-547 (1997) - 1990
- [j1]Hark Hwang, Dug Hee Moon, Seong Whan Shinn:
An EOQ model with quantity discounts for both purchasing price and freight cost. Comput. Oper. Res. 17(1): 73-78 (1990)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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 2024-04-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint