Dynamic Scheduling for a Flexible Processing Network

DOI10.1287/OPRE.49.2.305.13527MaRDI QIDQ3635003zbMATH OpenOpenAlexFDO

Authors Ick-Hyun Nam

Publication date 3 July 2009

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.49.2.305.13527

zbMATH Keywords

Brownian approximationdynamic schedulingqueueing network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network
• Dynamic Scheduling of a Four-Station Queueing Network
• Scheduling networks of queues: Heavy traffic analysis of a simple open network
• Robust scheduling for flexible processing networks
• Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network

Cited in

(6)

• DVS scheduling in a line or a star network of processors
• Queueing network modelling of flexible manufacturing system using mean value analysis
• Dynamic Distributed Scheduling in Random Access Networks
• Optimal dynamic scheduling in Jackson networks
• scientific article; zbMATH DE number 1966251 (Why is no real title available?)
• Robust scheduling for flexible processing networks

This page was built for publication: Dynamic Scheduling for a Flexible Processing Network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3635003)