Approximations for networks of queues with overtime
Article Abstract:
Approximations for open queueing networks with overtime operations occurring at some stations were developed. Bounds were provided for approximation performance for single and multi-machine stations. The approximations could be used along with parametric decomposition techniques to evaluate networks of queues. The quality of the approximations was tested by performing six experiments involving comparisons of the estimates of the mean number of jobs at each station. The tests also assessed the robustness of the parametric decomposition technique in estimating the mean number of jobs in networks with overtime operations. The results indicated that the approximation technique was robust and performed satisfactorily.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1991
User Contributions:
Comment about this article or add new information about this topic:
The multi-item capacitated lot size problem: error bounds of Manne's formulations
Article Abstract:
An approximation technique is evaluated and used for the multi-item lot size conflict. The approximation scheme is based on the optimal basic solution of the linear programming problem taken from the previous problem. To obtain the approximate solution, take the linear convex arrangement of the optimal solution for the linear programming problem.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1986
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Getting IT--the organisational dynamic of the dot.com. Crossing the Great Divide: integrating knowledge management and organisational learning
- Abstracts: The use of games in reflective learning. Understanding training commitment. Learning to produce knowledge--the contribution of mentoring
- Abstracts: Some Models for Estimating Technical and scale Inefficiencies in Data Envelopment Analysis. Response to 'Decision Problems under Risk and Change Constrained Programming; Dilemmas in the Transition'
- Abstracts: Deterministic approximations to co-production problems with service constraints and random yields. A mathematical programming approach to a deterministic Kanban system
- Abstracts: Retrospective accounts of research factors associated with significant and not-so-significant research outcomes