Chung Chia-Shin

Chia-Shin Chung

Information about the author Chia-Shin Chung will soon be added to the site.
Found 17 papers in total
A single‐period inventory placement problem for a supply system with the satisficing objective
2013
Consider the inventory placement problem in an N‐stage supply system facing a...
A single-period inventory placement problem for a supply chain with the expected profit objective
2007
Consider the expected profit maximizing inventory placement problem in an N -stage,...
A heuristic algorithm for determining replacement policies in consecutive k-out-of-n systems
2004
This article presents a heuristic algorithm for determining replacement policies in a...
A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
2003
In this paper, a two-stage assembly scheduling problem is considered with the...
A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems
2002
The m -machine permutation flowshop problem with the total flow-time objective is a...
A branch and bound algorithm for computing optimal replacement policies in consecutive k-out-of-n-systems
2002
This paper presents a branch and bound algorithm for computing optimal replacement...
A single-period inventory placement problem for a serial supply chain
2001
This article addresses the inventory placement problem in a serial supply chain facing...
A newsboy problem with reactive production
2001
This paper extends the classic newsboy problem by introducing reactive production....
An optimal procedure for the coordinated replenishment dynamic lot-sizing problem with quantity discounts
2000
We consider in this paper the coordinated replenishment dynamic lot-sizing problem...
The coordinated replenishment dynamic lot-sizing problem with quantity discounts
1996
In the classical coordinated replenishment dynamic lot-sizing problem, the primary...
A branch-and-bound algorithm for computing optimal replacement policies in K-out-of-N systems
1995
We study a discrete time, infinite-horizon, dynamic programming model for the...
An effective algorithm for the capacitated single item lot size problem
1994
This paper studies a deterministic, single product capacitated dynamic lot size model...
A heuristic algorithm for determining replacement policies in k-out-of-n systems
1997
The authors study a discrete-time, infinite-horizon, dynamic programming model for the...
Sequential modelling of the planning and scheduling problems of flexible manufacturing systems
1996
Research on the planning and scheduling issues of flexible manufacturing systems (FMS)...
Heuristic procedure for a multiproduct dynamic lot-sizing problem with coordinated replenishments
1994
In this article the authors develop a heuristic procedure for a multiproduct dynamic...
An optimal algorithm for the quantity discount problem
1987
The quantity discount problem determines order quantities in a dynamic environment...
A hard knapsack problem
1988
In this article the authors develop a class of general knapsack problems which are...
Papers per page: