The following pages link to Jinliang Cheng (Q190052):
Displaying 9 items.
- A half-product based approximation scheme for agreeably weighted completion time variance (Q707130) (← links)
- A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem (Q1278537) (← links)
- Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. (Q1347602) (← links)
- Fast fully polynomial approximation schemes for minimizing completion time variance (Q1600838) (← links)
- (Q3531015) (← links)
- OPTIMAL SCHEDULING FOR AN AUTOMATED m-MACHINE FLOWSHOP (Q4366147) (← links)
- (Q4452938) (← links)
- A SHIFTING BOTTLENECK APPROACH FOR A PARALLEL-MACHINE FLOWSHOP SCHEDULING PROBLEM (Q4483536) (← links)
- A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times (Q5937715) (← links)
