101暑期_研究所選修課程開課通知
工業工程與工程管理學系
101學年研究所選修課程(暑期)
IEEM5106隨機服務系統(T2T3T4W2W3W4R2R3R4)★此課程上課區間：7/1~8/10
授課老師：周瑋民教授
Outline
I. Basic Concept
‧ Definition
‧ Cost Analysis And Operations Finance
‧ Performance Measures
‧ Graphical Representation
‧ Highway Traffic Model
‧ A Basic Formula: L = W
‧ Examples for Real-World Applications
II. Characteristics of Demand Pattern and Service Time
‧ Simple Arrival Process and Its Properties
‧ Poisson process, uniform arrivals and exponential intervals
‧ The Very Two Distributions with Memoryless Property
‧ Split Process, Thinning Process and Superposed Process
‧ Insurance Policy
‧ Satellite Network System – Aloha
‧ Different Types of Inter-arrival Time
‧ Demand and Service Time for Different Applications
‧ manual work time
‧ learning effect, effect of population size
‧ life time and residual life
‧ characteristics of failure rate
‧ repair work
‧ other applications
- data reference, clinic service, office work, etc.
III. Simple Model
‧ Queue Length Distribution
‧ Average Queue Length and Average Waiting Time
‧ Waiting Time Distribution
‧ Time Proportion and Relative Frequency
‧ Balance Equations
‧ Flow Conservation Law
‧ Gambling Ruin Problem (birth-and-death process)
‧ Departure Process
IV. Variation of Simple Model
‧ State dependent arrival and service rates
‧ multiple servers
‧ discouraged arrivals (impatient customers, e.g., restaurant)
‧ limited waiting space (just-in-time or kanban system)
‧ fixed population size (closed-loop system)
‧ machine-repairmen problem (resource planning for customer engineer)
‧ Batch arrival
‧ Erlang and hyper-exponential service times
‧ Multiple job classes (airport, port, emergency room, manufacturing)
‧ Further Discussions on Performance Measures (busy period and busy cycle)
‧ Models of Local Area Network
IV. Systems with General Service Time
‧ Branch Process and Busy Period
‧ Virtual Delay and Work Conservation
‧ Workload As Seen by A Random Arrival
= Total Service Times of Jobs Waiting for Service
+ Remaining Service Time if Any
‧ Explicit formula for Average Delay in M/G/1 Queues
‧ Models for Material Handling Systems
‧ Approximation for Queues
‧ Queue First Exceptional Service (system with set-up time)
IV. Priority Rules for Pricing/Performance Management
‧ Real World Implementation
‧ Priority Systems (triage and optimization rule)
‧ Non Preemptive Rule (port management)
‧ Preemptive Rule (emergency room)
‧ Processor Sharing/Round Robin
(CPU and communication dispatching rule)
‧ Feedback System (computing systems)
VII. Systems with Multiple Servers
‧ Markovian behavior of M/D/∞ system
‧ M/G/∞ system as a composite queue of many M/D/∞ systems (time sharing system, approximation for emergency services, spare parts management )
‧ M/G/k system approximated by looking at heavy traffic and light traffic conditions (clinic or hospital service, toll plaza, cashier registers, banking, post office)
‧ Service time with CV < 1
‧ Service time with CV > 1
‧ Emergency Service Systems
VIII. Tandem and Network Systems
‧ Tandem queues (production line)
‧ Open network (communication network, office work as whit-collar factory)
‧ Closed network (computing system)
‧ Comments on Simulation
本課程列入研究所選修學分，歡迎修習!!
101暑期_研究所選修課程開課通知.pdf
瀏覽數: