Auflistung nach Autor "Pandelis, D. G."
Anzeige der Dokumente 1-14 von 14
-
Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery
Pandelis, D. G.; Karamatsoukis, C. C.; Kyriakidis, E. G. (2013)We consider the problem of finding the optimal routing of a single vehicle that starts its route from a depot and picks up from and delivers K different products to N customers that are served according to a predefined ... -
Fixed task zone chaining: worker coordination and zone design for inexpensive cross-training in serial CONWIP lines
Parvin, H.; Van Oyen, M. P.; Pandelis, D. G.; Williams, D. P.; Lee, J. (2012)This work introduces a new canonical model of worker cross-training, called a Fixed Task Zone Chain (FTZC), as a special type of zone-based cross-training and develops a methodology to employ it in U-shaped CONstant Work ... -
Markov decision processes with multidimensional action spaces
Pandelis, D. G. (2010)We study controlled Markov processes where multiple decisions need to be made for each state. We present conditions on the cost structure and the state transition mechanism of the process under which optimal decisions are ... -
A note on preemptive scheduling of multiclass jobs with geometric service times and hard deadlines
Pandelis, D. G. (2013)We consider the scheduling of multiclass jobs with deadlines to the completion of their service. Deadlines are deterministic and job arrivals in each class occur at the times of deadline expirations in the respective class. ... -
Optimal control of flexible servers in two tandem queues with operating costs
Pandelis, D. G. (2008)We consider two-stage tandem queuing systems with dedicated servers in each station and flexible servers that can serve in both stations. We assume exponential service times, linear holding costs, and operating costs ... -
Optimal Control of Noncollaborative Servers in Two-Stage Tandem Queueing Systems
Pandelis, D. G. (2014)We consider two-stage tandem queueing systems with dedicated servers in each station and a flexible server that is trained to serve both stations. We assume no arrivals, exponential service times, and linear holding costs ... -
Optimal preemptive scheduling on uniform machines with discounted flowtime objectives
Pandelis, D. G. (2007)We consider the problem of scheduling n jobs on m parallel machines. Each job has a deterministic processing time and a weight associated with it. For uniform machines we show that discounted flowtime is minimized by serving ... -
Optimal stochastic scheduling of two interconnected queues with varying service rates
Pandelis, D. G. (2008)We consider two-stage tandem queueing systems attended by two specialized and one flexible server, where all servers have time varying rates. Assuming exponential processing times and linear holding costs, we derive ... -
Optimal use of excess capacity in two interconnected queues
Pandelis, D. G. (2007)We consider a two-stage tandem queueing network where jobs from station 1 join station 2 with a certain probability. Each job incurs a linear holding cost, different for each station. Each station is attended by a dedicated ... -
Real-time production scheduling in a multi-grade PET resin plant under demand uncertainty
Hatzikonstantinou, O.; Athanasiou, E.; Pandelis, D. G. (2012)We deal with the real-time production scheduling of a continuous-process multi-grade PET resin plant. The process is surcharged by sequence-dependent changeovers, sequential processing with production and space capacity, ... -
SAMPLE PATH OPTIMAL POLICIES FOR SERIAL LINES WITH FLEXIBLE WORKERS
Pandelis, D. G.; Van Oyen, M. P. (2012)We study the dynamic assignment of cross-trained workers in serial production lines characterized by stochastic process times and inventory buffers between stations. Throughput maximization is the objective. Each worker ... -
SINGLE VEHICLE ROUTING PROBLEMS WITH A PREDEFINED CUSTOMER ORDER, UNIFIED LOAD AND STOCHASTIC DISCRETE DEMANDS
Pandelis, D. G.; Karamatsoukis, C. C.; Kyriakidis, E. G. (2013)We consider the problem of finding the optimal routing of a single vehicle that delivers K different products to N customers that are served according to a particular order. It is assumed that the demands of the customers ... -
Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands
Pandelis, D. G.; Kyriakidis, E. G.; Dimitrakos, T. D. (2012)We consider the problem of finding the optimal routing of a single vehicle that delivers K different products to N customers according to a particular customer order. The demands of the customers for each product are assumed ... -
The stochastic economic lot sizing problem for non-stop multi-grade production with sequence-restricted setup changeovers
Liberopoulos, G.; Pandelis, D. G.; Hatzikonstantinou, O. (2013)We study a variant of the stochastic economic lot scheduling problem (SELSP) encountered in process industries, in which a single production facility must produce several different grades of a family of products to meet ...