To access the full text documents, please follow this link: http://hdl.handle.net/10230/998

Optimization of multiclass queueing networks with changeover times via the achievable region method: Part II, the multi-station case
Bertsimas, Dimitris; Niño-Mora, José
Universitat Pompeu Fabra. Departament d'Economia i Empresa
We address the problem of scheduling a multi-station multiclassqueueing network (MQNET) with server changeover times to minimizesteady-state mean job holding costs. We present new lower boundson the best achievable cost that emerge as the values ofmathematical programming problems (linear, semidefinite, andconvex) over relaxed formulations of the system's achievableperformance region. The constraints on achievable performancedefining these formulations are obtained by formulatingsystem's equilibrium relations. Our contributions include: (1) aflow conservation interpretation and closed formulae for theconstraints previously derived by the potential function method;(2) new work decomposition laws for MQNETs; (3) new constraints(linear, convex, and semidefinite) on the performance region offirst and second moments of queue lengths for MQNETs; (4) a fastbound for a MQNET with N customer classes computed in N steps; (5)two heuristic scheduling policies: a priority-index policy, anda policy extracted from the solution of a linear programmingrelaxation.
2005-09-15
Operations Management
multiclass queueing network
changeover times
optimal scheduling
performance region
linear programming relaxation
semidefinite programming
convex programming
L'accés als continguts d'aquest document queda condicionat a l'acceptació de les condicions d'ús establertes per la següent llicència Creative Commons
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Working Paper
         

Show full item record

 

Coordination

 

Supporters