Using soft OR in a small company-the case of Kirby

Article Abstract:

The study shows that soft OR (Operational Research) is an important factor for developing IT strategic management in small companies. The practical experiences of applying soft OR methodologies to a small company, which is facing a complex situation where high demands are placed on them to make technological adaptations, is discussed.

Methods, Business performance management

---

Analysis of the BMAP/G/1retrial system with search of customers from the orbit

Article Abstract:

In the article, a single server retrial queuing model is considered in which customers arrive according to a BMAP. The services are offered in two modes; in mode 1, the customers are served after staying in the orbit while in mode 2 the customer is served in case it has luck to meet a free server upon arrival.

Management dynamics, Management, Customer service, Company business management, Support services

---

Scheduling orders for multiple product types with due date related objectives

Article Abstract:

The scheduling problems of the various different product types, with due date related objectives like lateness and number of orders, that deserve attention, using polynomial time algorithms are discussed.

Europe, Usage, Evaluation, Scheduling (Management), Algorithms, Algorithm

Similar abstracts:

• Abstracts: Nurse rostering problems-a bibliographic survey. Scheduling sports competitions at multiple venues-revisited. A simulated annealing and hill-climbing algorithm for the traveling tournament problem
• Abstracts: Vehicle routing with a sparse feasibility graph. Minimizing the makespan for the flow shop scheduling problem with availability constraints
• Abstracts: EU fines Microsoft $1.35 billion: penalty ends case over media player; two probes continue. Microsoft again faces EU heat after Opera Software complaint
• Abstracts: Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function. The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
• Abstracts: Differential approximation for optimal satisfiability and related problems. Polynomial approximation algorithms with performance guarantees: an introduction-by-example

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.