Tsung-Chyan Lai

Affiliations:
  • Harbin Engineering University, School of Economics and Management, China
  • National Taiwan University, College of Management, Taipei, Taiwan (former)


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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
The stability radius of an optimal line balance with maximum efficiency for a simple assembly line.
Eur. J. Oper. Res., 2019

2018
The optimality box in uncertain data for minimising the sum of the weighted job completion times.
Int. J. Prod. Res., 2018

2015
Enumerations and stability analysis of feasible and optimal line balances for simple assembly lines.
Comput. Ind. Eng., 2015

2013
Measures of problem uncertainty for scheduling with interval processing times.
OR Spectr., 2013

2012
Minimizing total weighted flow time under uncertainty using dominance and a stability box.
Comput. Oper. Res., 2012

2011
The Stability Box for Minimizing Total Weighted Flow Time under Uncertain Data.
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.
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.
Math. Comput. Model., 2009

Schedule execution for two-machine flow-shop with interval processing times.
Math. Comput. Model., 2009

2008
Approximate proximal algorithms for generalized variational inequalities with paramonotonicity and pseudomonotonicity.
Comput. Math. Appl., 2008

2004
Flowshop scheduling problem to minimize total completion time with random and bounded processing times.
J. Oper. Res. Soc., 2004

Mean flow time minimization with given bounds of processing times.
Eur. J. Oper. Res., 2004

Existence of equilibrium for abstract economics on pseudo H-spaces.
Appl. Math. Lett., 2004

1999
Sequencing with uncertain numerical data for makespan minimisation.
J. Oper. Res. Soc., 1999

1996
A Note on Heuristics of Flow-Shop Scheduling.
Oper. Res., 1996

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


  Loading...