Dynamic server assignment in a two-queue model

Article Abstract:

A study on the polling model of two M/G/1 queues which are served by a single server is presented. Service at queue 1 is exhaustive, while service at queue 2 is exhaustive unless the size of queue 1 achieves some level T during a service at queue 2. The study demonstrates the exact expressions for the joint queue length distribution at customer departure epochs, and for the steady-state queue-length and sojourn time distributions.

Operations Research

---

A travelling salesman approach to solve the F/no-idle/C (sub max) problem

Article Abstract:

The problems relating to the machines that work continuously without idle time intervals are studied and a solution akin to the travelling salesman method are suggested.

Tunisia, France, Machinery, Mathematical models, Magneto-electric machines

---

Efficiency of reductions of job-shop to flow-shop problems

Article Abstract:

A new study uses scheduling theory to solve the problem of scheduling jobs in a job-shop environment by reducing it to a flow-shop problem.

Management, Machine shops

Similar abstracts:

• Abstracts: A distance assignment approach to the facility layout problem. Hiring policies in an uncertain environment: cost and productivity trade-offs
• Abstracts: A differential game approach to the dynamic mixed behavior traffic network equilibrium problem. Computation of noncooperative equilibria in ordinal games
• Abstracts: Properties of expected costs and performance measures in stochastic models of scheduled transport. A moment based metric for 2-D and 3-D packing
• Abstracts: An approximately global optimization method for assortment problems. Dynamic programming using the Fritz-John conditions
• Abstracts: Federal Express, French Post Office to form alliance. Airborne's net loss exceeds estimates. AeroMexico to join Air France, Delta

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