Optimally scheduling \(N\) customer arrival times for a single-server system

DOI10.1016/S0305-0548(96)00093-7zbMath0894.90065WikidataQ104740102 ScholiaQ104740102MaRDI QIDQ1370658

Pu Patrick Wang

Publication date: 26 October 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

single-server system; matrix algebraic manipulation; mean flow-times; phase-type distribution functions

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90C30: Nonlinear programming

90B22: Queues and service in operations research

Related Items

Computationally efficient evaluation of appointment schedules in health care, Queueing models for appointment-driven systems, Optimal stationary appointment schedules, Sequencing and scheduling \(N\) customers for a stochastic server, Next-day operating room scheduling with uncertain surgery durations: exact analysis and heuristics, A computational approach to optimized appointment scheduling, A tandem queueing model for an appointment-based service system, Sequencing in an appointment system with deterministic arrivals and non-identical exponential service times, Optimal appointment scheduling in continuous time: the lag order approximation method

Uses Software

• cheney-kincaid

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approach to nonlinear programming
• Matching moments to phase distributions: nonlinear programming approaches
• Meda: mixed erlang distributions as phase-type representations of empirical distribution functions.
• Nineteen Dubious Ways to Compute the Exponential of a Matrix
• Approximate Expressions for Queueing Systems with Scheduled Arrivals and Established Service Order
• Matching moments to phase distributions: Mixtures of erlang distributions of common order
• Choosing a Good Appointment System—A Study of Queues of the Type (D, M, 1)