{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Y6FVZTDDWHLDPIXJBFC6JBQIKH","short_pith_number":"pith:Y6FVZTDD","schema_version":"1.0","canonical_sha256":"c78b5ccc63b1d637a2e90945e4860851dc9695db75012e7f438856e37a3e5baa","source":{"kind":"arxiv","id":"1807.05367","version":2},"attestation_state":"computed","paper":{"title":"A $c/\\mu$-Rule for Service Resource Allocation in Group-Server Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Li Xia, Peter W. Glynn, Quan-Lin Li, Zhe George Zhang","submitted_at":"2018-07-14T09:39:09Z","abstract_excerpt":"In this paper, we study a dynamic on/off server scheduling problem in a queueing system with multi-class servers, where servers are heterogeneous and can be classified into $K$ groups. Servers in the same group are homogeneous. A scheduling policy determines the number of working servers (servers that are turned on) in each group at every state $n$ (number of customers in the system). Our goal is to find the optimal scheduling policy to minimize the long-run average cost, which consists of an increasing convex holding cost and a linear operating cost. We use the sensitivity-based optimization "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1807.05367","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-14T09:39:09Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"e73a4203b39ed418095ad65d35cf37c2b88bc2d5839a15369a276115c671ad3d","abstract_canon_sha256":"aa61b5a04160e1d4fd37ae8cf0ef9148ce8ca37d3d5c25ee2e3f3a4d66bbda48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:55.837050Z","signature_b64":"Aenj10tmy7a7Pahkzc84x7EoWzxfzYjzfp9xZwXXKEA2xkrd5Fv9BkBpHGaDTAYWuDXBlCRQw875EzuY56ltAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c78b5ccc63b1d637a2e90945e4860851dc9695db75012e7f438856e37a3e5baa","last_reissued_at":"2026-05-18T00:05:55.836510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:55.836510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A $c/\\mu$-Rule for Service Resource Allocation in Group-Server Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Li Xia, Peter W. Glynn, Quan-Lin Li, Zhe George Zhang","submitted_at":"2018-07-14T09:39:09Z","abstract_excerpt":"In this paper, we study a dynamic on/off server scheduling problem in a queueing system with multi-class servers, where servers are heterogeneous and can be classified into $K$ groups. Servers in the same group are homogeneous. A scheduling policy determines the number of working servers (servers that are turned on) in each group at every state $n$ (number of customers in the system). Our goal is to find the optimal scheduling policy to minimize the long-run average cost, which consists of an increasing convex holding cost and a linear operating cost. We use the sensitivity-based optimization "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05367","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.05367","created_at":"2026-05-18T00:05:55.836599+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.05367v2","created_at":"2026-05-18T00:05:55.836599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05367","created_at":"2026-05-18T00:05:55.836599+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y6FVZTDDWHLD","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y6FVZTDDWHLDPIXJ","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y6FVZTDD","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y6FVZTDDWHLDPIXJBFC6JBQIKH","json":"https://pith.science/pith/Y6FVZTDDWHLDPIXJBFC6JBQIKH.json","graph_json":"https://pith.science/api/pith-number/Y6FVZTDDWHLDPIXJBFC6JBQIKH/graph.json","events_json":"https://pith.science/api/pith-number/Y6FVZTDDWHLDPIXJBFC6JBQIKH/events.json","paper":"https://pith.science/paper/Y6FVZTDD"},"agent_actions":{"view_html":"https://pith.science/pith/Y6FVZTDDWHLDPIXJBFC6JBQIKH","download_json":"https://pith.science/pith/Y6FVZTDDWHLDPIXJBFC6JBQIKH.json","view_paper":"https://pith.science/paper/Y6FVZTDD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.05367&json=true","fetch_graph":"https://pith.science/api/pith-number/Y6FVZTDDWHLDPIXJBFC6JBQIKH/graph.json","fetch_events":"https://pith.science/api/pith-number/Y6FVZTDDWHLDPIXJBFC6JBQIKH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y6FVZTDDWHLDPIXJBFC6JBQIKH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y6FVZTDDWHLDPIXJBFC6JBQIKH/action/storage_attestation","attest_author":"https://pith.science/pith/Y6FVZTDDWHLDPIXJBFC6JBQIKH/action/author_attestation","sign_citation":"https://pith.science/pith/Y6FVZTDDWHLDPIXJBFC6JBQIKH/action/citation_signature","submit_replication":"https://pith.science/pith/Y6FVZTDDWHLDPIXJBFC6JBQIKH/action/replication_record"}},"created_at":"2026-05-18T00:05:55.836599+00:00","updated_at":"2026-05-18T00:05:55.836599+00:00"}