The following pages link to Chia-Shin Chung (Q224391):
Displaying 24 items.
- A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems (Q858325) (← links)
- A single-period inventory placement problem for a supply chain with the expected profit objective (Q859689) (← links)
- The newsvendor problem with an in-season price adjustment (Q1027600) (← links)
- Optimal replacement policies for a multicomponent reliability system (Q1111464) (← links)
- Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival (Q1112720) (← links)
- The coordinated replenishment dynamic lot-sizing problem with quantity discounts (Q1278282) (← links)
- An effective algorithm for the capacitated single item lot size problem (Q1331619) (← links)
- A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem (Q1869904) (← links)
- A heuristic algorithm for determining replacement policies in consecutive \(k\)-out-of-\(n\) systems (Q1885986) (← links)
- A single-period inventory placement problem for a supply system with the satisficing objective (Q2253460) (← links)
- A multi-item newsvendor problem with preseason production and capacitated reactive production (Q2475819) (← links)
- Optimal replacement policies for k-out-of-n systems (Q3478241) (← links)
- A Note on the Number of Invariant Capital Stocks (Q3675852) (← links)
- On the stability of Invariant Capital Stock in a two-dimensional planning model (Q3738845) (← links)
- A hard knapsack problem (Q3780004) (← links)
- An <i>O</i>(<i>T</i><sup>2</sup>) Algorithm for the <i>NI</i>/<i>G</i>/<i>NI</i>/<i>ND</i> Capacitated Lot Size Problem (Q3821896) (← links)
- Heuristic procedure for a multiproduct dynamic lot-sizing problem with coordinated replenishments (Q4286312) (← links)
- A heuristic algorithm for determining replacement policies ink-out-of-n systems (Q4367300) (← links)
- An optimal procedure for the coordinated replenishment dynamic lot-sizing problem with quantity discounts (Q4526925) (← links)
- A branch and bound algorithm for computing optimal replacement policies in consecutivek-out-of-n-systems (Q4533475) (← links)
- A single-period inventory placement problem for a serial supply chain (Q4544220) (← links)
- A Branch-and-Bound Algorithm for Computing Optimal Replacement Policies in <i>K</i>-Out-of-<i>N</i> Systems (Q4868802) (← links)
- Sequential Modelling of the Planning and Scheduling Problems of Flexible Manufacturing Systems (Q5690251) (← links)
- A newsboy problem with reactive production (Q5953165) (← links)
