Tsung-Chyan Lai

16 papers C 1Journal 14Unranked 1
YearRankTypeTitle / Venue / Authors
2019 J jnl
The stability radius of an optimal line balance with maximum efficiency for a simple assembly line.
Eur. J. Oper. Res.
Tsung-Chyan Lai, Yuri N. Sotskov, Alexandre Dolgui
2018 J jnl
The optimality box in uncertain data for minimising the sum of the weighted job completion times.
Int. J. Prod. Res.
Tsung-Chyan Lai, Yuri N. Sotskov, Natalja G. Egorova, Frank Werner
2015 J jnl
Enumerations and stability analysis of feasible and optimal line balances for simple assembly lines.
Comput. Ind. Eng.
Yuri N. Sotskov, Alexandre Dolgui, Tsung-Chyan Lai, Aksana Zatsiupa
2013 J jnl
Measures of problem uncertainty for scheduling with interval processing times.
OR Spectr.
Yuri N. Sotskov, Tsung-Chyan Lai, Frank Werner
2012 J jnl
Minimizing total weighted flow time under uncertainty using dominance and a stability box.
Comput. Oper. Res.
Yuri N. Sotskov, Tsung-Chyan Lai
2011 — conf
The Stability Box for Minimizing Total Weighted Flow Time under Uncertain Data.
SIMULTECH (Selected Papers)
Yuri N. Sotskov, Tsung-Chyan Lai, Frank Werner
2011 C conf
The Stability Box in Interval Data for Minimizing the Sum of Weighted Completion Times.
SIMULTECH
Yuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai, Frank Werner
2009 J jnl
Minimizing total weighted flow time of a set of jobs with interval processing times.
Math. Comput. Model.
Yuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai
2009 J jnl
Schedule execution for two-machine flow-shop with interval processing times.
Math. Comput. Model.
Natalja M. Matsveichuk, Yuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai
2008 J jnl
Approximate proximal algorithms for generalized variational inequalities with paramonotonicity and pseudomonotonicity.
Comput. Math. Appl.
Lu-Chuan Ceng, Tsung-Chyan Lai, Jen-Chih Yao
2004 J jnl
Existence of equilibrium for abstract economics on pseudo H-spaces.
Appl. Math. Lett.
Tsung-Chyan Lai, Yen-Cherng Lin, Jen-Chih Yao
2004 J jnl
Flowshop scheduling problem to minimize total completion time with random and bounded processing times.
J. Oper. Res. Soc.
Yuri N. Sotskov, Ali Allahverdi, Tsung-Chyan Lai
2004 J jnl
Mean flow time minimization with given bounds of processing times.
Eur. J. Oper. Res.
Tsung-Chyan Lai, Yuri N. Sotskov, Nadezhda Sotskova, Frank Werner
1999 J jnl
Sequencing with uncertain numerical data for makespan minimisation.
J. Oper. Res. Soc.
Tsung-Chyan Lai, Yuri N. Sotskov
1996 J jnl
A Note on Heuristics of Flow-Shop Scheduling.
Oper. Res.
Tsung-Chyan Lai
1993 J jnl
Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems.
Oper. Res. Lett.
Tsung-Chyan Lai