Effective sequencing rules for closed manufacturing networks

Operations Research

Volumn 49, Issue 5, 2001, Pages 759-770

  Gilland, W G ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FLEXIBLE MANUFACTURING SYSTEMS; MATHEMATICAL MODELS; MATRIX ALGEBRA; OPTIMIZATION; PROBABILITY; PROCESS CONTROL; PRODUCTIVITY; RANDOM PROCESSES; SEMICONDUCTOR DEVICE MANUFACTURE; THROUGHPUT;

BROWNIAN CONTROL PROBLEM; CLOSED MANUFACTURING NETWORKS; SEQUENCING RULES; WORK-IN-PROCESS INVENTORY;

SCHEDULING;

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

References (11)

1. Scheduling networks of queues: Heavy traffic analysis of a multistation closed network
2. A simple release policy for networks of queues with controllable inputs
3. Analysis of optimal and nearly-optimal sequencing policies for a closed queueing network
4. Brownian models of queueing networks with heterogeneous customer populations
5. Scheduling networks of queues: Heavy traffic analysis of a two-station closed network
6. Some badly behaved closed queueing networks
7. Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
8. A proof of the queueing formula L = λW
9. Capacity planning with a stochastic workflow model
10. CONWIP: A pull alternative to Kanban