default search action
Tsung-Chyan Lai
Person information
- affiliation: Harbin Engineering University, School of Economics and Management, China
- affiliation (former): National Taiwan University, College of Management, Taipei, Taiwan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j14]Tsung-Chyan Lai, Yuri N. Sotskov, Alexandre Dolgui
:
The stability radius of an optimal line balance with maximum efficiency for a simple assembly line. Eur. J. Oper. Res. 274(2): 466-481 (2019) - 2018
- [j13]Tsung-Chyan Lai, Yuri N. Sotskov, Natalja G. Egorova, Frank Werner
The optimality box in uncertain data for minimising the sum of the weighted job completion times. Int. J. Prod. Res. 56(19): 6336-6362 (2018) - 2015
- [j12]Yuri N. Sotskov, Alexandre Dolgui
Enumerations and stability analysis of feasible and optimal line balances for simple assembly lines. Comput. Ind. Eng. 90: 241-258 (2015) - 2013
- [j11]Yuri N. Sotskov, Tsung-Chyan Lai, Frank Werner
Measures of problem uncertainty for scheduling with interval processing times. OR Spectr. 35(3): 659-689 (2013) - 2012
- [j10]Yuri N. Sotskov, Tsung-Chyan Lai:
Minimizing total weighted flow time under uncertainty using dominance and a stability box. Comput. Oper. Res. 39(6): 1271-1289 (2012) - 2011
- [c2]Yuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai, Frank Werner:
The Stability Box in Interval Data for Minimizing the Sum of Weighted Completion Times. SIMULTECH 2011: 14-23 - [c1]Yuri N. Sotskov, Tsung-Chyan Lai, Frank Werner
The Stability Box for Minimizing Total Weighted Flow Time under Uncertain Data. SIMULTECH (Selected Papers) 2011: 39-55
2000 – 2009
- 2009
- [j9]Natalja M. Matsveichuk, Yuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai:
Schedule execution for two-machine flow-shop with interval processing times. Math. Comput. Model. 49(5-6): 991-1011 (2009) - [j8]Yuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai:
Minimizing total weighted flow time of a set of jobs with interval processing times. Math. Comput. Model. 50(3-4): 556-573 (2009) - 2008
- [j7]Lu-Chuan Ceng, Tsung-Chyan Lai, Jen-Chih Yao:
Approximate proximal algorithms for generalized variational inequalities with paramonotonicity and pseudomonotonicity. Comput. Math. Appl. 55(6): 1262-1269 (2008) - 2004
- [j6]Tsung-Chyan Lai, Yen-Cherng Lin
Existence of equilibrium for abstract economics on pseudo H-spaces. Appl. Math. Lett. 17(6): 691-696 (2004) - [j5]Tsung-Chyan Lai, Yuri N. Sotskov, Nadezhda Sotskova, Frank Werner
Mean flow time minimization with given bounds of processing times. Eur. J. Oper. Res. 159(3): 558-573 (2004) - [j4]Yuri N. Sotskov, Ali Allahverdi, Tsung-Chyan Lai:
Flowshop scheduling problem to minimize total completion time with random and bounded processing times. J. Oper. Res. Soc. 55(3): 277-286 (2004)
1990 – 1999
- 1999
- [j3]Tsung-Chyan Lai, Yuri N. Sotskov:
Sequencing with uncertain numerical data for makespan minimisation. J. Oper. Res. Soc. 50(3): 230-243 (1999) - 1996
- [j2]Tsung-Chyan Lai:
A Note on Heuristics of Flow-Shop Scheduling. Oper. Res. 44(4): 648-652 (1996) - 1993
- [j1]Tsung-Chyan Lai:
Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems. Oper. Res. Lett. 14(4): 215-220 (1993)
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-11-04 21:39 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: