Reliability of consecutive-k-out-of-n: F system DT Chiang, SC Niu IEEE transactions on Reliability 30 (1), 87-89, 1981 | 441 | 1981 |
On Johnson's two-machine flow shop with random processing times PS Ku, SC Niu Operations Research 34 (1), 130-136, 1986 | 95 | 1986 |
A stochastic formulation of the Bass model of new‐product diffusion SC Niu Mathematical problems in Engineering 8 (3), 249-263, 2002 | 93 | 2002 |
Relating polling models with zero and nonzero switchover times MM Srinivasan, SC Niu, RB Cooper Queueing Systems 19 (1), 149-168, 1995 | 72 | 1995 |
A decomposition theorem for polling models: The switchover times are effectively additive RB Cooper, SC Niu, MM Srinivasan Operations Research 44 (4), 629-633, 1996 | 64 | 1996 |
A piecewise-diffusion model of new-product demands SC Niu Operations research 54 (4), 678-695, 2006 | 57 | 2006 |
A sales forecast model for short‐life‐cycle products: New releases at blockbuster C Chung, SC Niu, C Sriskandarajah Production and Operations Management 21 (5), 851-873, 2012 | 41 | 2012 |
The Waiting-Time Distribution for the GI/G/1 Queue under the D-Policy J Li, SC Niu Probability in the Engineering and Informational Sciences 6 (3), 287-308, 1992 | 37 | 1992 |
Benes's formula for M/G/1–FIFO ‘explained'by preemptive-resume LIFO RB Cooper, SC Niu Journal of Applied Probability 23 (2), 550-554, 1986 | 35 | 1986 |
A single server queueing loss model with heterogeneous arrival and service SC Niu Operations Research 28 (3-part-i), 584-593, 1980 | 30 | 1980 |
Optimality of (s, S) policies in EOQ models with general cost structures S Perera, G Janakiraman, SC Niu International Journal of Production Economics 187, 216-228, 2017 | 29 | 2017 |
When does forced idle time improve performance in polling models? RB Cooper, SC Niu, MM Srinivasan Management Science 44 (8), 1079-1086, 1998 | 26 | 1998 |
Transform-free analysis of M/G/1/K and related queues SC Niu, RB Cooper Mathematics of operations research 18 (2), 486-510, 1993 | 22 | 1993 |
Duality and Other Results for M/G/1 and GI/M/1 Queues, Via a New Ballot Theorem SC Niu, RB Cooper Mathematics of Operations Research 14 (2), 281-293, 1989 | 22 | 1989 |
Representing workloads in GI/G/1 queues through the preemptive-resume LIFO queue discipline SC Niu Queueing Systems 3, 157-178, 1988 | 22 | 1988 |
Setups in polling models: does it make sense to set up if no work is waiting? RB Cooper, SC Niu, MM Srinivasan Journal of applied probability 36 (2), 585-592, 1999 | 21 | 1999 |
On the comparison of waiting times in tandem queues SC Niu Journal of Applied Probability 18 (3), 707-714, 1981 | 21 | 1981 |
Bounds for the expected delays in some tandem queues SC Niu Journal of Applied Probability 17 (3), 831-838, 1980 | 21 | 1980 |
Optimality of (s, S) Inventory Policies under Renewal Demand and General Cost Structures S Perera, G Janakiraman, SC Niu Production and Operations Management 27 (2), 368-383, 2018 | 20 | 2018 |
Some reflections on the Renewal‐theory paradox in queueing theory RB Cooper, SC Niu, MM Srinivasan International Journal of Stochastic Analysis 11 (3), 355-368, 1998 | 17 | 1998 |