Cheng Jinliang

Jinliang Cheng

Information about the author Jinliang Cheng will soon be added to the site.
Found 6 papers in total
A half-product based approximation scheme for agreeably weighted completion time variance
A half-product based approximation scheme for agreeably weighted completion time variance
2005
A recent INFORMS Journal on Computing paper presents a fully polynomial time...
Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times
Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times
2002
We consider the two-machine flow-shop problem with release times where the objective...
Fast fully polynomial approximation schemes for minimizing completion time variance
Fast fully polynomial approximation schemes for minimizing completion time variance
2002
We present fully polynomial approximation schemes for the problem of minimizing...
A shifting bottleneck approach for a parallel-machine flowshop scheduling problem
A shifting bottleneck approach for a parallel-machine flowshop scheduling problem
2001
This paper considers a scheduling problem of minimizing the maximum lateness for a...
A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
2001
We consider the three-machine permutation flow-shop scheduling problem with release...
A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
1997
This paper considers an m -machine permutation flowshop scheduling problem of...
Papers per page: