Appointment sequencing: why the smallest-variance-first rule may not be optimal
DOI10.1016/J.EJOR.2016.06.004zbMath1394.90323OpenAlexW254988821MaRDI QIDQ1751273
Zhichao Zheng, Chung-Piaw Teo, Qingxia Kong, Chung-Yee Lee
Publication date: 24 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://ink.library.smu.edu.sg/lkcsb_research/4474
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36) Theory of organizations, manpower planning in operations research (90B70)
Related Items (9)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sequential clinical scheduling with service criteria
- Sequencing and scheduling \(N\) customers for a stochastic server
- Providing radiology health care services to stochastic demand of different customer classes
- Scheduling Arrivals to a Stochastic Service Delivery System Using Copositive Cones
- Appointment Scheduling with Discrete Random Durations
- A Note on Appointment Scheduling with Piecewise Linear Cost Functions
This page was built for publication: Appointment sequencing: why the smallest-variance-first rule may not be optimal