Tsung-Chyan Lai - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 10 from 10

2019

The stability radius of an optimal line balance with maximum efficiency for a simple assembly lineTsung-Chyan Lai, Yuri N. Sotskov, Alexandre Dolgui. eor, 274(2):466-481, 2019. [doi]

2018

The optimality box in uncertain data for minimising the sum of the weighted job completion timesTsung-Chyan Lai, Yuri N. Sotskov, Natalja G. Egorova, Frank Werner 0001. ijpr, 56(19):6336-6362, 2018. [doi]

2015

Enumerations and stability analysis of feasible and optimal line balances for simple assembly linesYuri N. Sotskov, Alexandre Dolgui, Tsung-Chyan Lai, Aksana Zatsiupa. candie, 90:241-258, 2015. [doi]

2013

Measures of problem uncertainty for scheduling with interval processing timesYuri N. Sotskov, Tsung-Chyan Lai, Frank Werner 0001. ors, 35(3):659-689, 2013. [doi]

2011

The Stability Box for Minimizing Total Weighted Flow Time under Uncertain DataYuri N. Sotskov, Tsung-Chyan Lai, Frank Werner. simultech 2013: 39-55 [doi]

The Stability Box in Interval Data for Minimizing the Sum of Weighted Completion TimesYuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai, Frank Werner. simultech 2011: 14-23

2004

Mean flow time minimization with given bounds of processing timesTsung-Chyan Lai, Yuri N. Sotskov, Nadezhda Sotskova, Frank Werner. eor, 159(3):558-573, 2004. [doi]

1999

Sequencing with uncertain numerical data for makespan minimisationTsung-Chyan Lai, Yuri N. Sotskov. jors, 50(3):230-243, 1999. [doi]

1996

A Note on Heuristics of Flow-Shop SchedulingTsung-Chyan Lai. ior, 44(4):648-652, 1996. [doi]

1993

Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problemsTsung-Chyan Lai. orl, 14(4):215-220, 1993. [doi]

Sign in or sign up to see more results.

runs on WebDSL