default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWooseung Jang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j13]Wooseung Jang, Daeki Kim, Kwangtae Park
:
Inventory allocation and shipping when demand temporarily exceeds production capacity. Eur. J. Oper. Res. 227(3): 464-470 (2013)- 2011
- [j12]Wooseung Jang, Cerry M. Klein:
Supply chain models for small agricultural enterprises. Ann. Oper. Res. 190(1): 359-374 (2011) - [p1]Scott E. Grasman, Vicki Callaway, Can Saygin, Wooseung Jang, Henrique Rozenfeld:
Development and Implementation of an Enterprise Learning Architecture for Collaborative Learning. Technology-Enhanced Systems and Tools for Collaborative Learning Scaffolding 2011: 47-67 - 2010
- [j11]Johye Hwang, Long Gao, Wooseung Jang:
Joint demand and capacity management in a restaurant system. Eur. J. Oper. Res. 207(1): 465-472 (2010)
2000 – 2009
- 2008
- [j10]Emmett J. Lodree Jr., Yeonjung Kim, Wooseung Jang:
Time and quantity dependent waiting costs in a newsvendor problem with backlogged shortages. Math. Comput. Model. 47(1-2): 60-71 (2008) - 2007
- [j9]Wooseung Jang, Dongwon Kim:
Integrated production and allocation policies with one direct shipping option. Eur. J. Oper. Res. 181(2): 716-732 (2007) - 2006
- [j8]Wooseung Jang:
Production and allocation policies in a two-class inventory system with time and quantity dependent waiting costs. Comput. Oper. Res. 33: 2301-2321 (2006) - [j7]Dongwon Kim, Dong-Gil Na, Wooseung Jang, F. Frank Chen:
Simulated annealing and genetic algorithm for unrelated parallel machine scheduling considering set-up times. Int. J. Comput. Appl. Technol. 26(1/2): 28-36 (2006) - [j6]Wooseung Jang, Huay H. Lim, Thomas J. Crowe, Gail Raskin, Thomas E. Perkins:
The Missouri Lottery Optimizes Its Scheduling and Routing to Improve Efficiency and Balance. Interfaces 36(4): 302-313 (2006) - 2005
- [j5]Dong K. Seo, Cerry M. Klein, Wooseung Jang:
Single machine stochastic scheduling to minimize the expected number of tardy jobs using mathematical programming models. Comput. Ind. Eng. 48(2): 153-161 (2005) - 2004
- [j4]Wooseung Jang, J. George Shanthikumar:
Sequential process control under capacity constraints. Eur. J. Oper. Res. 155(3): 695-714 (2004) - [j3]Emmett J. Lodree Jr., Wooseung Jang, Cerry M. Klein:
A new rule for minimizing the number of tardy jobs in dynamic flow shops. Eur. J. Oper. Res. 159(1): 258-263 (2004) - 2002
- [j2]Wooseung Jang:
Dynamic scheduling of stochastic jobs on a single machine. Eur. J. Oper. Res. 138(3): 518-530 (2002) - [j1]Wooseung Jang, Cerry M. Klein:
Minimizing the expected number of tardy jobs when processing times are normally distributed. Oper. Res. Lett. 30(2): 100-106 (2002)
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 2024-04-25 05:48 CEST 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:
