Scheduling of multi-class single-server queues under nontraditional performance measures

Operations Research

Volumn 48, Issue 3, 2000, Pages 482-489

  Ayhan, H ^a   Olsen, T L ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; ASSEMBLY MACHINES; HEURISTIC METHODS; MANUFACTURE; OPERATIONS RESEARCH; OPTIMIZATION; QUEUEING THEORY;

HEAVY TRAFFIC ANALYSIS; MULTI-CLASS SINGLE-SERVER QUEUES; PRODUCTION SCHEDULING;

SCHEDULING;

EID: 0034179695     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.48.3.482.12428     Document Type: Article

References (15)

1. Job flow control in assembly operations
2. Dynamic, non-preemptive priority queues with general, linearly increasing priority functions
3. Minimizing waiting time variance in the single machine problem
4. M/G/c queueing systems with multiple customer classes: Characterization and control of achievable performance under nonpreemptive priority rules
5. Scheduling manufacturing systems of re-entrant lines
6. A practical scheduling method for multi-class production systems with setups
7. Some diffusion approximations with state space collapse. Modeling and performance evaluation methodology
8. Dynamic scheduling with convex delay costs: The generalized c-mu rule
9. Due-date setting and priority sequencing in a multiclass M/G/1 queue
10. Scheduling networks of queues: Heavy traffic analysis of a bi-criteria problem
11. Refining diffusion approximations for queues