Optimization of multiclass queueing networks with changeover times via the achievable region method: Part II, the multi-station case

Mostra el registre complet Registre parcial de l'ítem

• dc.contributor.author Bertsimas, Dimitrisca
• dc.contributor.author Niño-Mora, Joséca
• dc.contributor.other Universitat Pompeu Fabra. Departament d'Economia i Empresa
• dc.date.accessioned 2017-07-26T10:49:27Z
• dc.date.available 2017-07-26T10:49:27Z
• dc.date.issued 1996-09-01
• dc.date.modified 2017-07-23T02:03:53Z
• dc.description.abstract We address the problem of scheduling a multi-station multiclass queueing network (MQNET) with server changeover times to minimize steady-state mean job holding costs. We present new lower bounds on the best achievable cost that emerge as the values of mathematical programming problems (linear, semidefinite, and convex) over relaxed formulations of the system's achievable performance region. The constraints on achievable performance defining these formulations are obtained by formulating system's equilibrium relations. Our contributions include: (1) a flow conservation interpretation and closed formulae for the constraints 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 of first and second moments of queue lengths for MQNETs; (4) a fast bound for a MQNET with N customer classes computed in N steps; (5) two heuristic scheduling policies: a priority-index policy, and a policy extracted from the solution of a linear programming relaxation.
• dc.format.mimetype application/pdfca
• dc.identifier https://econ-papers.upf.edu/ca/paper.php?id=314
• dc.identifier.citation Mathematics of Operations Research, 24, (1999), pp. 331-361
• dc.identifier.uri http://hdl.handle.net/10230/998
• dc.language.iso eng
• dc.relation.ispartofseries Economics and Business Working Papers Series; 314
• dc.rights 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
• dc.rights.accessRights info:eu-repo/semantics/openAccess
• dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/3.0/es/
• dc.subject.keyword multiclass queueing network
• dc.subject.keyword changeover times
• dc.subject.keyword optimal scheduling
• dc.subject.keyword performance region
• dc.subject.keyword linear programming relaxation
• dc.subject.keyword semidefinite programming
• dc.subject.keyword convex programming
• dc.subject.keyword Operations Management
• dc.title Optimization of multiclass queueing networks with changeover times via the achievable region method: Part II, the multi-station caseca
• dc.type info:eu-repo/semantics/workingPaper