Tsung-Chyan Lai

According to our database, Tsung-Chyan Lai authored at least 16 papers between 1993 and 2019.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2019

The stability radius of an optimal line balance with maximum efficiency for a simple assembly line.

Tsung-Chyan Lai, Yuri N. Sotskov, Alexandre Dolgui

Eur. J. Oper. Res., 2019

2018

The optimality box in uncertain data for minimising the sum of the weighted job completion times.

Tsung-Chyan Lai, Yuri N. Sotskov, Natalja G. Egorova, Frank Werner

Int. J. Prod. Res., 2018

2015

Enumerations and stability analysis of feasible and optimal line balances for simple assembly lines.

Yuri N. Sotskov, Alexandre Dolgui, Tsung-Chyan Lai, Aksana Zatsiupa

Comput. Ind. Eng., 2015

2013

Measures of problem uncertainty for scheduling with interval processing times.

Yuri N. Sotskov, Tsung-Chyan Lai, Frank Werner

OR Spectr., 2013

2012

Minimizing total weighted flow time under uncertainty using dominance and a stability box.

Yuri N. Sotskov, Tsung-Chyan Lai

Comput. Oper. Res., 2012

2011

The Stability Box for Minimizing Total Weighted Flow Time under Uncertain Data.

Yuri N. Sotskov, Tsung-Chyan Lai, Frank Werner

Proceedings of the Simulation and Modeling Methodologies, Technologies and Applications, 2011

The Stability Box in Interval Data for Minimizing the Sum of Weighted Completion Times.

Yuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai, Frank Werner

Proceedings of the SIMULTECH 2011 - Proceedings of 1st International Conference on Simulation and Modeling Methodologies, Technologies and Applications, Noordwijkerhout, The Netherlands, 29, 2011

2009

Minimizing total weighted flow time of a set of jobs with interval processing times.

Yuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai

Math. Comput. Model., 2009

Schedule execution for two-machine flow-shop with interval processing times.

Natalja M. Matsveichuk, Yuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai

Math. Comput. Model., 2009

2008

Approximate proximal algorithms for generalized variational inequalities with paramonotonicity and pseudomonotonicity.

Lu-Chuan Ceng, Tsung-Chyan Lai, Jen-Chih Yao

Comput. Math. Appl., 2008

2004

Flowshop scheduling problem to minimize total completion time with random and bounded processing times.

Yuri N. Sotskov, Ali Allahverdi, Tsung-Chyan Lai

J. Oper. Res. Soc., 2004

Mean flow time minimization with given bounds of processing times.

Tsung-Chyan Lai, Yuri N. Sotskov, Nadezhda Sotskova, Frank Werner

Eur. J. Oper. Res., 2004

Existence of equilibrium for abstract economics on pseudo H-spaces.

Tsung-Chyan Lai, Yen-Cherng Lin, Jen-Chih Yao

Appl. Math. Lett., 2004

1999

Sequencing with uncertain numerical data for makespan minimisation.

Tsung-Chyan Lai, Yuri N. Sotskov

J. Oper. Res. Soc., 1999

1996

A Note on Heuristics of Flow-Shop Scheduling.

Tsung-Chyan Lai

Oper. Res., 1996

1993

Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems.

Tsung-Chyan Lai

Oper. Res. Lett., 1993