Pith. sign in

Paper Citation Record · LEDGER

Maximizing Throughput in an M/G/1 Queue with Customer Abandonments

As of 15 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2606.26544.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2606.26544 v1

Coverage vector

measured 19 of 19 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-06-26T04:10:33.880951Z

measured 19 of 19 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

19 of 19 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved19
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 585eceef-9872-4b1b-a670-81b65a609063 · outbound

This paper cites Whittle index approach to multiserver scheduling with impatient customers and DHR service times,.

Maximizing Throughput in an M/G/1 Queue with Customer Abandonments Whittle index approach to multiserver scheduling with impatient customers and DHR service times,

Reference 1

Resolution
unresolved
no resolver link, observed 2026-06-26T04:10:33.880951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-26T04:10:33.880951Z digest=sha256:ee502e88c6cca2bd02fdcdcdea8fa32e9c1165b235015b48cc95b1ed818470c7

Observation 6592e242-e66f-4142-80f2-4e6fddccd090 · outbound

This paper cites On the Gittins index in the M/G/1 queue,.

Maximizing Throughput in an M/G/1 Queue with Customer Abandonments On the Gittins index in the M/G/1 queue,

Reference 2

Resolution
unresolved
no resolver link, observed 2026-06-26T04:10:33.880951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-26T04:10:33.880951Z digest=sha256:235adf8b19fdd5bfcfdd239f06334ed357dff47dc95ff7fd3743055e85c167f5

Observation 518fd943-1ce9-4e33-83b7-0b031e13a417 · outbound

This paper cites Dynamic control of an M/M/1 service system with adjustable arrival and service rates,.

Maximizing Throughput in an M/G/1 Queue with Customer Abandonments Dynamic control of an M/M/1 service system with adjustable arrival and service rates,

Reference 3

Resolution
unresolved
no resolver link, observed 2026-06-26T04:10:33.880951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-26T04:10:33.880951Z digest=sha256:0c4ce998a8e467c875b3ee39c8a91fb338044d826737ff49225d65ce734a22db

Observation e7d3c420-0954-4b5e-9dd5-c441fd0a3fd8 · outbound

This paper cites and Shimkin N.

Maximizing Throughput in an M/G/1 Queue with Customer Abandonments and Shimkin N

Reference 4

Resolution
unresolved
no resolver link, observed 2026-06-26T04:10:33.880951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-26T04:10:33.880951Z digest=sha256:36686dd82987ecc7bd3e6c55372a818da27d91163ada85857d9ef7388149a6b4

Observation 64011aaa-0c54-413b-a44c-0178cbaf3b6c · outbound

This paper cites Scheduling of multi-class multi-server queueing systems with abandonments,.

Maximizing Throughput in an M/G/1 Queue with Customer Abandonments Scheduling of multi-class multi-server queueing systems with abandonments,

Reference 5

Resolution
unresolved
no resolver link, observed 2026-06-26T04:10:33.880951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-26T04:10:33.880951Z digest=sha256:571d11a49a7a1773450ed63e0b96fa6bc003aa2547c80fdf69209b28dc29eab7

Observation 7b975f20-53d6-4fde-8c57-a467f1ee3aa3 · outbound

This paper cites Kcompeting queues with customer abandonment: Optimality of a generalizedcµ- rule by the Smoothed Rate Truncation method.

Maximizing Throughput in an M/G/1 Queue with Customer Abandonments Kcompeting queues with customer abandonment: Optimality of a generalizedcµ- rule by the Smoothed Rate Truncation method

Reference 6

Resolution
unresolved
no resolver link, observed 2026-06-26T04:10:33.880951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-26T04:10:33.880951Z digest=sha256:2286b0445e01d4d93853a20b2b68686ed7de28509c7711fd4cffc615eba1c221

Observation 32be3df0-2c85-4216-8131-759fea3a9c20 · outbound

This paper cites Multiple server preemptive scheduling with impatience,.

Maximizing Throughput in an M/G/1 Queue with Customer Abandonments Multiple server preemptive scheduling with impatience,

Reference 7

Resolution
unresolved
no resolver link, observed 2026-06-26T04:10:33.880951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-26T04:10:33.880951Z digest=sha256:fd54893558abe5ef05f13dd92621ed1693ec3f92c7c8c0049a562135b1cb531b

Observation dd848bdf-136e-4f36-a414-f1781edb55a9 · outbound

This paper cites Stochastic scheduling with abandonment: Necessary and sufficient conditions for the optimality of a strict priority policy,.

Maximizing Throughput in an M/G/1 Queue with Customer Abandonments Stochastic scheduling with abandonment: Necessary and sufficient conditions for the optimality of a strict priority policy,

Reference 8

Resolution
unresolved
no resolver link, observed 2026-06-26T04:10:33.880951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-26T04:10:33.880951Z digest=sha256:b8648d739d3519c290cc99caf91f1924137284457ba210974ca890c898e43ac2

Observation 59d9b1a2-c73c-42ba-ace2-97e4a9a7f652 · outbound

This paper cites SRPT scheduling discipline in many-server queues with impatient customers.

Maximizing Throughput in an M/G/1 Queue with Customer Abandonments SRPT scheduling discipline in many-server queues with impatient customers

Reference 9

Resolution
unresolved
no resolver link, observed 2026-06-26T04:10:33.880951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-26T04:10:33.880951Z digest=sha256:20cfca46220bd8710abe8eb9f1616220b9b72d0d1f37a743a64823a27e49448d

Observation df54b35b-72d3-4283-aef9-03442db0a88e · outbound

This paper cites Dynamic control of a single-server system with abandonments,.

Maximizing Throughput in an M/G/1 Queue with Customer Abandonments Dynamic control of a single-server system with abandonments,

Reference 10

Resolution
unresolved
no resolver link, observed 2026-06-26T04:10:33.880951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-26T04:10:33.880951Z digest=sha256:aca81cd261f2fc26480dbafd738bf9647bbbc5589ab641e5e96f0c32b22c7190

Observation 1a35da76-c96e-4055-a70f-75e01e107c6c · outbound

This paper cites C., Glazebrook, K., and Weber, R.Multi-armed Bandit Allocation Indices.

Maximizing Throughput in an M/G/1 Queue with Customer Abandonments C., Glazebrook, K., and Weber, R.Multi-armed Bandit Allocation Indices

Reference 11

Resolution
unresolved
no resolver link, observed 2026-06-26T04:10:33.880951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-26T04:10:33.880951Z digest=sha256:55e03b1367ae07b031824fd44fd8c628d27212cbc60869d7b91ce8449d9136b2

Observation 6defdb83-326f-47cc-8add-ebb0d9e538bc · outbound

This paper cites SRPT for multi-server systems.

Maximizing Throughput in an M/G/1 Queue with Customer Abandonments SRPT for multi-server systems

Reference 12

Resolution
unresolved
no resolver link, observed 2026-06-26T04:10:33.880951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-26T04:10:33.880951Z digest=sha256:168c6b1a4b6a06ffb0a94d6c81d46fd4f120f6f36a76ceb9d0e382fdce3e185c

Observation 8146fcdd-cad1-4cbe-aa7c-aad31d4d68ea · outbound

This paper cites A survey of recent results on continuous-time Markov decision processes,.

Maximizing Throughput in an M/G/1 Queue with Customer Abandonments A survey of recent results on continuous-time Markov decision processes,

Reference 13

Resolution
unresolved
no resolver link, observed 2026-06-26T04:10:33.880951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-26T04:10:33.880951Z digest=sha256:c8a367f8b7556dbc6a6ea68332a9fbe5070c6da0e20db4400f61a7e767861887

Observation 9a5d9ea4-224b-447d-94cd-c15f697b1ce6 · outbound

This paper cites and Hern´ andez-Lerma, O.Continuous-Time Markov Decision Processes: Theory and Ap- plications, Springer, Berlin, 2009.

Maximizing Throughput in an M/G/1 Queue with Customer Abandonments and Hern´ andez-Lerma, O.Continuous-Time Markov Decision Processes: Theory and Ap- plications, Springer, Berlin, 2009

Reference 14

Resolution
unresolved
no resolver link, observed 2026-06-26T04:10:33.880951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-26T04:10:33.880951Z digest=sha256:1889788f8f5251949ab3ae5ddd7ffcbbf02800a41e11d3d54ccba636abf87e37

Observation 0ac732c3-37f9-4e31-b20f-cb2f22b902d4 · outbound

This paper cites Dynamic fluid-based scheduling in a multi-class abandonment queue,.

Maximizing Throughput in an M/G/1 Queue with Customer Abandonments Dynamic fluid-based scheduling in a multi-class abandonment queue,

Reference 15

Resolution
unresolved
no resolver link, observed 2026-06-26T04:10:33.880951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-26T04:10:33.880951Z digest=sha256:31d78e5b74af2531ae75deb5ea5bddc19dea50218ef12f644a924810306b60cb

Observation 2e5c22d3-9aa5-45b7-b4e7-9c4e0ff30c73 · outbound

This paper cites an unresolved cited work.

Maximizing Throughput in an M/G/1 Queue with Customer Abandonments Unresolved cited work

Reference 16

Resolution
unresolved
no resolver link, observed 2026-06-26T04:10:33.880951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-26T04:10:33.880951Z digest=sha256:1e5ac7c450e48238d2b9b80320a8e261e381aa43e75e9fb8c3b351b5ecc66978

Observation b3a7f8ff-519b-4e42-8791-3c477b9da4dd · outbound

This paper cites On extremal service disciplines in single-stage queueing systems,.

Maximizing Throughput in an M/G/1 Queue with Customer Abandonments On extremal service disciplines in single-stage queueing systems,

Reference 17

Resolution
unresolved
no resolver link, observed 2026-06-26T04:10:33.880951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-26T04:10:33.880951Z digest=sha256:338936d380e3eacff5ac6b3cb6877007c71a61d2b3a91c501d23865f8daf6941

Observation 449dbee1-ea8d-4573-89a1-79c52eb81e3f · outbound

This paper cites A proof of the optimality of the Shortest Remaining Processing Time discipline,.

Maximizing Throughput in an M/G/1 Queue with Customer Abandonments A proof of the optimality of the Shortest Remaining Processing Time discipline,

Reference 18

Resolution
unresolved
no resolver link, observed 2026-06-26T04:10:33.880951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-26T04:10:33.880951Z digest=sha256:5bd5b6d15a9cfd11c21cc14256b808d67455d55712f3e41a56f43928e058e789

Observation 9c1ac813-06fb-4e53-99a3-15edf7b81d1a · outbound

This paper cites Simple near-optimal scheduling for the M/G/1,.

Maximizing Throughput in an M/G/1 Queue with Customer Abandonments Simple near-optimal scheduling for the M/G/1,

Reference 19

Resolution
unresolved
no resolver link, observed 2026-06-26T04:10:33.880951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-26T04:10:33.880951Z digest=sha256:25e13072aeb03954438e416b9ab378aa19e778d21ea53e19769b03475647d3ef

Pith citing papers

No inbound Pith citation observations are available.