J. Ben Atkinson

According to our database, J. Ben Atkinson authored at least 9 papers between 1998 and 2009.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of six.

2009

Two new heuristics for the <i>GI</i>/<i>G</i>/<i>n</i>/0 queueing loss system with examples based on the two-phase Coxian distribution.

J. Ben Atkinson

J. Oper. Res. Soc., 2009

2008

A hypercube queueing loss model with customer-dependent service rates.

J. Ben Atkinson, Igor N. Kovalenko, N. Kuznetsov, K. V. Mykhalevych

Eur. J. Oper. Res., 2008

2004

A note on Georgiou's discussion of emergent property.

J. Ben Atkinson

J. Oper. Res. Soc., 2004

On the economic tender quantity.

J. Ben Atkinson

J. Oper. Res. Soc., 2004

2003

Three Cases of Light-Traffic Insensitivity of the Loss Probability in a GI/G/m/0 Loss System to the Shape of the Service Time Distribution.

Igor N. Kovalenko, J. Ben Atkinson, K. V. Mykhalevych

Queueing Syst. Theory Appl., 2003

2000

A note on the C/G/1 queue and the C/G/1 loss system.

J. Ben Atkinson

Queueing Syst. Theory Appl., 2000

Some related paradoxes of queuing theory: new cases and a unifying explanation.

J. Ben Atkinson

J. Oper. Res. Soc., 2000

1999

On some parallels between the loss probability in the GI/G/1 loss system and the delay probability in the GI/G/1 queue.

J. Ben Atkinson

Oper. Res. Lett., 1999

1998

A greedy randomised search heuristic for time-constrained vehicle scheduling and the incorporation of a learning strategy.

J. Ben Atkinson

J. Oper. Res. Soc., 1998