Publication | Closed Access
"First come, first served" can be unstable!
113
Citations
5
References
1994
Year
EngineeringDynamic Resource AllocationOperations ResearchParallelism (Rhetoric)Stochastic ProcessesSystems EngineeringRepeated PatternTheatreFirst ComeManufacturing SystemsScheduling (Computing)Computer ScienceAdequate CapacityQueueing SystemsScheduling ProblemScheduling (Operating Systems)Production SchedulingScheduling (Production Processes)PlaywritingReal-time SystemsArtsScheduling (Project Management)
Considers flexible manufacturing systems using the "first come, first served" (FCFS or FIFO) scheduling policy at each machine. The authors describe and discuss in some detail simple deterministic examples which have adequate capacity but which, under FCFS, can exhibit instability; unboundedly growing WIP taking the form of a repeated pattern of behavior with the repetitions on an increasing scale.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
| Year | Citations | |
|---|---|---|
Page 1
Page 1