Dynamic scheduling for a flexible processing network

Operations Research

Volumn 49, Issue 2, 2001, Pages 305-315

  Nam, I H ^a  

^a Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; PROCESS CONTROL; SCHEDULING; SEQUENTIAL MACHINES;

DYNAMIC SCHEDULING; FLEXIBLE PROCESSING NETWORK;

FLEXIBLE MANUFACTURING SYSTEMS;

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

References (38)

1. Open, closed, and mixed networks of queues with different classes of customers
2. On heavy traffic diffusion analysis and dynamic routing in packet switched networks
3. A basic dynamic routing problem and diffusion
4. Closed queueing networks with exponential servers
5. Brownian models of queueing networks with heterogeneous customer populations
6. The QNET method for two-moment analysis of open queueing networks
7. Scheduling networks of queues: Heavy traffic analysis of a simple open network
8. Brownian models of feedforward queueing networks: Quasireversibility and product form solutions
9. Comparison of policies for routing customers to parallel queueing systems
10. Multiple channel queues in heavy traffic I, II
11. Jobshop-like queueing systems
12. Dynamic routing in open queueing networks: Brownian models, cut constraints, and resource pooling
13. Time sharing service systems I
14. Resource pooling in queueing networks with dynamic routing
15. Dynamic scheduling of a four station network
16. Multi-channel queues in heavy traffic
17. On the extension of congestion theorems to multichannel systems
18. A closed queueing maintenance network with two repair centers
19. A heavy traffic limit theorem for networks of queues with multiple customer types
20. Some diffusion approximations with state space collapse
21. Open queueing networks in heavy traffic
22. A multiclass feedback queue in heavy traffic
23. Optimal control of a two station brownian network
24. Scheduling networks of queues: Heavy traffic analysis of a two-station network with controllable inputs
25. Brownian networks with discretionary routing
26. Scheduling networks of queues: Heavy traffic analysis of a multistation network with controllable inputs
27. Dynamic scheduling of a multiclass make-to-stock queue
28. Weak convergence theorems for priority queues: Preemptive-resume discipline
29. Some useful functions for functional central limit theorems
30. The join-biased-queue rule and its application to routing in computer communication networks