Discrete scheduling and critical utilization

DOI10.1016/J.EJOR.2023.06.010MaRDI QIDQ6090148zbMATH OpenFDO

Authors Oleg S. Pianykh, Sebastián A. Pérez, Chengzhao ``Richard'' Zhang

Publication date 14 November 2023

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2023.06.010

zbMATH Keywords

queueingschedulingutilization

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A Proof for the Queuing Formula: L = λW
• An Analysis Of Emergency Room Wait Time Issues Via Computer Simulation
• Appointment scheduling with discrete random durations
• scientific article; zbMATH DE number 3764811 (Why is no real title available?)
• scientific article; zbMATH DE number 3522951 (Why is no real title available?)
• scientific article; zbMATH DE number 2098533 (Why is no real title available?)
• On a Real-Time Scheduling Problem
• Statistical Analysis of a Telephone Call Center
• Table of integrals, series, and products. Translated from the Russian. Translation edited and with a preface by Alan Jeffrey and Daniel Zwillinger. With one CD-ROM (Windows, Macintosh and UNIX)
• The GI/Geom/N Queue In Discrete Time
• The single server queue in discrete time‐numerical analysis I
• The single server queue in discrete time‐numerical analysis II
• The single server queue in discrete time‐numerical analysis III
• The single server queue in discrete time‐numerical analysis IV

This page was built for publication: Discrete scheduling and critical utilization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090148)