Maw-Sheng Chern

Chun-Tao Chang

Int. J. Syst. Sci., 2012

2008

Multi-family scheduling in a two-machine reentrant flow shop with setups.

[BibT_eX]

[DOI]

Dar-Li Yang

Wen-Hung Kuo

Eur. J. Oper. Res., 2008

Partial backlogging inventory lot-size models for deteriorating items with fluctuating demand under inflation.

[BibT_eX]

[DOI]

Hui-Ling Yang

Sotirios Papachristos

Eur. J. Oper. Res., 2008

2007

Retailer's optimal ordering policies with trade credit financing.

[BibT_eX]

[DOI]

Int. J. Syst. Sci., 2007

2006

An optimization model for Web content adaptation.

[BibT_eX]

[DOI]

Rong-Hong Jan

Ching-Peng Lin

Comput. Networks, 2006

2005

Deterministic inventory lot-size models with shortages for fluctuating demand and unit purchase cost.

[BibT_eX]

[DOI]

Ya-Lan Chan

Int. Trans. Oper. Res., 2005

A Comparison among Various inventory shortage Models for deteriorating items on the Basis of Maximizing Profit.

[BibT_eX]

[DOI]

Ya-Lan Chan

Asia Pac. J. Oper. Res., 2005

2002

A forward recursive algorithm for inventory lot-size models with power-form demand and shortages.

[BibT_eX]

[DOI]

Hui-Ling Yang

Eur. J. Oper. Res., 2002

2001

Entry strategies for multinational enterprises and host countries.

[BibT_eX]

[DOI]

Ki-Hee Kim

Eur. J. Oper. Res., 2001

2000

Two-machine flowshop group scheduling problem.

[BibT_eX]

[DOI]

Dar-Li Yang

Comput. Oper. Res., 2000

1999

Deterministic lot-size inventory models with shortages and deterioration for fluctuating demand.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1999

1994

The single most vital arc in the most economical path problem - A parametric analysis.

[BibT_eX]

[DOI]

Kao-Chêng Lin

Comput. Oper. Res., 1994

1993

A unidirectional ring partition problem.

[BibT_eX]

[DOI]

Jyun-Jy Hu

Shi-Nine Yang

Networks, 1993

The Most Vital Edges in the Minimum Spanning Tree Problem.

[BibT_eX]

[DOI]

Kao-Chêng Lin

Inf. Process. Lett., 1993

1992

On the computational complexity of reliability redundancy allocation in a series system.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1992

A Pipelined Algorithm for Multiple-Choice 0/1 Knapsack Problem.

[BibT_eX]

[DOI]

Int. J. High Speed Comput., 1992

1991

Technical Note - An Algorithm for Determining Whether m Given Demand Points Are on a Hemisphere or Not.

[BibT_eX]

[DOI]

Wen-Hsien Tsai

Tsong-Ming Lin

Transp. Sci., 1991

Synthesis of algorithms on processor arrays.

[BibT_eX]

[DOI]

Parallel Comput., 1991

Finding the Most Vital Edge with Respect to Minimum Spanning Tree in Weighted Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

1990

Pipeline architectures for dynamic programming algorithms.

[BibT_eX]

[DOI]

Jin Hwang Jang

Parallel Comput., 1990

An Efficient Distributed Selection Algorithm for General Tree Networks.

[BibT_eX]

Proceedings of the 1990 International Conference on Parallel Processing, 1990

1989

An LC Branch-and-Branch Algorithm for the Module Assignment Problem.

[BibT_eX]

[DOI]

Pangfeng Liu

Inf. Process. Lett., 1989

1988

Designing parallel algorithms from forests and multistage graphs.

[BibT_eX]

[DOI]

G. H. Chen

Proceedings of the Twelfth International Computer Software and Applications Conference, 1988

1987

A New Systolic Architecture for Convex Hull and Half-Plane Intersection Problems.

[BibT_eX]

[DOI]

Richard C. T. Lee

BIT, 1987

Designing Parallel Algorithms from Regular Graphs and Semi-Regular Graphs.

[BibT_eX]

Proceedings of the International Conference on Parallel Processing, 1987

1986

Parallel Generation of Permutations and Conbinations.

[BibT_eX]

[DOI]

BIT, 1986

1984

A Note on Approximation Schemes for Multidimensional Knapsack Problems.

[BibT_eX]

[DOI]

Michael J. Magazine