Control and scheduling in a two-station queueing network: Optimal policies and heuristics (Q1342957)

From MaRDI portal
Revision as of 13:36, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Control and scheduling in a two-station queueing network: Optimal policies and heuristics
scientific article

    Statements

    Control and scheduling in a two-station queueing network: Optimal policies and heuristics (English)
    0 references
    0 references
    0 references
    0 references
    15 January 1995
    0 references
    A queueing system with two service stations and two types of customers is treated. The first type of customer needs service only at the first station, the second type needs service on both stations, at first at station one and then at station two. The authors state an optimal control problem for this service situation, which consists in the minimization of a discounted cost function over an infinite time horizon. This involves especially the sharing of the service effort between the two types of customers. Under an intensity model the optimal policy is proved to be a switching one between serving type 1 customers, serving type 2 customers and remaining idle. Also heuristic approaches are discussed.
    0 references
    queueing system
    0 references
    two service stations
    0 references
    two types of customers
    0 references
    infinite time horizon
    0 references
    heuristic approaches
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references