Dynamic control of the N queueing network with application to shipbuilding

The US shipbuilding industry faces challenges of building ships on time and within budgeted cost. We introduce an operational flexibility to shipbuilding to improve the system control. We model the flexible ship production system as an ‘N’ queueing network. However, the ‘N’ network model still lacks effective and computationally lightweight policies, especially with non-preemption. We use a Markov Decision Process (MDP) to gain structural insights into the optimal control policy. We develop a state dependent Optimal Threshold policy and benchmark it against other policies to show its excellent robustness and effectiveness. Our extensive test suite shows that (1) the Optimal Threshold policy performs the best in all the heuristics we tested; and (2) the cost of the system under control of this threshold policy is very close to the optimal cost calculated by the MDP. To calculate the exact optimal threshold level is difficult; therefore, we develop a birth-death process to determine a Analytical threshold level. Based on the optimal threshold values over a large test suite, we refine the analytical threshold level using a second-order regression model. We find the performance of the Regression Threshold policy to be within a few percent of optimal.

[1]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[2]  Chris P. Tsokos,et al.  Linear Regression Models , 2015 .

[3]  Seyed M. R. Iravani,et al.  Structural Flexibility: A New Perspective on the Design of Manufacturing and Service Operations , 2005, Manag. Sci..

[4]  J. Harrison Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policies , 1998 .

[5]  Wallace J. Hopp,et al.  Hierarchical cross-training in work-in-process-constrained systems , 2007 .

[6]  HYUN-SOO AHN OPTIMAL CONTROL OF A FLEXIBLE SERVER , 2004 .

[7]  J. V. Mieghem Dynamic Scheduling with Convex Delay Costs: The Generalized CU Rule , 1995 .

[8]  Tolga Tezcan,et al.  Dynamic Control of N-Systems with Many Servers: Asymptotic Optimality of a Static Priority Policy in Heavy Traffic , 2010, Oper. Res..

[9]  Wallace J. Hopp,et al.  Agile workforce evaluation: a framework for cross-training and coordination , 2004 .

[10]  J. Walrand,et al.  The cμ rule revisited , 1985, Advances in Applied Probability.

[11]  Jean Walrand,et al.  The c# rule revisited , 1985 .

[12]  M. Kijima,et al.  FURTHER RESULTS FOR DYNAMIC SCHEDULING OF MULTICLASS G/G/1 QUEUES , 1989 .

[13]  Soroush Saghafian,et al.  The “W” network and the dynamic control of unreliable flexible servers , 2011 .

[14]  Ronald J. Williams,et al.  Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policy , 2001 .

[15]  S. L. Bell,et al.  Dynamic Scheduling of a Parallel Server System in Heavy Traffic with Complete Resource Pooling: Asymptotic Optimality of a Threshold Policy , 2005 .

[16]  Douglas G. Down,et al.  THE N-NETWORK MODEL WITH UPGRADES , 2010, Probability in the Engineering and Informational Sciences.

[17]  David J. Singer,et al.  Innovative ship block assembly production control using a flexible curved block job shop , 2009 .

[18]  Sigrún Andradóttir,et al.  Compensating for Failures with Flexible Servers , 2007, Oper. Res..

[19]  Jean Walrand,et al.  Extensions of the multiarmed bandit problem: The discounted case , 1985 .

[20]  Michael H. Veatch,et al.  A c μ rule for parallel servers with two-tiered c μ preferences , 2010 .