| 2008 |
|---|
| 17 | EE | Dar-Li Yang,
Wen-Hung Kuo,
Maw-Sheng Chern:
Multi-family scheduling in a two-machine reentrant flow shop with setups.
European Journal of Operational Research 187(3): 1160-1170 (2008) |
| 16 | EE | Maw-Sheng Chern,
Hui-Ling Yang,
Jinn-Tsair Teng,
Sotiris Papachristos:
Partial backlogging inventory lot-size models for deteriorating items with fluctuating demand under inflation.
European Journal of Operational Research 191(1): 127-141 (2008) |
| 2007 |
|---|
| 15 | EE | Jinn-Tsair Teng,
Chun-Tao Chang,
Maw-Sheng Chern,
Ya-Lan Chan:
Retailer's optimal ordering policies with trade credit financing.
Int. J. Systems Science 38(3): 269-278 (2007) |
| 2006 |
|---|
| 14 | EE | Rong-Hong Jan,
Ching-Peng Lin,
Maw-Sheng Chern:
An optimization model for Web content adaptation.
Computer Networks 50(7): 953-965 (2006) |
| 2000 |
|---|
| 13 | EE | Dar-Li Yang,
Maw-Sheng Chern:
Two-machine flowshop group scheduling problem.
Computers & OR 27(10): 975-985 (2000) |
| 1999 |
|---|
| 12 | EE | Jinn-Tsair Teng,
Maw-Sheng Chern,
Hui-Ling Yang,
Yuchung J. Wang:
Deterministic lot-size inventory models with shortages and deterioration for fluctuating demand.
Oper. Res. Lett. 24(1-2): 65-72 (1999) |
| 1994 |
|---|
| 11 | EE | Kao-Chêng Lin,
Maw-Sheng Chern:
The single most vital arc in the most economical path problem - A parametric analysis.
Computers & OR 21(3): 353-358 (1994) |
| 1993 |
|---|
| 10 | | Kao-Chêng Lin,
Maw-Sheng Chern:
The Most Vital Edges in the Minimum Spanning Tree Problem.
Inf. Process. Lett. 45(1): 25-31 (1993) |
| 1992 |
|---|
| 9 | EE | Gen-Huey Chen,
Maw-Sheng Chern:
A Pipelined Algorithm for Multiple-Choice 0/1 Knapsack Problem.
International Journal of High Speed Computing 4(1): 43-48 (1992) |
| 1991 |
|---|
| 8 | | Lih-Hsing Hsu,
Rong-Hong Jan,
Yu-Che Lee,
Chun-Nan Hung,
Maw-Sheng Chern:
Finding the Most Vital Edge with Respect to Minimum Spanning Tree in Weighted Graphs.
Inf. Process. Lett. 39(5): 277-281 (1991) |
| 7 | | Gen-Huey Chen,
Maw-Sheng Chern:
Synthesis of algorithms on processor arrays.
Parallel Computing 17(2-3): 279-284 (1991) |
| 1990 |
|---|
| 6 | | Jyun-Jy Hu,
Shi-Nine Yang,
Maw-Sheng Chern,
Cheng-Ming Weng:
An Efficient Distributed Selection Algorithm for General Tree Networks.
ICPP (3) 1990: 348-349 |
| 5 | | Gen-Huey Chen,
Maw-Sheng Chern,
Jin Hwang Jang:
Pipeline architectures for dynamic programming algorithms.
Parallel Computing 13(1): 111-117 (1990) |
| 1989 |
|---|
| 4 | | Maw-Sheng Chern,
Gen-Huey Chen,
Pangfeng Liu:
An LC Branch-and-Branch Algorithm for the Module Assignment Problem.
Inf. Process. Lett. 32(2): 61-71 (1989) |
| 1987 |
|---|
| 3 | | Gen-Huey Chen,
Maw-Sheng Chern:
Designing Parallel Algorithms from Regular Graphs and Semi-Regular Graphs.
ICPP 1987: 363-366 |
| 2 | | Gen-Huey Chen,
Maw-Sheng Chern,
Richard C. T. Lee:
A New Systolic Architecture for Convex Hull and Half-Plane Intersection Problems.
BIT 27(2): 141-147 (1987) |
| 1986 |
|---|
| 1 | | Gen-Huey Chen,
Maw-Sheng Chern:
Parallel Generation of Permutations and Conbinations.
BIT 26(3): 277-283 (1986) |
