The following pages link to Tsung-Chyan Lai (Q552445):
Displaying 19 items.
- Scheduling linearly shortening jobs under precedence constraints (Q552447) (← links)
- (Q969916) (redirect page) (← links)
- Minimizing total weighted flow time of a set of jobs with interval processing times (Q969917) (← links)
- Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems (Q1319674) (← links)
- Optimal makespan scheduling with given bounds of processing times (Q1381777) (← links)
- The stability radius of an optimal line balance with maximum efficiency for a simple assembly line (Q1634287) (← links)
- (Q1762111) (redirect page) (← links)
- Minimizing total weighted flow time under uncertainty using dominance and a stability box (Q1762112) (← links)
- Mean flow time minimization with given bounds of processing times (Q1887954) (← links)
- Schedule execution for two-machine flow-shop with interval processing times (Q2390053) (← links)
- Measures of problem uncertainty for scheduling with interval processing times (Q2393127) (← links)
- Sequencing with uncertain numerical data for makespan minimisation (Q3157317) (← links)
- (Q3598878) (← links)
- WORST-CASE ANALYSIS OF INDEXING RULES FOR SINGLE MACHINE SEQUENCING (Q4294130) (← links)
- MINIMIZING TOTAL TARDINESS FOR SINGLE MACHINE SEQUENCING (Q4345050) (← links)
- Flowshop scheduling problem to minimize total completion time with random and bounded processing times (Q4661102) (← links)
- Stability of Johnson's schedule with respect to limited machine availability (Q4706332) (← links)
- AN APPROACH FOR WORST CASE ANALYSIS OF HEURISTICS : ANALYSIS OF A FLEXIBLE 0-1 KNAPSACK PROBLEM (Q4834043) (← links)
- A Note on Heuristics of Flow-Shop Scheduling (Q5689787) (← links)
