Jackson’s Conjecture on Earliest Due Date Scheduling

DOI10.1287/moor.5.3.460zbMath0438.90033OpenAlexW2112617419WikidataQ123217256 ScholiaQ123217256MaRDI QIDQ3880553

Henry M. Goldberg

Publication date: 1980

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.5.3.460

zbMATH Keywords

latenessqueueing systemspreemptioninverse functionsingle server queueing systemJackson's conjectureearliest due date schedulingvirtual waiting time distribution function

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (2)

Impact of priority sequencing decisions on on-time probability and expected tardiness of orders in make-to-order production systems with external due-dates ⋮ A first passage time problem for spectrally positive Lévy processes and its application to a dynamic priority queue

This page was built for publication: Jackson’s Conjecture on Earliest Due Date Scheduling