Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Derivation of the N-step interdeparture time distribution in GI/G/1 queueing systems

Article Abstract:

A study was conducted to calculate the Laplace-Stieltjes transform of N-step interdeparture time distribution in GI/G/1 queueing systems. An algorithmic computing procedure was developed that provides formulas of the interdeparture time distribution obtained by considering the probability of queue sizes and the interarrival and the service time distributions. The proposed procedure was found to be an alternative and novel tool for analyzing the intractable queueing problem.

Author: Luh, Hsing
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1999
Queuing theory

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


The generalized Shifting Bottleneck Procedure (SBP)

Article Abstract:

The Shifting Botleneck Procedure (SBP) is generalized to solve various types of scheduling problems, namely, openshops, jobshops, assembly shops and shops with partial precedence constraints. Computational testing on a set of randomly generated problems shows that performance depends on the distribution of the work content of jobs and machines. A higher coefficient of the variation of work content would result in better solutions.

Author: Ramudhin, Amar, Marier, Philippe
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Management, Machine shops

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


The beta-assignment problems

Article Abstract:

The problem of assigning n number of workers to m number of jobs with worker qualifications known in advance and the maximum number of jobs per worker minimized is considered. An algorithm is developed with the purpose of identifying the cardinality of the beta assignment problem. The algorithm computes for the possible existence of an edge, the density of the edge and the running times.

Author: Chang, Gerard J., Pei-Hsin Ho
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
Operations Research, Usage, Human resource management, Management research, Optimization theory, Mathematical programming

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Research, Methods, Scheduling (Management)
Similar abstracts:
  • Abstracts: Subjective estimation of the delay time distribution in maintenance modelling. Preventive maintenance with limited historical data
  • Abstracts: Outsourcing, the compute: the UK is way ahead of Europe when it comes to outsourcing IT systems. Outsourcing the car: think twice before you outsource everything to do with your company car fleet
  • Abstracts: Taking the sting out of warranties. Why small firms lose in the selling stakes. Do or die for DIY
  • Abstracts: Decomposition and iterative aggregation in hierarchical and decentralized planning structures. A decomposition approach for the fuel-constrained economic power-dispatch problem
  • Abstracts: Determining the optimal return on investment for an advertising campaign. Towards economically optimal first-off inspection
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.