Dimitrios G. Pandelis

Orcid: 0000-0003-3092-0660

According to our database1, Dimitrios G. Pandelis authored at least 15 papers between 1996 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Newsvendor models with random supply capacity and backup sourcing.
Eur. J. Oper. Res., 2022

2020
Optimal server assignment in a two-stage tandem queueing system.
Oper. Res. Lett., 2020

2019
Optimal Dynamic Allocation of Collaborative Servers in Two Station Tandem Systems.
IEEE Trans. Autom. Control., 2019

2013
A note on preemptive scheduling of multiclass jobs with geometric service times and hard deadlines.
J. Sched., 2013

Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery.
Eur. J. Oper. Res., 2013

The stochastic economic lot sizing problem for non-stop multi-grade production with sequence-restricted setup changeovers.
Ann. Oper. Res., 2013

2012
Sample Path Optimal Policies for Serial Lines with Flexible Workers.
J. Appl. Probab., 2012

Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands.
Eur. J. Oper. Res., 2012

Real-time production scheduling in a multi-grade PET resin plant under demand uncertainty.
Comput. Chem. Eng., 2012

2010
Markov decision processes with multidimensional action spaces.
Eur. J. Oper. Res., 2010

2008
Optimal stochastic scheduling of two interconnected queues with varying service rates.
Oper. Res. Lett., 2008

2007
Optimal use of excess capacity in two interconnected queues.
Math. Methods Oper. Res., 2007

Optimal preemptive scheduling on uniform machines with discounted flowtime objectives.
Eur. J. Oper. Res., 2007

1999
On the optimality of the Gittins index rule for multi-armed bandits with multiple plays.
Math. Methods Oper. Res., 1999

1996
A simple load balancing problem with decentralized information.
Math. Methods Oper. Res., 1996


  Loading...